NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:44:41,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:44:41,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:44:41,085 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:44:41,085 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:44:41,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:44:41,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:44:41,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:44:41,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:44:41,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:44:41,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:44:41,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:44:41,094 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:44:41,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:44:41,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:44:41,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:44:41,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:44:41,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:44:41,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:44:41,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:44:41,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:44:41,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:44:41,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:44:41,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:44:41,107 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:44:41,107 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:44:41,108 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:44:41,109 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:44:41,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:44:41,110 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:44:41,110 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:44:41,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:44:41,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:44:41,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:44:41,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:44:41,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:44:41,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:44:41,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:44:41,115 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:44:41,115 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:44:41,129 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:44:41,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:44:41,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:44:41,131 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:44:41,131 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:44:41,131 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:44:41,131 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:44:41,131 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:44:41,132 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:44:41,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:44:41,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:44:41,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:44:41,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:44:41,133 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:44:41,134 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:44:41,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:44:41,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:44:41,134 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:44:41,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:44:41,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:44:41,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:44:41,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:44:41,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:44:41,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:44:41,173 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:44:41,177 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:44:41,178 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:44:41,179 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:44:41,179 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:44:41,244 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8a41edb4231a4c2ca867048dc4ccf1a9/FLAGb3b36ab5b [2020-06-22 10:44:41,593 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:44:41,594 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:44:41,594 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:44:41,600 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8a41edb4231a4c2ca867048dc4ccf1a9/FLAGb3b36ab5b [2020-06-22 10:44:42,000 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8a41edb4231a4c2ca867048dc4ccf1a9 [2020-06-22 10:44:42,013 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:44:42,015 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:44:42,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:44:42,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:44:42,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:44:42,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382e7333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42, skipping insertion in model container [2020-06-22 10:44:42,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:44:42,049 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:44:42,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:44:42,220 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:44:42,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:44:42,308 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:44:42,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42 WrapperNode [2020-06-22 10:44:42,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:44:42,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:44:42,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:44:42,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:44:42,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:44:42,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:44:42,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:44:42,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:44:42,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:44:42,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:44:42,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:44:42,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:44:42,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:44:42,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:44:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:44:42,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:44:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:44:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:44:42,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:44:42,675 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:44:42,676 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:44:42,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:44:42 BoogieIcfgContainer [2020-06-22 10:44:42,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:44:42,678 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:44:42,678 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:44:42,680 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:44:42,681 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:44:42" (1/1) ... [2020-06-22 10:44:42,698 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 49 edges [2020-06-22 10:44:42,700 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:44:42,700 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:44:42,701 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:44:42,701 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:44:42,703 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:44:42,704 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:44:42,704 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:44:42,729 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:44:42,763 INFO L200 BlockEncoder]: SBE split 24 edges [2020-06-22 10:44:42,768 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:44:42,770 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:44:42,786 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 10:44:42,788 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:44:42,790 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:44:42,790 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:44:42,790 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:44:42,791 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:44:42,792 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 67 edges [2020-06-22 10:44:42,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:44:42 BasicIcfg [2020-06-22 10:44:42,792 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:44:42,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:44:42,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:44:42,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:44:42,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:44:42" (1/4) ... [2020-06-22 10:44:42,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71153e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:44:42, skipping insertion in model container [2020-06-22 10:44:42,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (2/4) ... [2020-06-22 10:44:42,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71153e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:44:42, skipping insertion in model container [2020-06-22 10:44:42,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:44:42" (3/4) ... [2020-06-22 10:44:42,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71153e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:44:42, skipping insertion in model container [2020-06-22 10:44:42,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:44:42" (4/4) ... [2020-06-22 10:44:42,801 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:44:42,812 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:44:42,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-06-22 10:44:42,839 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-06-22 10:44:42,867 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:44:42,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:44:42,868 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:44:42,868 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:44:42,869 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:44:42,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:44:42,869 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:44:42,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:44:42,869 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:44:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-06-22 10:44:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:44:42,891 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:44:42,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:44:42,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:44:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash 135498, now seen corresponding path program 1 times [2020-06-22 10:44:42,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:42,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:43,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:44:43,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:44:43,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:44:43,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:44:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:44:43,081 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-06-22 10:44:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:44:43,224 INFO L93 Difference]: Finished difference Result 39 states and 67 transitions. [2020-06-22 10:44:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:44:43,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:44:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:44:43,240 INFO L225 Difference]: With dead ends: 39 [2020-06-22 10:44:43,240 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:44:43,243 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 [2020-06-22 10:44:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:44:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:44:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:44:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2020-06-22 10:44:43,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 3 [2020-06-22 10:44:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:44:43,285 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2020-06-22 10:44:43,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:44:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2020-06-22 10:44:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:44:43,287 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:44:43,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:44:43,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 10:44:43,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,288 INFO L82 PathProgramCache]: Analyzing trace with hash 135500, now seen corresponding path program 1 times [2020-06-22 10:44:43,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:43,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:43,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:44:43,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:44:43,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:44:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:44:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:44:43,327 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand 3 states. [2020-06-22 10:44:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:44:43,394 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2020-06-22 10:44:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:44:43,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:44:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:44:43,395 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:44:43,395 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:44:43,396 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 [2020-06-22 10:44:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:44:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:44:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:44:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:44:43,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-06-22 10:44:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:44:43,397 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:44:43,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:44:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:44:43,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:44:43,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:44:43,419 INFO L448 ceAbstractionStarter]: For program point L6-6(lines 6 18) no Hoare annotation was computed. [2020-06-22 10:44:43,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 5) no Hoare annotation was computed. [2020-06-22 10:44:43,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 5) no Hoare annotation was computed. [2020-06-22 10:44:43,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 10:44:43,420 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 5 19) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base))) [2020-06-22 10:44:43,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-06-22 10:44:43,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:44:43,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:44:43,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:44:43,422 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 10:44:43,422 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,423 INFO L448 ceAbstractionStarter]: For program point L7-1(lines 7 15) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point L5-1(lines 5 19) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 10:44:43,424 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 14) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L6-3(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L448 ceAbstractionStarter]: For program point L6-4(line 6) no Hoare annotation was computed. [2020-06-22 10:44:43,425 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:44:43,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:44:43,439 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:44:43,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:44:43 BasicIcfg [2020-06-22 10:44:43,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:44:43,442 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:44:43,442 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:44:43,446 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:44:43,446 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:44:43,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:44:42" (1/5) ... [2020-06-22 10:44:43,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@312c9fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:44:43, skipping insertion in model container [2020-06-22 10:44:43,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:44:43,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:44:42" (2/5) ... [2020-06-22 10:44:43,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@312c9fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:44:43, skipping insertion in model container [2020-06-22 10:44:43,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:44:43,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:44:42" (3/5) ... [2020-06-22 10:44:43,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@312c9fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:44:43, skipping insertion in model container [2020-06-22 10:44:43,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:44:43,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:44:42" (4/5) ... [2020-06-22 10:44:43,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@312c9fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:44:43, skipping insertion in model container [2020-06-22 10:44:43,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:44:43,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:44:43" (5/5) ... [2020-06-22 10:44:43,451 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:44:43,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:44:43,471 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:44:43,471 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:44:43,471 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:44:43,471 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:44:43,472 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:44:43,472 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:44:43,472 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:44:43,472 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:44:43,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 10:44:43,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:44:43,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:43,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:43,487 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:44:43,488 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:43,488 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:44:43,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-06-22 10:44:43,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:44:43,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:43,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:43,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:44:43,492 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:43,497 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 19#L17-1true [2020-06-22 10:44:43,498 INFO L796 eck$LassoCheckResult]: Loop: 19#L17-1true [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 16#L5-1true [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 20#L6true [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 17#L6-1true [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 40#L6-2true [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 30#L6-6true [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 22#L17true [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 19#L17-1true [2020-06-22 10:44:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,498 INFO L82 PathProgramCache]: Analyzing trace with hash 4367, now seen corresponding path program 1 times [2020-06-22 10:44:43,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1164205675, now seen corresponding path program 1 times [2020-06-22 10:44:43,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:43,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:44:43,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:44:43,547 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:44:43,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:44:43,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:44:43,548 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-06-22 10:44:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:44:43,659 INFO L93 Difference]: Finished difference Result 41 states and 69 transitions. [2020-06-22 10:44:43,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:44:43,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 69 transitions. [2020-06-22 10:44:43,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:44:43,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 21 states and 29 transitions. [2020-06-22 10:44:43,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:44:43,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:44:43,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2020-06-22 10:44:43,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:44:43,668 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:44:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2020-06-22 10:44:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:44:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:44:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-06-22 10:44:43,671 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:44:43,671 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:44:43,671 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:44:43,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-06-22 10:44:43,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-22 10:44:43,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:43,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:43,673 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:44:43,673 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:43,674 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 103#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 92#L17-1 [2020-06-22 10:44:43,674 INFO L796 eck$LassoCheckResult]: Loop: 92#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 93#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 97#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 89#L6-1 [163] L6-1-->L6-2: Formula: (and (> 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 91#L6-2 [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 108#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 98#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 92#L17-1 [2020-06-22 10:44:43,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash 4367, now seen corresponding path program 2 times [2020-06-22 10:44:43,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1164235466, now seen corresponding path program 1 times [2020-06-22 10:44:43,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:44:43,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash -407890436, now seen corresponding path program 1 times [2020-06-22 10:44:43,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:43,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:43,866 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:44:43,867 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:44:43,867 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:44:43,867 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:44:43,867 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:44:43,868 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:44:43,868 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:44:43,868 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:44:43,868 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 10:44:43,868 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:44:43,868 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:44:43,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:43,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:44,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:44,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:44,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:44:44,224 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:44:44,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:44,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:44,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:44,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:44,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:44,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:44,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:44,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:44,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:44,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:44,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:44,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:44,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:44,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:44,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:44:44,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:44:44,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:44,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:44,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:44,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:44,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:44,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:44,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:44,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:44,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:44,291 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:44:44,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:44:44,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:44:44,299 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:44:44,299 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:44:44,299 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:44:44,300 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2020-06-22 10:44:44,313 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:44:44,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:44:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:44,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:44:44,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:44,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:44:44,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:44,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:44:44,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:44,464 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 13 [2020-06-22 10:44:44,465 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:44:44,472 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:44:44,472 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:44:44,472 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2020-06-22 10:44:44,511 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 10:44:44,515 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 10:44:44,516 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 10:44:44,953 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 178 states and 225 transitions. Complement of second has 26 states. [2020-06-22 10:44:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states [2020-06-22 10:44:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:44:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2020-06-22 10:44:44,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 7 letters. [2020-06-22 10:44:44,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:44,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 9 letters. Loop has 7 letters. [2020-06-22 10:44:44,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:44,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:44:44,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:44,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 225 transitions. [2020-06-22 10:44:44,973 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:44:44,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 118 states and 151 transitions. [2020-06-22 10:44:44,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-06-22 10:44:44,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2020-06-22 10:44:44,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 151 transitions. [2020-06-22 10:44:44,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:44:44,977 INFO L706 BuchiCegarLoop]: Abstraction has 118 states and 151 transitions. [2020-06-22 10:44:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 151 transitions. [2020-06-22 10:44:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. [2020-06-22 10:44:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 10:44:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2020-06-22 10:44:44,985 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. [2020-06-22 10:44:44,985 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. [2020-06-22 10:44:44,985 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:44:44,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 110 transitions. [2020-06-22 10:44:44,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:44:44,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:44,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:44,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 10:44:44,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:44,989 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 442#L-1 [150] L-1-->L17-1: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 417#L17-1 [2020-06-22 10:44:44,989 INFO L796 eck$LassoCheckResult]: Loop: 417#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 418#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 492#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 490#L6-1 [163] L6-1-->L6-2: Formula: (and (> 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 488#L6-2 [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 486#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 485#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 417#L17-1 [2020-06-22 10:44:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 4366, now seen corresponding path program 1 times [2020-06-22 10:44:44,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:44,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:44,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:44,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1164235466, now seen corresponding path program 2 times [2020-06-22 10:44:45,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2144266525, now seen corresponding path program 1 times [2020-06-22 10:44:45,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:44:45,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,131 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:44:45,131 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:44:45,131 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:44:45,131 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:44:45,132 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:44:45,132 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:44:45,132 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:44:45,132 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:44:45,132 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:44:45,132 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:44:45,132 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:44:45,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:44:45,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:44:45,334 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:44:45,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:44:45,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:44:45,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:44:45,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:44:45,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:44:45,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:44:45,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:44:45,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:44:45,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:44:45,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:44:45,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:44:45,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:44:45,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:44:45,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:44:45,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:44:45,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:44:45,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:44:45,404 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:44:45,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:44:45,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:44:45,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:44:45,407 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 10:44:45,407 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:44:45,408 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2020-06-22 10:44:45,415 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:44:45,416 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:44:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:45,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:44:45,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:45,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:44:45,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:45,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 10:44:45,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:44:45,522 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 13 [2020-06-22 10:44:45,522 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:44:45,524 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:44:45,525 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:44:45,525 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2020-06-22 10:44:45,562 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 10:44:45,563 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 10:44:45,563 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 83 states and 110 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-06-22 10:44:45,929 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 83 states and 110 transitions. cyclomatic complexity: 31. Second operand 5 states. Result 240 states and 306 transitions. Complement of second has 26 states. [2020-06-22 10:44:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states [2020-06-22 10:44:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:44:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2020-06-22 10:44:45,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 7 letters. [2020-06-22 10:44:45,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:45,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 9 letters. Loop has 7 letters. [2020-06-22 10:44:45,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:45,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 14 letters. [2020-06-22 10:44:45,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:44:45,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 306 transitions. [2020-06-22 10:44:45,943 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2020-06-22 10:44:45,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 180 states and 232 transitions. [2020-06-22 10:44:45,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2020-06-22 10:44:45,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2020-06-22 10:44:45,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 232 transitions. [2020-06-22 10:44:45,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:44:45,947 INFO L706 BuchiCegarLoop]: Abstraction has 180 states and 232 transitions. [2020-06-22 10:44:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 232 transitions. [2020-06-22 10:44:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 83. [2020-06-22 10:44:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-06-22 10:44:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2020-06-22 10:44:45,954 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. [2020-06-22 10:44:45,954 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. [2020-06-22 10:44:45,954 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:44:45,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 110 transitions. [2020-06-22 10:44:45,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2020-06-22 10:44:45,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:45,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:45,956 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:44:45,956 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:45,957 INFO L794 eck$LassoCheckResult]: Stem: 892#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 888#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 889#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 929#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 934#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 933#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 862#L6-2 [2020-06-22 10:44:45,957 INFO L796 eck$LassoCheckResult]: Loop: 862#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 900#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 895#L6-4 [169] L6-4-->L6-6: Formula: (and (> |v_ULTIMATE.start_main_#t~mem3_3| 35) (not |v_ULTIMATE.start_main_#t~short4_4|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 897#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 875#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 865#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 866#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 869#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 861#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 862#L6-2 [2020-06-22 10:44:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash -259086155, now seen corresponding path program 1 times [2020-06-22 10:44:45,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:45,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1901561177, now seen corresponding path program 1 times [2020-06-22 10:44:45,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:45,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:45,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:45,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:44:45,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:44:45,995 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:44:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:44:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:44:45,996 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. cyclomatic complexity: 31 Second operand 4 states. [2020-06-22 10:44:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:44:46,041 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2020-06-22 10:44:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:44:46,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 79 transitions. [2020-06-22 10:44:46,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 10:44:46,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 69 transitions. [2020-06-22 10:44:46,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-06-22 10:44:46,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-06-22 10:44:46,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 69 transitions. [2020-06-22 10:44:46,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:44:46,048 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 69 transitions. [2020-06-22 10:44:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 69 transitions. [2020-06-22 10:44:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-06-22 10:44:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 10:44:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2020-06-22 10:44:46,051 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-06-22 10:44:46,051 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2020-06-22 10:44:46,051 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:44:46,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2020-06-22 10:44:46,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:44:46,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:46,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:46,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:44:46,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:46,053 INFO L794 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1038#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1039#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1023#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1050#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1058#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1015#L6-2 [2020-06-22 10:44:46,053 INFO L796 eck$LassoCheckResult]: Loop: 1015#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1048#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1045#L6-4 [168] L6-4-->L6-6: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem3_3| 35) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1046#L6-6 [106] L6-6-->L7: Formula: |v_ULTIMATE.start_main_#t~short4_7| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_7|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_4|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1054#L7 [77] L7-->L7-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10)) (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_13) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_11|} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1052#L7-1 [75] L7-1-->L8: Formula: (< |v_ULTIMATE.start_main_#t~mem5_4| 0) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1033#L8 [100] L8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_16)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 (- 5)))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_16) 1)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 1019#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1020#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1024#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1014#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1015#L6-2 [2020-06-22 10:44:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -259086155, now seen corresponding path program 2 times [2020-06-22 10:44:46,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1239417515, now seen corresponding path program 1 times [2020-06-22 10:44:46,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:44:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 302031223, now seen corresponding path program 1 times [2020-06-22 10:44:46,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:46,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:44:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:44:46,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:44:46,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:44:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:44:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:44:46,187 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 5 states. [2020-06-22 10:44:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:44:46,292 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2020-06-22 10:44:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:44:46,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions. [2020-06-22 10:44:46,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-06-22 10:44:46,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 112 transitions. [2020-06-22 10:44:46,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2020-06-22 10:44:46,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-06-22 10:44:46,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2020-06-22 10:44:46,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:44:46,299 INFO L706 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2020-06-22 10:44:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2020-06-22 10:44:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2020-06-22 10:44:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-06-22 10:44:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2020-06-22 10:44:46,304 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-06-22 10:44:46,304 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-06-22 10:44:46,304 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:44:46,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 93 transitions. [2020-06-22 10:44:46,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-06-22 10:44:46,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:44:46,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:44:46,306 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:44:46,306 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:44:46,306 INFO L794 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY [105] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1185#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1186#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1217#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1216#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1214#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1210#L6-2 [2020-06-22 10:44:46,307 INFO L796 eck$LassoCheckResult]: Loop: 1210#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1207#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1205#L6-4 [168] L6-4-->L6-6: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem3_3| 35) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1203#L6-6 [106] L6-6-->L7: Formula: |v_ULTIMATE.start_main_#t~short4_7| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_7|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_4|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1201#L7 [77] L7-->L7-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10)) (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_13) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_11|} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1199#L7-1 [75] L7-1-->L8: Formula: (< |v_ULTIMATE.start_main_#t~mem5_4| 0) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1177#L8 [100] L8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_16)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 (- 5)))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_16) 1)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 1178#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1215#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1213#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1209#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1210#L6-2 [2020-06-22 10:44:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -259087116, now seen corresponding path program 1 times [2020-06-22 10:44:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:46,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1239417515, now seen corresponding path program 2 times [2020-06-22 10:44:46,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:44:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:44:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 807589848, now seen corresponding path program 1 times [2020-06-22 10:44:46,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:44:46,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:44:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:44:46,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:44:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:44:46,537 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-06-22 10:44:46,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:44:46 BasicIcfg [2020-06-22 10:44:46,601 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:44:46,602 INFO L168 Benchmark]: Toolchain (without parser) took 4588.27 ms. Allocated memory was 649.6 MB in the beginning and 756.0 MB in the end (delta: 106.4 MB). Free memory was 559.5 MB in the beginning and 380.2 MB in the end (delta: 179.3 MB). Peak memory consumption was 285.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,603 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:44:46,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.92 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 559.5 MB in the beginning and 649.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 685.2 MB. Free memory was 649.2 MB in the beginning and 647.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,605 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 ms. Allocated memory is still 685.2 MB. Free memory was 647.1 MB in the beginning and 646.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,605 INFO L168 Benchmark]: RCFGBuilder took 306.47 ms. Allocated memory is still 685.2 MB. Free memory was 646.0 MB in the beginning and 622.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,606 INFO L168 Benchmark]: BlockEncodingV2 took 114.47 ms. Allocated memory is still 685.2 MB. Free memory was 622.7 MB in the beginning and 614.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,606 INFO L168 Benchmark]: TraceAbstraction took 648.47 ms. Allocated memory is still 685.2 MB. Free memory was 614.1 MB in the beginning and 557.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,607 INFO L168 Benchmark]: BuchiAutomizer took 3159.14 ms. Allocated memory was 685.2 MB in the beginning and 756.0 MB in the end (delta: 70.8 MB). Free memory was 557.9 MB in the beginning and 380.2 MB in the end (delta: 177.8 MB). Peak memory consumption was 248.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:44:46,612 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 44 locations, 49 edges - StatisticsResult: Encoded RCFG 39 locations, 67 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 292.92 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 559.5 MB in the beginning and 649.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.26 ms. Allocated memory is still 685.2 MB. Free memory was 649.2 MB in the beginning and 647.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.89 ms. Allocated memory is still 685.2 MB. Free memory was 647.1 MB in the beginning and 646.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 306.47 ms. Allocated memory is still 685.2 MB. Free memory was 646.0 MB in the beginning and 622.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 114.47 ms. Allocated memory is still 685.2 MB. Free memory was 622.7 MB in the beginning and 614.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 648.47 ms. Allocated memory is still 685.2 MB. Free memory was 614.1 MB in the beginning and 557.9 MB in the end (delta: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 3159.14 ms. Allocated memory was 685.2 MB in the beginning and 756.0 MB in the end (delta: 70.8 MB). Free memory was 557.9 MB in the beginning and 380.2 MB in the end (delta: 177.8 MB). Peak memory consumption was 248.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant [2020-06-22 10:44:46,623 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:44:46,624 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (\valid[x] == 1 && x == 0) && 4 == unknown-#length-unknown[x] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 20 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14 SDtfs, 68 SDslu, 1 SDs, 0 SdLazy, 61 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 15 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 15 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 69 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 154 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 240 SDslu, 333 SDs, 0 SdLazy, 694 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp92 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 6]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1d4943cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@56e6b973=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3d68998a=0, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@656d276f=-1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@656d276f=0, NULL=0, x=-1, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4fca0d64=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@25acebe6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7290559b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5fd52a5d=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 6]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L4] int* x = alloca(sizeof(int)); [L5] EXPR \read(*x) [L5] COND TRUE *x != 0 [L6] EXPR \read(*x) [L6] -5 <= *x && *x <= 35 Loop: [L6] -5 <= *x && *x <= 35 [L6] EXPR \read(*x) [L6] -5 <= *x && *x <= 35 [L6] COND TRUE -5 <= *x && *x <= 35 [L7] EXPR \read(*x) [L7] COND TRUE *x < 0 [L8] *x = -5 [L5] EXPR \read(*x) [L5] COND TRUE *x != 0 [L6] EXPR \read(*x) [L6] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 10:44:38.718 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 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 !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:44:46.872 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check