36.37/19.54 YES 36.37/19.54 36.37/19.55 Ultimate: Cannot open display: 36.37/19.55 This is Ultimate 0.1.24-8dc7c08-m 36.37/19.55 [2019-03-28 12:44:01,661 INFO L170 SettingsManager]: Resetting all preferences to default values... 36.37/19.55 [2019-03-28 12:44:01,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 36.37/19.55 [2019-03-28 12:44:01,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 36.37/19.55 [2019-03-28 12:44:01,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 36.37/19.55 [2019-03-28 12:44:01,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 36.37/19.55 [2019-03-28 12:44:01,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 36.37/19.55 [2019-03-28 12:44:01,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 36.37/19.55 [2019-03-28 12:44:01,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 36.37/19.55 [2019-03-28 12:44:01,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 36.37/19.55 [2019-03-28 12:44:01,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 36.37/19.55 [2019-03-28 12:44:01,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 36.37/19.55 [2019-03-28 12:44:01,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 36.37/19.55 [2019-03-28 12:44:01,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 36.37/19.55 [2019-03-28 12:44:01,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 36.37/19.55 [2019-03-28 12:44:01,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 36.37/19.55 [2019-03-28 12:44:01,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 36.37/19.55 [2019-03-28 12:44:01,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 36.37/19.55 [2019-03-28 12:44:01,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 36.37/19.55 [2019-03-28 12:44:01,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 36.37/19.55 [2019-03-28 12:44:01,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,697 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 36.37/19.55 [2019-03-28 12:44:01,697 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 36.37/19.55 [2019-03-28 12:44:01,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 36.37/19.55 [2019-03-28 12:44:01,699 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 36.37/19.55 [2019-03-28 12:44:01,700 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 36.37/19.55 [2019-03-28 12:44:01,700 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 36.37/19.55 [2019-03-28 12:44:01,701 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 36.37/19.55 [2019-03-28 12:44:01,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,702 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 36.37/19.55 [2019-03-28 12:44:01,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 36.37/19.55 [2019-03-28 12:44:01,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 36.37/19.55 [2019-03-28 12:44:01,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 36.37/19.55 [2019-03-28 12:44:01,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 36.37/19.55 [2019-03-28 12:44:01,705 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 36.37/19.55 [2019-03-28 12:44:01,719 INFO L110 SettingsManager]: Loading preferences was successful 36.37/19.55 [2019-03-28 12:44:01,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 36.37/19.55 [2019-03-28 12:44:01,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 36.37/19.55 [2019-03-28 12:44:01,721 INFO L133 SettingsManager]: * Rewrite not-equals=true 36.37/19.55 [2019-03-28 12:44:01,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 36.37/19.55 [2019-03-28 12:44:01,721 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 36.37/19.55 [2019-03-28 12:44:01,721 INFO L133 SettingsManager]: * Use SBE=true 36.37/19.55 [2019-03-28 12:44:01,722 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 36.37/19.55 [2019-03-28 12:44:01,722 INFO L133 SettingsManager]: * Use old map elimination=false 36.37/19.55 [2019-03-28 12:44:01,722 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 36.37/19.55 [2019-03-28 12:44:01,722 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 36.37/19.55 [2019-03-28 12:44:01,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 36.37/19.55 [2019-03-28 12:44:01,722 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 36.37/19.55 [2019-03-28 12:44:01,723 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 36.37/19.55 [2019-03-28 12:44:01,723 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 36.37/19.55 [2019-03-28 12:44:01,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 36.37/19.55 [2019-03-28 12:44:01,723 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 36.37/19.55 [2019-03-28 12:44:01,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE 36.37/19.55 [2019-03-28 12:44:01,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 36.37/19.55 [2019-03-28 12:44:01,724 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 36.37/19.55 [2019-03-28 12:44:01,724 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 36.37/19.55 [2019-03-28 12:44:01,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 36.37/19.55 [2019-03-28 12:44:01,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 36.37/19.55 [2019-03-28 12:44:01,724 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 36.37/19.55 [2019-03-28 12:44:01,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 36.37/19.55 [2019-03-28 12:44:01,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 36.37/19.55 [2019-03-28 12:44:01,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 36.37/19.55 [2019-03-28 12:44:01,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 36.37/19.55 [2019-03-28 12:44:01,725 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 36.37/19.55 [2019-03-28 12:44:01,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 36.37/19.55 [2019-03-28 12:44:01,764 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 36.37/19.55 [2019-03-28 12:44:01,767 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 36.37/19.55 [2019-03-28 12:44:01,769 INFO L271 PluginConnector]: Initializing CDTParser... 36.37/19.55 [2019-03-28 12:44:01,769 INFO L276 PluginConnector]: CDTParser initialized 36.37/19.55 [2019-03-28 12:44:01,770 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 36.37/19.55 [2019-03-28 12:44:01,835 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/69637951c20d4651ab06569d1358fed2/FLAG6ea3884c7 36.37/19.55 [2019-03-28 12:44:02,194 INFO L307 CDTParser]: Found 1 translation units. 36.37/19.55 [2019-03-28 12:44:02,194 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 36.37/19.55 [2019-03-28 12:44:02,195 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 36.37/19.55 [2019-03-28 12:44:02,202 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/69637951c20d4651ab06569d1358fed2/FLAG6ea3884c7 36.37/19.55 [2019-03-28 12:44:02,596 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/69637951c20d4651ab06569d1358fed2 36.37/19.55 [2019-03-28 12:44:02,608 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 36.37/19.55 [2019-03-28 12:44:02,609 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 36.37/19.55 [2019-03-28 12:44:02,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 36.37/19.55 [2019-03-28 12:44:02,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 36.37/19.55 [2019-03-28 12:44:02,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 36.37/19.55 [2019-03-28 12:44:02,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16471f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:02,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 36.37/19.55 [2019-03-28 12:44:02,643 INFO L176 MainTranslator]: Built tables and reachable declarations 36.37/19.55 [2019-03-28 12:44:02,810 INFO L206 PostProcessor]: Analyzing one entry point: main 36.37/19.55 [2019-03-28 12:44:02,823 INFO L191 MainTranslator]: Completed pre-run 36.37/19.55 [2019-03-28 12:44:02,842 INFO L206 PostProcessor]: Analyzing one entry point: main 36.37/19.55 [2019-03-28 12:44:02,915 INFO L195 MainTranslator]: Completed translation 36.37/19.55 [2019-03-28 12:44:02,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02 WrapperNode 36.37/19.55 [2019-03-28 12:44:02,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 36.37/19.55 [2019-03-28 12:44:02,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 36.37/19.55 [2019-03-28 12:44:02,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 36.37/19.55 [2019-03-28 12:44:02,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 36.37/19.55 [2019-03-28 12:44:02,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 36.37/19.55 [2019-03-28 12:44:02,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 36.37/19.55 [2019-03-28 12:44:02,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 36.37/19.55 [2019-03-28 12:44:02,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized 36.37/19.55 [2019-03-28 12:44:02,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 [2019-03-28 12:44:02,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 36.37/19.55 [2019-03-28 12:44:02,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 36.37/19.55 [2019-03-28 12:44:02,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... 36.37/19.55 [2019-03-28 12:44:02,985 INFO L276 PluginConnector]: RCFGBuilder initialized 36.37/19.55 [2019-03-28 12:44:02,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (1/1) ... 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 36.37/19.55 [2019-03-28 12:44:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 36.37/19.55 [2019-03-28 12:44:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 36.37/19.55 [2019-03-28 12:44:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 36.37/19.55 [2019-03-28 12:44:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 36.37/19.55 [2019-03-28 12:44:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 36.37/19.55 [2019-03-28 12:44:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 36.37/19.55 [2019-03-28 12:44:03,275 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 36.37/19.55 [2019-03-28 12:44:03,276 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 36.37/19.55 [2019-03-28 12:44:03,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:03 BoogieIcfgContainer 36.37/19.55 [2019-03-28 12:44:03,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 36.37/19.55 [2019-03-28 12:44:03,278 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 36.37/19.55 [2019-03-28 12:44:03,278 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 36.37/19.55 [2019-03-28 12:44:03,280 INFO L276 PluginConnector]: BlockEncodingV2 initialized 36.37/19.55 [2019-03-28 12:44:03,281 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:03" (1/1) ... 36.37/19.55 [2019-03-28 12:44:03,297 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges 36.37/19.55 [2019-03-28 12:44:03,299 INFO L258 BlockEncoder]: Using Remove infeasible edges 36.37/19.55 [2019-03-28 12:44:03,300 INFO L263 BlockEncoder]: Using Maximize final states 36.37/19.55 [2019-03-28 12:44:03,300 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 36.37/19.55 [2019-03-28 12:44:03,301 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 36.37/19.55 [2019-03-28 12:44:03,302 INFO L296 BlockEncoder]: Using Remove sink states 36.37/19.55 [2019-03-28 12:44:03,303 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 36.37/19.55 [2019-03-28 12:44:03,303 INFO L179 BlockEncoder]: Using Rewrite not-equals 36.37/19.55 [2019-03-28 12:44:03,324 INFO L185 BlockEncoder]: Using Use SBE 36.37/19.55 [2019-03-28 12:44:03,353 INFO L200 BlockEncoder]: SBE split 8 edges 36.37/19.55 [2019-03-28 12:44:03,359 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 36.37/19.55 [2019-03-28 12:44:03,361 INFO L71 MaximizeFinalStates]: 0 new accepting states 36.37/19.55 [2019-03-28 12:44:03,394 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding 36.37/19.55 [2019-03-28 12:44:03,397 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 36.37/19.55 [2019-03-28 12:44:03,398 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 36.37/19.55 [2019-03-28 12:44:03,398 INFO L71 MaximizeFinalStates]: 0 new accepting states 36.37/19.55 [2019-03-28 12:44:03,399 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 36.37/19.55 [2019-03-28 12:44:03,399 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 36.37/19.55 [2019-03-28 12:44:03,400 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges 36.37/19.55 [2019-03-28 12:44:03,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:03 BasicIcfg 36.37/19.55 [2019-03-28 12:44:03,400 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 36.37/19.55 [2019-03-28 12:44:03,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 36.37/19.55 [2019-03-28 12:44:03,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... 36.37/19.55 [2019-03-28 12:44:03,405 INFO L276 PluginConnector]: TraceAbstraction initialized 36.37/19.55 [2019-03-28 12:44:03,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:02" (1/4) ... 36.37/19.55 [2019-03-28 12:44:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abc245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:03, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (2/4) ... 36.37/19.55 [2019-03-28 12:44:03,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abc245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:03, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:03" (3/4) ... 36.37/19.55 [2019-03-28 12:44:03,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20abc245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:03, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:03" (4/4) ... 36.37/19.55 [2019-03-28 12:44:03,409 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 36.37/19.55 [2019-03-28 12:44:03,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 36.37/19.55 [2019-03-28 12:44:03,427 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 36.37/19.55 [2019-03-28 12:44:03,446 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 36.37/19.55 [2019-03-28 12:44:03,475 INFO L133 ementStrategyFactory]: Using default assertion order modulation 36.37/19.55 [2019-03-28 12:44:03,475 INFO L382 AbstractCegarLoop]: Interprodecural is true 36.37/19.55 [2019-03-28 12:44:03,476 INFO L383 AbstractCegarLoop]: Hoare is true 36.37/19.55 [2019-03-28 12:44:03,476 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 36.37/19.55 [2019-03-28 12:44:03,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 36.37/19.55 [2019-03-28 12:44:03,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 36.37/19.55 [2019-03-28 12:44:03,476 INFO L387 AbstractCegarLoop]: Difference is false 36.37/19.55 [2019-03-28 12:44:03,476 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 36.37/19.55 [2019-03-28 12:44:03,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 36.37/19.55 [2019-03-28 12:44:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.37/19.55 [2019-03-28 12:44:03,498 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:03,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:03,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 126038835, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:03,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:03,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:03,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:03,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 36.37/19.55 [2019-03-28 12:44:03,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 36.37/19.55 [2019-03-28 12:44:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 36.37/19.55 [2019-03-28 12:44:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.37/19.55 [2019-03-28 12:44:03,696 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. 36.37/19.55 [2019-03-28 12:44:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:03,765 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. 36.37/19.55 [2019-03-28 12:44:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 36.37/19.55 [2019-03-28 12:44:03,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 36.37/19.55 [2019-03-28 12:44:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:03,781 INFO L225 Difference]: With dead ends: 15 36.37/19.55 [2019-03-28 12:44:03,781 INFO L226 Difference]: Without dead ends: 14 36.37/19.55 [2019-03-28 12:44:03,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.37/19.55 [2019-03-28 12:44:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.37/19.55 [2019-03-28 12:44:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:03,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 36.37/19.55 [2019-03-28 12:44:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:03,824 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:03,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 36.37/19.55 [2019-03-28 12:44:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.37/19.55 [2019-03-28 12:44:03,825 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:03,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:03,826 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash 126038837, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:03,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 36.37/19.55 [2019-03-28 12:44:03,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 36.37/19.55 [2019-03-28 12:44:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 36.37/19.55 [2019-03-28 12:44:03,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 36.37/19.55 [2019-03-28 12:44:03,868 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. 36.37/19.55 [2019-03-28 12:44:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:03,932 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:03,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 36.37/19.55 [2019-03-28 12:44:03,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 36.37/19.55 [2019-03-28 12:44:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:03,934 INFO L225 Difference]: With dead ends: 15 36.37/19.55 [2019-03-28 12:44:03,934 INFO L226 Difference]: Without dead ends: 14 36.37/19.55 [2019-03-28 12:44:03,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 36.37/19.55 [2019-03-28 12:44:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.37/19.55 [2019-03-28 12:44:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:03,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 36.37/19.55 [2019-03-28 12:44:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:03,939 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:03,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 36.37/19.55 [2019-03-28 12:44:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 36.37/19.55 [2019-03-28 12:44:03,940 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:03,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:03,940 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:03,941 INFO L82 PathProgramCache]: Analyzing trace with hash 126038838, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:03,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:03,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 36.37/19.55 [2019-03-28 12:44:03,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 36.37/19.55 [2019-03-28 12:44:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 36.37/19.55 [2019-03-28 12:44:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.37/19.55 [2019-03-28 12:44:03,978 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. 36.37/19.55 [2019-03-28 12:44:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,029 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 36.37/19.55 [2019-03-28 12:44:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 36.37/19.55 [2019-03-28 12:44:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,030 INFO L225 Difference]: With dead ends: 14 36.37/19.55 [2019-03-28 12:44:04,030 INFO L226 Difference]: Without dead ends: 13 36.37/19.55 [2019-03-28 12:44:04,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 36.37/19.55 [2019-03-28 12:44:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 36.37/19.55 [2019-03-28 12:44:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 36.37/19.55 [2019-03-28 12:44:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.37/19.55 [2019-03-28 12:44:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 36.37/19.55 [2019-03-28 12:44:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,034 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 36.37/19.55 [2019-03-28 12:44:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.37/19.55 [2019-03-28 12:44:04,035 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash 864253169, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 36.37/19.55 [2019-03-28 12:44:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 36.37/19.55 [2019-03-28 12:44:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 36.37/19.55 [2019-03-28 12:44:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 36.37/19.55 [2019-03-28 12:44:04,088 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. 36.37/19.55 [2019-03-28 12:44:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,178 INFO L93 Difference]: Finished difference Result 22 states and 36 transitions. 36.37/19.55 [2019-03-28 12:44:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.37/19.55 [2019-03-28 12:44:04,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,180 INFO L225 Difference]: With dead ends: 22 36.37/19.55 [2019-03-28 12:44:04,180 INFO L226 Difference]: Without dead ends: 21 36.37/19.55 [2019-03-28 12:44:04,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 36.37/19.55 [2019-03-28 12:44:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 36.37/19.55 [2019-03-28 12:44:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. 36.37/19.55 [2019-03-28 12:44:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. 36.37/19.55 [2019-03-28 12:44:04,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 28 transitions. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,185 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 28 transitions. 36.37/19.55 [2019-03-28 12:44:04,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 36.37/19.55 [2019-03-28 12:44:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 28 transitions. 36.37/19.55 [2019-03-28 12:44:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.37/19.55 [2019-03-28 12:44:04,186 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 864253166, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 36.37/19.55 [2019-03-28 12:44:04,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 36.37/19.55 [2019-03-28 12:44:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 36.37/19.55 [2019-03-28 12:44:04,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 36.37/19.55 [2019-03-28 12:44:04,234 INFO L87 Difference]: Start difference. First operand 15 states and 28 transitions. Second operand 4 states. 36.37/19.55 [2019-03-28 12:44:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,294 INFO L93 Difference]: Finished difference Result 15 states and 28 transitions. 36.37/19.55 [2019-03-28 12:44:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 36.37/19.55 [2019-03-28 12:44:04,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,295 INFO L225 Difference]: With dead ends: 15 36.37/19.55 [2019-03-28 12:44:04,295 INFO L226 Difference]: Without dead ends: 14 36.37/19.55 [2019-03-28 12:44:04,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 36.37/19.55 [2019-03-28 12:44:04,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.37/19.55 [2019-03-28 12:44:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:04,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,299 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:04,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 36.37/19.55 [2019-03-28 12:44:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 36.37/19.55 [2019-03-28 12:44:04,300 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,300 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,301 INFO L82 PathProgramCache]: Analyzing trace with hash 864253168, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 36.37/19.55 [2019-03-28 12:44:04,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 36.37/19.55 [2019-03-28 12:44:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.37/19.55 [2019-03-28 12:44:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 36.37/19.55 [2019-03-28 12:44:04,369 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 6 states. 36.37/19.55 [2019-03-28 12:44:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,480 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. 36.37/19.55 [2019-03-28 12:44:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:04,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,481 INFO L225 Difference]: With dead ends: 19 36.37/19.55 [2019-03-28 12:44:04,481 INFO L226 Difference]: Without dead ends: 18 36.37/19.55 [2019-03-28 12:44:04,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 36.37/19.55 [2019-03-28 12:44:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 36.37/19.55 [2019-03-28 12:44:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. 36.37/19.55 [2019-03-28 12:44:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 7 36.37/19.55 [2019-03-28 12:44:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,490 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 36.37/19.55 [2019-03-28 12:44:04,491 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,491 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043599, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 36.37/19.55 [2019-03-28 12:44:04,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 36.37/19.55 [2019-03-28 12:44:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.37/19.55 [2019-03-28 12:44:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 36.37/19.55 [2019-03-28 12:44:04,613 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. Second operand 6 states. 36.37/19.55 [2019-03-28 12:44:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,723 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:04,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 36.37/19.55 [2019-03-28 12:44:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,725 INFO L225 Difference]: With dead ends: 14 36.37/19.55 [2019-03-28 12:44:04,725 INFO L226 Difference]: Without dead ends: 13 36.37/19.55 [2019-03-28 12:44:04,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 36.37/19.55 [2019-03-28 12:44:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. 36.37/19.55 [2019-03-28 12:44:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 36.37/19.55 [2019-03-28 12:44:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 36.37/19.55 [2019-03-28 12:44:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:04,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 8 36.37/19.55 [2019-03-28 12:44:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,729 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:04,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 36.37/19.55 [2019-03-28 12:44:04,730 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,730 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043601, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 36.37/19.55 [2019-03-28 12:44:04,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 36.37/19.55 [2019-03-28 12:44:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 36.37/19.55 [2019-03-28 12:44:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 36.37/19.55 [2019-03-28 12:44:04,769 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 5 states. 36.37/19.55 [2019-03-28 12:44:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:04,839 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. 36.37/19.55 [2019-03-28 12:44:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 36.37/19.55 [2019-03-28 12:44:04,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 36.37/19.55 [2019-03-28 12:44:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:04,840 INFO L225 Difference]: With dead ends: 17 36.37/19.55 [2019-03-28 12:44:04,840 INFO L226 Difference]: Without dead ends: 16 36.37/19.55 [2019-03-28 12:44:04,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 36.37/19.55 [2019-03-28 12:44:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. 36.37/19.55 [2019-03-28 12:44:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. 36.37/19.55 [2019-03-28 12:44:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 23 transitions. Word has length 8 36.37/19.55 [2019-03-28 12:44:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:04,847 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 36.37/19.55 [2019-03-28 12:44:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 36.37/19.55 [2019-03-28 12:44:04,847 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:04,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:04,848 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1022043602, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:04,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:04,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:04,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 36.37/19.55 [2019-03-28 12:44:04,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 36.37/19.55 [2019-03-28 12:44:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 36.37/19.55 [2019-03-28 12:44:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 36.37/19.55 [2019-03-28 12:44:04,929 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. Second operand 6 states. 36.37/19.55 [2019-03-28 12:44:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:05,042 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:05,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:05,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 36.37/19.55 [2019-03-28 12:44:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:05,043 INFO L225 Difference]: With dead ends: 16 36.37/19.55 [2019-03-28 12:44:05,044 INFO L226 Difference]: Without dead ends: 15 36.37/19.55 [2019-03-28 12:44:05,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 36.37/19.55 [2019-03-28 12:44:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. 36.37/19.55 [2019-03-28 12:44:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:05,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 8 36.37/19.55 [2019-03-28 12:44:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:05,048 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:05,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 36.37/19.55 [2019-03-28 12:44:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 36.37/19.55 [2019-03-28 12:44:05,048 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:05,049 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:05,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:05,049 INFO L82 PathProgramCache]: Analyzing trace with hash 676663114, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:05,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:05,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:05,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:05,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.37/19.55 [2019-03-28 12:44:05,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.37/19.55 [2019-03-28 12:44:05,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:05,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:05,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:05,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:05,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 36.37/19.55 [2019-03-28 12:44:05,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 36.37/19.55 [2019-03-28 12:44:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 36.37/19.55 [2019-03-28 12:44:05,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 36.37/19.55 [2019-03-28 12:44:05,215 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 8 states. 36.37/19.55 [2019-03-28 12:44:05,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:05,334 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:05,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 36.37/19.55 [2019-03-28 12:44:05,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 36.37/19.55 [2019-03-28 12:44:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:05,336 INFO L225 Difference]: With dead ends: 16 36.37/19.55 [2019-03-28 12:44:05,336 INFO L226 Difference]: Without dead ends: 15 36.37/19.55 [2019-03-28 12:44:05,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 36.37/19.55 [2019-03-28 12:44:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. 36.37/19.55 [2019-03-28 12:44:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:05,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 11 36.37/19.55 [2019-03-28 12:44:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:05,340 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:05,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 36.37/19.55 [2019-03-28 12:44:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. 36.37/19.55 [2019-03-28 12:44:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 36.37/19.55 [2019-03-28 12:44:05,340 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:05,341 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:05,341 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash 676663113, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:05,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:05,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:05,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:05,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 36.37/19.55 [2019-03-28 12:44:05,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states 36.37/19.55 [2019-03-28 12:44:05,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 36.37/19.55 [2019-03-28 12:44:05,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 36.37/19.55 [2019-03-28 12:44:05,429 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 7 states. 36.37/19.55 [2019-03-28 12:44:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:05,558 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. 36.37/19.55 [2019-03-28 12:44:05,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 36.37/19.55 [2019-03-28 12:44:05,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 36.37/19.55 [2019-03-28 12:44:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:05,559 INFO L225 Difference]: With dead ends: 26 36.37/19.55 [2019-03-28 12:44:05,559 INFO L226 Difference]: Without dead ends: 14 36.37/19.55 [2019-03-28 12:44:05,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 36.37/19.55 [2019-03-28 12:44:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 36.37/19.55 [2019-03-28 12:44:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 36.37/19.55 [2019-03-28 12:44:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. 36.37/19.55 [2019-03-28 12:44:05,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 11 36.37/19.55 [2019-03-28 12:44:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:05,563 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. 36.37/19.55 [2019-03-28 12:44:05,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. 36.37/19.55 [2019-03-28 12:44:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. 36.37/19.55 [2019-03-28 12:44:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 36.37/19.55 [2019-03-28 12:44:05,563 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:05,564 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:05,564 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:05,564 INFO L82 PathProgramCache]: Analyzing trace with hash 247428961, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:05,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:05,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:05,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:05,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.37/19.55 [2019-03-28 12:44:05,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.37/19.55 [2019-03-28 12:44:05,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:05,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:05,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:05,789 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 36.37/19.55 [2019-03-28 12:44:05,789 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:05,799 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:05,800 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:05,801 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 36.37/19.55 [2019-03-28 12:44:05,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:05,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 36.37/19.55 [2019-03-28 12:44:05,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 36.37/19.55 [2019-03-28 12:44:05,888 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:05,894 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 36.37/19.55 [2019-03-28 12:44:05,894 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 36.37/19.55 [2019-03-28 12:44:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:05,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 36.37/19.55 [2019-03-28 12:44:05,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 36.37/19.55 [2019-03-28 12:44:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 36.37/19.55 [2019-03-28 12:44:05,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 36.37/19.55 [2019-03-28 12:44:05,957 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 12 states. 36.37/19.55 [2019-03-28 12:44:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:06,450 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:06,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 36.37/19.55 [2019-03-28 12:44:06,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 36.37/19.55 [2019-03-28 12:44:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:06,451 INFO L225 Difference]: With dead ends: 18 36.37/19.55 [2019-03-28 12:44:06,451 INFO L226 Difference]: Without dead ends: 17 36.37/19.55 [2019-03-28 12:44:06,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 36.37/19.55 [2019-03-28 12:44:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 36.37/19.55 [2019-03-28 12:44:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 36.37/19.55 [2019-03-28 12:44:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 36.37/19.55 [2019-03-28 12:44:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:06,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 11 36.37/19.55 [2019-03-28 12:44:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:06,456 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:06,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 36.37/19.55 [2019-03-28 12:44:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 36.37/19.55 [2019-03-28 12:44:06,457 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:06,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:06,457 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:06,458 INFO L82 PathProgramCache]: Analyzing trace with hash -919637632, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:06,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:06,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:06,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:06,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.37/19.55 [2019-03-28 12:44:06,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.37/19.55 [2019-03-28 12:44:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:06,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:06,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 36.37/19.55 [2019-03-28 12:44:06,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 36.37/19.55 [2019-03-28 12:44:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 36.37/19.55 [2019-03-28 12:44:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 36.37/19.55 [2019-03-28 12:44:06,594 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 8 states. 36.37/19.55 [2019-03-28 12:44:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:06,694 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. 36.37/19.55 [2019-03-28 12:44:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 36.37/19.55 [2019-03-28 12:44:06,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 36.37/19.55 [2019-03-28 12:44:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:06,695 INFO L225 Difference]: With dead ends: 18 36.37/19.55 [2019-03-28 12:44:06,696 INFO L226 Difference]: Without dead ends: 17 36.37/19.55 [2019-03-28 12:44:06,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 36.37/19.55 [2019-03-28 12:44:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 36.37/19.55 [2019-03-28 12:44:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 36.37/19.55 [2019-03-28 12:44:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 36.37/19.55 [2019-03-28 12:44:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:06,700 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 36.37/19.55 [2019-03-28 12:44:06,700 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:06,700 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:06,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 36.37/19.55 [2019-03-28 12:44:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. 36.37/19.55 [2019-03-28 12:44:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 36.37/19.55 [2019-03-28 12:44:06,701 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:06,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:06,701 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash -919637631, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:06,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:06,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:06,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:06,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.37/19.55 [2019-03-28 12:44:06,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.37/19.55 [2019-03-28 12:44:06,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:06,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 45 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:06,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:06,890 INFO L189 IndexEqualityManager]: detected not equals via solver 36.37/19.55 [2019-03-28 12:44:06,893 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 36.37/19.55 [2019-03-28 12:44:06,894 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:06,916 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:06,924 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 36.37/19.55 [2019-03-28 12:44:06,925 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:06,937 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:06,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:06,938 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 36.37/19.55 [2019-03-28 12:44:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 36.37/19.55 [2019-03-28 12:44:07,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states 36.37/19.55 [2019-03-28 12:44:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. 36.37/19.55 [2019-03-28 12:44:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 36.37/19.55 [2019-03-28 12:44:07,104 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 15 states. 36.37/19.55 [2019-03-28 12:44:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:12,823 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. 36.37/19.55 [2019-03-28 12:44:12,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 36.37/19.55 [2019-03-28 12:44:12,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 36.37/19.55 [2019-03-28 12:44:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:12,824 INFO L225 Difference]: With dead ends: 19 36.37/19.55 [2019-03-28 12:44:12,824 INFO L226 Difference]: Without dead ends: 18 36.37/19.55 [2019-03-28 12:44:12,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 36.37/19.55 [2019-03-28 12:44:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 36.37/19.55 [2019-03-28 12:44:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. 36.37/19.55 [2019-03-28 12:44:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 36.37/19.55 [2019-03-28 12:44:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:12,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 12 36.37/19.55 [2019-03-28 12:44:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:12,829 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:12,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. 36.37/19.55 [2019-03-28 12:44:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. 36.37/19.55 [2019-03-28 12:44:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 36.37/19.55 [2019-03-28 12:44:12,830 INFO L394 BasicCegarLoop]: Found error trace 36.37/19.55 [2019-03-28 12:44:12,830 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:12,830 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION]=== 36.37/19.55 [2019-03-28 12:44:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 670593338, now seen corresponding path program 2 times 36.37/19.55 [2019-03-28 12:44:12,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:12,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 36.37/19.55 [2019-03-28 12:44:13,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 36.37/19.55 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 36.37/19.55 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 36.37/19.55 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 36.37/19.55 [2019-03-28 12:44:13,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 36.37/19.55 [2019-03-28 12:44:13,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 36.37/19.55 [2019-03-28 12:44:13,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:13,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 42 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:13,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:13,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 36.37/19.55 [2019-03-28 12:44:13,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,145 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,148 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 36.37/19.55 [2019-03-28 12:44:13,148 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,155 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,156 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 36.37/19.55 [2019-03-28 12:44:13,180 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 36.37/19.55 [2019-03-28 12:44:13,181 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,188 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,189 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,189 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 36.37/19.55 [2019-03-28 12:44:13,253 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 36.37/19.55 [2019-03-28 12:44:13,254 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,265 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,266 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,266 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 36.37/19.55 [2019-03-28 12:44:13,339 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 36.37/19.55 [2019-03-28 12:44:13,341 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,355 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 36.37/19.55 [2019-03-28 12:44:13,359 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 36.37/19.55 [2019-03-28 12:44:13,359 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 36.37/19.55 [2019-03-28 12:44:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:13,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:13,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 36.37/19.55 [2019-03-28 12:44:13,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 36.37/19.55 [2019-03-28 12:44:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 36.37/19.55 [2019-03-28 12:44:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 36.37/19.55 [2019-03-28 12:44:13,438 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 17 states. 36.37/19.55 [2019-03-28 12:44:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:14,295 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 36.37/19.55 [2019-03-28 12:44:14,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 36.37/19.55 [2019-03-28 12:44:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 36.37/19.55 [2019-03-28 12:44:14,296 INFO L225 Difference]: With dead ends: 18 36.37/19.55 [2019-03-28 12:44:14,296 INFO L226 Difference]: Without dead ends: 0 36.37/19.55 [2019-03-28 12:44:14,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 36.37/19.55 [2019-03-28 12:44:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 36.37/19.55 [2019-03-28 12:44:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 36.37/19.55 [2019-03-28 12:44:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 36.37/19.55 [2019-03-28 12:44:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:14,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 36.37/19.55 [2019-03-28 12:44:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. 36.37/19.55 [2019-03-28 12:44:14,298 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:14,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 36.37/19.55 [2019-03-28 12:44:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:14,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 36.37/19.55 [2019-03-28 12:44:14,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:14,800 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 36.37/19.55 [2019-03-28 12:44:14,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,803 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 16 31) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 16 31) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,804 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,805 INFO L448 ceAbstractionStarter]: For program point L10-3(lines 10 11) no Hoare annotation was computed. 36.37/19.55 [2019-03-28 12:44:14,805 INFO L444 ceAbstractionStarter]: At program point L10-5(lines 10 11) the Hoare annotation is: (let ((.cse5 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse8 (= ULTIMATE.start_cstrcpy_~src~0.offset 0)) (.cse11 (= ULTIMATE.start_cstrcpy_~dst~0.offset 0)) (.cse13 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse0 (= 1 (select |#valid| ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse1 (= (select |#valid| ULTIMATE.start_cstrcpy_~src~0.base) 1)) (.cse2 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse4 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse14 (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) (+ (select |#length| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString~0.offset)))) (.cse6 (select |#length| ULTIMATE.start_cstrcpy_~dst~0.base)) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse7 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse16 (not (= ULTIMATE.start_cstrcpy_~src~0.base ULTIMATE.start_cstrcpy_~dst~0.base))) (.cse3 (select |#length| ULTIMATE.start_cstrcpy_~src~0.base)) (.cse9 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse10 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse17 (<= ULTIMATE.start_main_~length2~0 .cse5)) (.cse12 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base)))) (or (and .cse0 .cse1 .cse2 (<= 1 .cse3) .cse4 (<= 1 .cse5) (<= 1 .cse6) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) ULTIMATE.start_cstrcpy_~src~0.offset)) .cse7 .cse8 .cse9 (= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse14 .cse15 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11 (<= .cse3 .cse6) .cse12 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcpy_~src~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrcpy_~src~0.base)) (<= ULTIMATE.start_cstrcpy_~src~0.offset ULTIMATE.start_main_~nondetString~0.offset) (<= 1 ULTIMATE.start_main_~length2~0)))) (and .cse13 .cse0 .cse1 .cse2 (<= 1 ULTIMATE.start_cstrcpy_~src~0.offset) .cse4 .cse14 (<= (+ .cse3 ULTIMATE.start_cstrcpy_~dst~0.offset) (+ ULTIMATE.start_cstrcpy_~src~0.offset .cse6)) .cse15 .cse7 .cse16 (<= (+ ULTIMATE.start_cstrcpy_~src~0.offset 1) .cse3) (<= 1 ULTIMATE.start_cstrcpy_~dst~0.offset) .cse9 .cse10 .cse17 .cse12)))) 36.37/19.55 [2019-03-28 12:44:14,806 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 36.37/19.55 [2019-03-28 12:44:14,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,826 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,827 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,828 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,837 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,839 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:14,855 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,856 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,857 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,858 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,859 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:14,860 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,862 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:14,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:14 BasicIcfg 36.37/19.55 [2019-03-28 12:44:14,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 36.37/19.55 [2019-03-28 12:44:14,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 36.37/19.55 [2019-03-28 12:44:14,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 36.37/19.55 [2019-03-28 12:44:14,871 INFO L276 PluginConnector]: BuchiAutomizer initialized 36.37/19.55 [2019-03-28 12:44:14,871 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.37/19.55 [2019-03-28 12:44:14,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:02" (1/5) ... 36.37/19.55 [2019-03-28 12:44:14,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@559e247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:14, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:14,872 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.37/19.55 [2019-03-28 12:44:14,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:02" (2/5) ... 36.37/19.55 [2019-03-28 12:44:14,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@559e247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:14, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:14,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.37/19.55 [2019-03-28 12:44:14,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:03" (3/5) ... 36.37/19.55 [2019-03-28 12:44:14,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@559e247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:14, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:14,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.37/19.55 [2019-03-28 12:44:14,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:03" (4/5) ... 36.37/19.55 [2019-03-28 12:44:14,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@559e247c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:14, skipping insertion in model container 36.37/19.55 [2019-03-28 12:44:14,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 36.37/19.55 [2019-03-28 12:44:14,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:14" (5/5) ... 36.37/19.55 [2019-03-28 12:44:14,876 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 36.37/19.55 [2019-03-28 12:44:14,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation 36.37/19.55 [2019-03-28 12:44:14,899 INFO L374 BuchiCegarLoop]: Interprodecural is true 36.37/19.55 [2019-03-28 12:44:14,899 INFO L375 BuchiCegarLoop]: Hoare is true 36.37/19.55 [2019-03-28 12:44:14,899 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 36.37/19.55 [2019-03-28 12:44:14,899 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 36.37/19.55 [2019-03-28 12:44:14,899 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 36.37/19.55 [2019-03-28 12:44:14,899 INFO L379 BuchiCegarLoop]: Difference is false 36.37/19.55 [2019-03-28 12:44:14,899 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 36.37/19.55 [2019-03-28 12:44:14,900 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 36.37/19.55 [2019-03-28 12:44:14,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:14,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.37/19.55 [2019-03-28 12:44:14,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.37/19.55 [2019-03-28 12:44:14,908 INFO L119 BuchiIsEmpty]: Starting construction of run 36.37/19.55 [2019-03-28 12:44:14,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:14,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:14,913 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 36.37/19.55 [2019-03-28 12:44:14,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. 36.37/19.55 [2019-03-28 12:44:14,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.37/19.55 [2019-03-28 12:44:14,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.37/19.55 [2019-03-28 12:44:14,914 INFO L119 BuchiIsEmpty]: Starting construction of run 36.37/19.55 [2019-03-28 12:44:14,915 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:14,915 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:14,921 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 9#L19true [62] L19-->L19-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 4#L19-2true [76] L19-2-->L22-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 14#L22-1true [88] L22-1-->L28: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 5#L28true [105] L28-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_5 v_ULTIMATE.start_cstrcpy_~s2.base_3) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~s2.base_3 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_5 v_ULTIMATE.start_cstrcpy_~s2.offset_3) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 |v_ULTIMATE.start_cstrcpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrcpy_~s1.offset_4 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_5 v_ULTIMATE.start_cstrcpy_~s1.offset_4) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 v_ULTIMATE.start_cstrcpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrcpy_~s2.offset_3 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_5, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_7|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_7|, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_cstrcpy_~s1.offset=v_ULTIMATE.start_cstrcpy_~s1.offset_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_#in~s2.base=|v_ULTIMATE.start_cstrcpy_#in~s2.base_2|, ULTIMATE.start_cstrcpy_~s2.base=v_ULTIMATE.start_cstrcpy_~s2.base_3, ULTIMATE.start_cstrcpy_~s1.base=v_ULTIMATE.start_cstrcpy_~s1.base_4, ULTIMATE.start_cstrcpy_#in~s1.offset=|v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_5, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_~s2.offset=v_ULTIMATE.start_cstrcpy_~s2.offset_3, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_5, ULTIMATE.start_cstrcpy_#in~s1.base=|v_ULTIMATE.start_cstrcpy_#in~s1.base_2|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_8|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_#in~s2.offset=|v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#in~s2.base, ULTIMATE.start_cstrcpy_~s2.base, ULTIMATE.start_cstrcpy_~s1.base, ULTIMATE.start_cstrcpy_#in~s1.offset, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_~s2.offset, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base, ULTIMATE.start_cstrcpy_#in~s1.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, #memory_int, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~s1.offset, ULTIMATE.start_cstrcpy_#in~s2.offset] 3#L10-5true 36.37/19.55 [2019-03-28 12:44:14,921 INFO L796 eck$LassoCheckResult]: Loop: 3#L10-5true [50] L10-5-->L10-1: Formula: (and (= v_ULTIMATE.start_cstrcpy_~dst~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post0.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| v_ULTIMATE.start_cstrcpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| 1)) (= |v_ULTIMATE.start_cstrcpy_#t~post1.base_2| v_ULTIMATE.start_cstrcpy_~src~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post0.base_2| v_ULTIMATE.start_cstrcpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrcpy_~src~0.offset_4)) InVars {ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_4, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_4, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_4, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_2|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_3, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_3, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_3, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_2|, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base] 11#L10-1true [65] L10-1-->L10-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 7#L10-2true [59] L10-2-->L10-3: Formula: (and (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| |v_ULTIMATE.start_cstrcpy_#t~mem2_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 6#L10-3true [101] L10-3-->L10-5: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_6|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_7|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_6|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_#t~post1.offset] 3#L10-5true 36.37/19.55 [2019-03-28 12:44:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 125674725, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:14,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:14,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2477466, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:14,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:14,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:14,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash 348020862, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:14,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:15,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 36.37/19.55 [2019-03-28 12:44:15,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 36.37/19.55 [2019-03-28 12:44:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 36.37/19.55 [2019-03-28 12:44:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 36.37/19.55 [2019-03-28 12:44:15,107 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 8 states. 36.37/19.55 [2019-03-28 12:44:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 36.37/19.55 [2019-03-28 12:44:15,318 INFO L93 Difference]: Finished difference Result 28 states and 48 transitions. 36.37/19.55 [2019-03-28 12:44:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 36.37/19.55 [2019-03-28 12:44:15,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 48 transitions. 36.37/19.55 [2019-03-28 12:44:15,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.37/19.55 [2019-03-28 12:44:15,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 36.37/19.55 [2019-03-28 12:44:15,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 36.37/19.55 [2019-03-28 12:44:15,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 36.37/19.55 [2019-03-28 12:44:15,326 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. 36.37/19.55 [2019-03-28 12:44:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 36.37/19.55 [2019-03-28 12:44:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,328 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,328 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,328 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 36.37/19.55 [2019-03-28 12:44:15,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. 36.37/19.55 [2019-03-28 12:44:15,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 36.37/19.55 [2019-03-28 12:44:15,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 36.37/19.55 [2019-03-28 12:44:15,329 INFO L119 BuchiIsEmpty]: Starting construction of run 36.37/19.55 [2019-03-28 12:44:15,329 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:15,329 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 36.37/19.55 [2019-03-28 12:44:15,330 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY [103] ULTIMATE.startENTRY-->L19: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= (store |v_#valid_16| 0 0) |v_#valid_15|)) InVars {#valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 72#L19 [75] L19-->L19-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 73#L19-2 [76] L19-2-->L22-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 67#L22-1 [88] L22-1-->L28: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc6.base_2| |v_#StackHeapBarrier_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|) 0) (< |v_ULTIMATE.start_main_#t~malloc5.base_2| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (> |v_ULTIMATE.start_main_#t~malloc5.base_2| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 68#L28 [105] L28-->L10-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_5 v_ULTIMATE.start_cstrcpy_~s2.base_3) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~s2.base_3 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_5 v_ULTIMATE.start_cstrcpy_~s2.offset_3) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrcpy_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrcpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 |v_ULTIMATE.start_cstrcpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrcpy_~s1.offset_4 |v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_5 v_ULTIMATE.start_cstrcpy_~s1.offset_4) (= v_ULTIMATE.start_cstrcpy_~s1.base_4 v_ULTIMATE.start_cstrcpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrcpy_~s2.offset_3 |v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|) (= |v_#memory_int_6| (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_5, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_7|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_7|, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_5, #length=|v_#length_10|, ULTIMATE.start_cstrcpy_~s1.offset=v_ULTIMATE.start_cstrcpy_~s1.offset_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstrcpy_#in~s2.base=|v_ULTIMATE.start_cstrcpy_#in~s2.base_2|, ULTIMATE.start_cstrcpy_~s2.base=v_ULTIMATE.start_cstrcpy_~s2.base_3, ULTIMATE.start_cstrcpy_~s1.base=v_ULTIMATE.start_cstrcpy_~s1.base_4, ULTIMATE.start_cstrcpy_#in~s1.offset=|v_ULTIMATE.start_cstrcpy_#in~s1.offset_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_5, ULTIMATE.start_cstrcpy_#res.base=|v_ULTIMATE.start_cstrcpy_#res.base_4|, ULTIMATE.start_cstrcpy_~s2.offset=v_ULTIMATE.start_cstrcpy_~s2.offset_3, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_5, ULTIMATE.start_cstrcpy_#in~s1.base=|v_ULTIMATE.start_cstrcpy_#in~s1.base_2|, ULTIMATE.start_cstrcpy_#res.offset=|v_ULTIMATE.start_cstrcpy_#res.offset_4|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_8|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcpy_#in~s2.offset=|v_ULTIMATE.start_cstrcpy_#in~s2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#in~s2.base, ULTIMATE.start_cstrcpy_~s2.base, ULTIMATE.start_cstrcpy_~s1.base, ULTIMATE.start_cstrcpy_#in~s1.offset, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_#res.base, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_~s2.offset, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base, ULTIMATE.start_cstrcpy_#in~s1.base, ULTIMATE.start_cstrcpy_#res.offset, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, #memory_int, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~s1.offset, ULTIMATE.start_cstrcpy_#in~s2.offset] 69#L10-5 36.37/19.55 [2019-03-28 12:44:15,330 INFO L796 eck$LassoCheckResult]: Loop: 69#L10-5 [50] L10-5-->L10-1: Formula: (and (= v_ULTIMATE.start_cstrcpy_~dst~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post0.base_2|) (= v_ULTIMATE.start_cstrcpy_~src~0.base_3 |v_ULTIMATE.start_cstrcpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| v_ULTIMATE.start_cstrcpy_~dst~0.offset_4) (= v_ULTIMATE.start_cstrcpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrcpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_2| 1)) (= |v_ULTIMATE.start_cstrcpy_#t~post1.base_2| v_ULTIMATE.start_cstrcpy_~src~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post0.base_2| v_ULTIMATE.start_cstrcpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrcpy_#t~post1.offset_2| v_ULTIMATE.start_cstrcpy_~src~0.offset_4)) InVars {ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_4, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_4, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_4, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_2|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_2|, ULTIMATE.start_cstrcpy_~src~0.offset=v_ULTIMATE.start_cstrcpy_~src~0.offset_3, ULTIMATE.start_cstrcpy_~dst~0.offset=v_ULTIMATE.start_cstrcpy_~dst~0.offset_3, ULTIMATE.start_cstrcpy_~src~0.base=v_ULTIMATE.start_cstrcpy_~src~0.base_3, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_2|, ULTIMATE.start_cstrcpy_~dst~0.base=v_ULTIMATE.start_cstrcpy_~dst~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_~src~0.offset, ULTIMATE.start_cstrcpy_~dst~0.offset, ULTIMATE.start_cstrcpy_~src~0.base, ULTIMATE.start_cstrcpy_#t~post1.offset, ULTIMATE.start_cstrcpy_~dst~0.base] 70#L10-1 [65] L10-1-->L10-2: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) 1) (= |v_ULTIMATE.start_cstrcpy_#t~mem2_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post1.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrcpy_#t~post1.base_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_2|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2] 75#L10-2 [59] L10-2-->L10-3: Formula: (and (= 1 (select |v_#valid_10| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|)) (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrcpy_#t~post0.base_3|) |v_ULTIMATE.start_cstrcpy_#t~post0.offset_3| |v_ULTIMATE.start_cstrcpy_#t~mem2_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_3|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_3|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 74#L10-3 [101] L10-3-->L10-5: Formula: (< |v_ULTIMATE.start_cstrcpy_#t~mem2_7| 0) InVars {ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstrcpy_#t~mem2=|v_ULTIMATE.start_cstrcpy_#t~mem2_6|, ULTIMATE.start_cstrcpy_#t~post0.offset=|v_ULTIMATE.start_cstrcpy_#t~post0.offset_6|, ULTIMATE.start_cstrcpy_#t~post0.base=|v_ULTIMATE.start_cstrcpy_#t~post0.base_7|, ULTIMATE.start_cstrcpy_#t~post1.offset=|v_ULTIMATE.start_cstrcpy_#t~post1.offset_6|, ULTIMATE.start_cstrcpy_#t~post1.base=|v_ULTIMATE.start_cstrcpy_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcpy_#t~mem2, ULTIMATE.start_cstrcpy_#t~post0.offset, ULTIMATE.start_cstrcpy_#t~post0.base, ULTIMATE.start_cstrcpy_#t~post1.base, ULTIMATE.start_cstrcpy_#t~post1.offset] 69#L10-5 36.37/19.55 [2019-03-28 12:44:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash 126062008, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:15,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:15,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2477466, now seen corresponding path program 2 times 36.37/19.55 [2019-03-28 12:44:15,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1529718737, now seen corresponding path program 1 times 36.37/19.55 [2019-03-28 12:44:15,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 36.37/19.55 [2019-03-28 12:44:15,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 36.37/19.55 [2019-03-28 12:44:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 36.37/19.55 [2019-03-28 12:44:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:15,684 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 36.37/19.55 [2019-03-28 12:44:15,791 INFO L216 LassoAnalysis]: Preferences: 36.37/19.55 [2019-03-28 12:44:15,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 36.37/19.55 [2019-03-28 12:44:15,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 36.37/19.55 [2019-03-28 12:44:15,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 36.37/19.55 [2019-03-28 12:44:15,792 INFO L127 ssoRankerPreferences]: Use exernal solver: false 36.37/19.55 [2019-03-28 12:44:15,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 36.37/19.55 [2019-03-28 12:44:15,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 36.37/19.55 [2019-03-28 12:44:15,793 INFO L130 ssoRankerPreferences]: Path of dumped script: 36.37/19.55 [2019-03-28 12:44:15,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 36.37/19.55 [2019-03-28 12:44:15,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 36.37/19.55 [2019-03-28 12:44:15,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 36.37/19.55 [2019-03-28 12:44:15,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:15,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:16,068 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 36.37/19.55 [2019-03-28 12:44:16,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:16,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:16,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:16,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 36.37/19.55 [2019-03-28 12:44:16,575 INFO L300 LassoAnalysis]: Preprocessing complete. 36.37/19.55 [2019-03-28 12:44:16,581 INFO L497 LassoAnalysis]: Using template 'affine'. 36.37/19.55 [2019-03-28 12:44:16,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 36.37/19.55 [2019-03-28 12:44:16,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 36.37/19.55 [2019-03-28 12:44:16,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 36.37/19.55 Termination analysis: LINEAR_WITH_GUESSES 36.37/19.55 Number of strict supporting invariants: 0 36.37/19.55 Number of non-strict supporting invariants: 1 36.37/19.55 Consider only non-deceasing supporting invariants: true 36.37/19.55 Simplify termination arguments: true 36.37/19.55 Simplify supporting invariants: trueOverapproximate stem: false 36.37/19.55 [2019-03-28 12:44:16,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. 36.37/19.55 [2019-03-28 12:44:16,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 36.37/19.55 [2019-03-28 12:44:16,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 36.37/19.55 [2019-03-28 12:44:16,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 36.37/19.55 [2019-03-28 12:44:16,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 36.37/19.55 [2019-03-28 12:44:16,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 36.37/19.55 [2019-03-28 12:44:16,739 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 36.37/19.55 [2019-03-28 12:44:16,780 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. 36.37/19.55 [2019-03-28 12:44:16,780 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. 36.37/19.55 [2019-03-28 12:44:16,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 36.37/19.55 [2019-03-28 12:44:16,784 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 36.37/19.55 [2019-03-28 12:44:16,785 INFO L518 LassoAnalysis]: Proved termination. 36.37/19.55 [2019-03-28 12:44:16,785 INFO L520 LassoAnalysis]: Termination argument consisting of: 36.37/19.55 Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1, ULTIMATE.start_cstrcpy_~src~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc5.base)_1 - 1*ULTIMATE.start_cstrcpy_~src~0.offset 36.37/19.55 Supporting invariants [] 36.37/19.55 [2019-03-28 12:44:16,834 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed 36.37/19.55 [2019-03-28 12:44:16,841 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 36.37/19.55 [2019-03-28 12:44:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:16,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 30 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:16,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:16,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 19 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:16,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 36.37/19.55 [2019-03-28 12:44:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 36.37/19.55 [2019-03-28 12:44:17,192 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 36.37/19.55 [2019-03-28 12:44:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 36.37/19.55 [2019-03-28 12:44:17,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 19 conjunts are in the unsatisfiable core 36.37/19.55 [2019-03-28 12:44:17,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... 36.37/19.55 [2019-03-28 12:44:17,204 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization 36.37/19.55 [2019-03-28 12:44:17,208 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 10 loop predicates 36.37/19.55 [2019-03-28 12:44:17,209 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 5 states. 36.37/19.55 [2019-03-28 12:44:17,626 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 19 states and 27 transitions. Complement of second has 13 states. 36.37/19.55 [2019-03-28 12:44:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 4 non-accepting loop states 3 accepting loop states 36.37/19.55 [2019-03-28 12:44:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 36.37/19.55 [2019-03-28 12:44:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. 36.37/19.55 [2019-03-28 12:44:17,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. 36.37/19.55 [2019-03-28 12:44:17,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.37/19.55 [2019-03-28 12:44:17,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. 36.37/19.55 [2019-03-28 12:44:17,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.37/19.55 [2019-03-28 12:44:17,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 5 letters. Loop has 8 letters. 36.37/19.55 [2019-03-28 12:44:17,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. 36.37/19.55 [2019-03-28 12:44:17,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. 36.37/19.55 [2019-03-28 12:44:17,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 36.37/19.55 [2019-03-28 12:44:17,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 36.37/19.55 [2019-03-28 12:44:17,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 36.37/19.55 [2019-03-28 12:44:17,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 36.37/19.55 [2019-03-28 12:44:17,637 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,637 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,637 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,637 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 36.37/19.55 [2019-03-28 12:44:17,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 36.37/19.55 [2019-03-28 12:44:17,637 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 36.37/19.55 [2019-03-28 12:44:17,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 36.37/19.55 [2019-03-28 12:44:17,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:17 BasicIcfg 36.37/19.55 [2019-03-28 12:44:17,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 36.37/19.55 [2019-03-28 12:44:17,644 INFO L168 Benchmark]: Toolchain (without parser) took 15035.39 ms. Allocated memory was 649.6 MB in the beginning and 843.1 MB in the end (delta: 193.5 MB). Free memory was 559.5 MB in the beginning and 681.5 MB in the end (delta: -122.0 MB). Peak memory consumption was 71.5 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,644 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.30 ms. Allocated memory was 649.6 MB in the beginning and 669.0 MB in the end (delta: 19.4 MB). Free memory was 559.5 MB in the beginning and 636.2 MB in the end (delta: -76.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 669.0 MB. Free memory was 636.2 MB in the beginning and 633.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,646 INFO L168 Benchmark]: Boogie Preprocessor took 26.08 ms. Allocated memory is still 669.0 MB. Free memory was 633.1 MB in the beginning and 630.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,646 INFO L168 Benchmark]: RCFGBuilder took 292.97 ms. Allocated memory is still 669.0 MB. Free memory was 630.4 MB in the beginning and 609.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,647 INFO L168 Benchmark]: BlockEncodingV2 took 122.51 ms. Allocated memory is still 669.0 MB. Free memory was 609.5 MB in the beginning and 601.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,647 INFO L168 Benchmark]: TraceAbstraction took 11464.54 ms. Allocated memory was 669.0 MB in the beginning and 839.4 MB in the end (delta: 170.4 MB). Free memory was 601.5 MB in the beginning and 802.3 MB in the end (delta: -200.8 MB). Peak memory consumption was 323.3 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,648 INFO L168 Benchmark]: BuchiAutomizer took 2776.72 ms. Allocated memory was 839.4 MB in the beginning and 843.1 MB in the end (delta: 3.7 MB). Free memory was 802.3 MB in the beginning and 681.5 MB in the end (delta: 120.8 MB). Peak memory consumption was 124.5 MB. Max. memory is 50.3 GB. 36.37/19.55 [2019-03-28 12:44:17,652 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 36.37/19.55 --- Results --- 36.37/19.55 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 36.37/19.55 - StatisticsResult: Initial Icfg 36.37/19.55 22 locations, 26 edges 36.37/19.55 - StatisticsResult: Encoded RCFG 36.37/19.55 15 locations, 27 edges 36.37/19.55 * Results from de.uni_freiburg.informatik.ultimate.core: 36.37/19.55 - StatisticsResult: Toolchain Benchmarks 36.37/19.55 Benchmark results are: 36.37/19.55 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 36.37/19.55 * CACSL2BoogieTranslator took 306.30 ms. Allocated memory was 649.6 MB in the beginning and 669.0 MB in the end (delta: 19.4 MB). Free memory was 559.5 MB in the beginning and 636.2 MB in the end (delta: -76.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 50.3 GB. 36.37/19.55 * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 669.0 MB. Free memory was 636.2 MB in the beginning and 633.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 36.37/19.55 * Boogie Preprocessor took 26.08 ms. Allocated memory is still 669.0 MB. Free memory was 633.1 MB in the beginning and 630.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 36.37/19.55 * RCFGBuilder took 292.97 ms. Allocated memory is still 669.0 MB. Free memory was 630.4 MB in the beginning and 609.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 50.3 GB. 36.37/19.55 * BlockEncodingV2 took 122.51 ms. Allocated memory is still 669.0 MB. Free memory was 609.5 MB in the beginning and 601.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 36.37/19.55 * TraceAbstraction took 11464.54 ms. Allocated memory was 669.0 MB in the beginning and 839.4 MB in the end (delta: 170.4 MB). Free memory was 601.5 MB in the beginning and 802.3 MB in the end (delta: -200.8 MB). Peak memory consumption was 323.3 MB. Max. memory is 50.3 GB. 36.37/19.55 * BuchiAutomizer took 2776.72 ms. Allocated memory was 839.4 MB in the beginning and 843.1 MB in the end (delta: 3.7 MB). Free memory was 802.3 MB in the beginning and 681.5 MB in the end (delta: 120.8 MB). Peak memory consumption was 124.5 MB. Max. memory is 50.3 GB. 36.37/19.55 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #memory_int 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 - GenericResult: Unfinished Backtranslation 36.37/19.55 unknown boogie variable #length 36.37/19.55 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 36.37/19.55 - PositiveResult [Line: 28]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - PositiveResult [Line: 28]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - PositiveResult [Line: 10]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - PositiveResult [Line: 10]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - PositiveResult [Line: 10]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - PositiveResult [Line: 10]: pointer dereference always succeeds 36.37/19.55 For all program executions holds that pointer dereference always succeeds at this location 36.37/19.55 - AllSpecificationsHoldResult: All specifications hold 36.37/19.55 6 specifications checked. All of them hold 36.37/19.55 - InvariantResult [Line: 10]: Loop Invariant 36.37/19.55 [2019-03-28 12:44:17,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,669 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] 36.37/19.55 [2019-03-28 12:44:17,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 36.37/19.55 [2019-03-28 12:44:17,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 [2019-03-28 12:44:17,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 36.37/19.55 Derived loop invariant: (((((((((((((((1 == \valid[dst] && \valid[src] == 1) && nondetArea == 0) && 1 <= unknown-#length-unknown[src]) && \valid[nondetArea] == 1) && 1 <= unknown-#length-unknown[nondetArea]) && 1 <= unknown-#length-unknown[dst]) && 0 == unknown-#memory_int-unknown[src][src]) && nondetString == 0) && src == 0) && 1 <= length1) && length2 + nondetString == 1) && \valid[nondetString] == 1) && dst == 0) && length2 == unknown-#length-unknown[nondetString]) || ((((((((((((((((!(nondetString == nondetArea) && 1 == \valid[dst]) && \valid[src] == 1) && nondetArea == 0) && \valid[nondetArea] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && 1 <= length2) && nondetString == 0) && src == 0) && !(src == dst)) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && dst == 0) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && length2 == unknown-#length-unknown[nondetString]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString~0.offset : int :: ((0 == unknown-#memory_int-unknown[src][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString~0.offset <= unknown-#length-unknown[src]) && src <= ULTIMATE.start_main_~nondetString~0.offset) && 1 <= ULTIMATE.start_main_~length2~0))) || ((((((((((((((((!(nondetString == nondetArea) && 1 == \valid[dst]) && \valid[src] == 1) && nondetArea == 0) && 1 <= src) && \valid[nondetArea] == 1) && (\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (ULTIMATE.start_main_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString~0.offset)) && unknown-#length-unknown[src] + dst <= src + unknown-#length-unknown[dst]) && 1 <= length2) && nondetString == 0) && !(src == dst)) && src + 1 <= unknown-#length-unknown[src]) && 1 <= dst) && 1 <= length1) && \valid[nondetString] == 1) && length2 <= unknown-#length-unknown[nondetArea]) && length2 == unknown-#length-unknown[nondetString]) 36.37/19.55 - StatisticsResult: Ultimate Automizer benchmark data 36.37/19.55 CFG has 1 procedures, 15 locations, 6 error locations. SAFE Result, 11.3s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 409 SDslu, 418 SDs, 0 SdLazy, 1003 SolverSat, 177 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 273 HoareAnnotationTreeSize, 1 FomulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 214 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 173 ConstructedInterpolants, 9 QuantifiedInterpolants, 14298 SizeOfPredicates, 52 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 4/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 36.37/19.55 - StatisticsResult: Constructed decomposition of program 36.37/19.55 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length1 * sizeof(char))] + -1 * src and consists of 9 locations. 1 modules have a trivial ranking function, the largest among these consists of 8 locations. 36.37/19.55 - StatisticsResult: Timing statistics 36.37/19.55 BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 132 SDslu, 128 SDs, 0 SdLazy, 253 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax100 hnf100 lsp96 ukn91 mio100 lsp42 div100 bol100 ite100 ukn100 eq194 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 36.37/19.55 - TerminationAnalysisResult: Termination proven 36.37/19.55 Buchi Automizer proved that your program is terminating 36.37/19.55 RESULT: Ultimate proved your program to be correct! 36.37/19.55 !SESSION 2019-03-28 12:43:59.329 ----------------------------------------------- 36.37/19.55 eclipse.buildId=unknown 36.37/19.55 java.version=1.8.0_181 36.37/19.55 java.vendor=Oracle Corporation 36.37/19.55 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 36.37/19.55 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 36.37/19.55 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 36.37/19.55 36.37/19.55 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:44:17.907 36.37/19.55 !MESSAGE The workspace will exit with unsaved changes in this session. 36.37/19.55 Received shutdown request... 36.37/19.55 Ultimate: 36.37/19.55 GTK+ Version Check 36.37/19.55 EOF