YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:49:23,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:49:23,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:49:23,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:49:23,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:49:23,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:49:23,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:49:23,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:49:23,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:49:23,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:49:23,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:49:23,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:49:23,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:49:23,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:49:23,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:49:23,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:49:23,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:49:23,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:49:23,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:49:23,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:49:23,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:49:23,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:49:23,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:49:23,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:49:23,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:49:23,125 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:49:23,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:49:23,126 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:49:23,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:49:23,127 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:49:23,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:49:23,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:49:23,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:49:23,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:49:23,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:49:23,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:49:23,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:49:23,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:49:23,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:49:23,133 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:49:23,147 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:49:23,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:49:23,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:49:23,149 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:49:23,149 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:49:23,149 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:49:23,149 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:49:23,149 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:49:23,150 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:49:23,151 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:49:23,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:49:23,151 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:49:23,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:49:23,151 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:49:23,151 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:49:23,152 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:49:23,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:49:23,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:49:23,152 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:49:23,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:49:23,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:49:23,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:49:23,153 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:49:23,153 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:49:23,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:49:23,192 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:49:23,195 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:49:23,197 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:49:23,197 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:49:23,198 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:49:23,261 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/3f9506ee7a5e4c08acfce06060b5fbf4/FLAG73385a734 [2020-06-22 09:49:23,599 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:49:23,600 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:49:23,600 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:49:23,607 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/3f9506ee7a5e4c08acfce06060b5fbf4/FLAG73385a734 [2020-06-22 09:49:24,002 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/3f9506ee7a5e4c08acfce06060b5fbf4 [2020-06-22 09:49:24,014 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:49:24,015 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:49:24,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:49:24,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:49:24,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:49:24,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4560d3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24, skipping insertion in model container [2020-06-22 09:49:24,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:49:24,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:49:24,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:49:24,289 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:49:24,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:49:24,328 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:49:24,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24 WrapperNode [2020-06-22 09:49:24,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:49:24,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:49:24,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:49:24,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:49:24,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:49:24,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:49:24,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:49:24,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:49:24,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:49:24,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:49:24,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:49:24,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:49:24,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 09:49:24,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:49:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:49:24,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:49:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:49:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:49:24,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:49:24,755 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:49:24,755 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 09:49:24,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:24 BoogieIcfgContainer [2020-06-22 09:49:24,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:49:24,758 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:49:24,758 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:49:24,760 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:49:24,761 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:24" (1/1) ... [2020-06-22 09:49:24,781 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 55 edges [2020-06-22 09:49:24,783 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:49:24,784 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:49:24,784 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:49:24,784 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:49:24,786 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:49:24,787 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:49:24,787 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:49:24,813 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:49:24,849 INFO L200 BlockEncoder]: SBE split 27 edges [2020-06-22 09:49:24,854 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:49:24,856 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:49:24,886 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 09:49:24,889 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 09:49:24,891 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:49:24,891 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:49:24,891 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:49:24,892 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:49:24,892 INFO L313 BlockEncoder]: Encoded RCFG 44 locations, 77 edges [2020-06-22 09:49:24,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:24 BasicIcfg [2020-06-22 09:49:24,893 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:49:24,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:49:24,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:49:24,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:49:24,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:49:24" (1/4) ... [2020-06-22 09:49:24,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee57d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:49:24, skipping insertion in model container [2020-06-22 09:49:24,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (2/4) ... [2020-06-22 09:49:24,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee57d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:49:24, skipping insertion in model container [2020-06-22 09:49:24,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:24" (3/4) ... [2020-06-22 09:49:24,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee57d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:24, skipping insertion in model container [2020-06-22 09:49:24,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:24" (4/4) ... [2020-06-22 09:49:24,902 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:49:24,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:49:24,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-06-22 09:49:24,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-06-22 09:49:24,965 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:49:24,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:49:24,966 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:49:24,967 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:49:24,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:49:24,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:49:24,967 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:49:24,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:49:24,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:49:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-06-22 09:49:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:24,988 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:24,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:24,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 124290, now seen corresponding path program 1 times [2020-06-22 09:49:24,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:24,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:25,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:25,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:25,177 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 09:49:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:25,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:25,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:25,201 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-06-22 09:49:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:25,379 INFO L93 Difference]: Finished difference Result 44 states and 77 transitions. [2020-06-22 09:49:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:25,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:25,394 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:49:25,394 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 09:49:25,398 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 09:49:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 09:49:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-06-22 09:49:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 09:49:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-06-22 09:49:25,439 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 3 [2020-06-22 09:49:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-06-22 09:49:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-06-22 09:49:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:25,441 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:25,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:25,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash 124292, now seen corresponding path program 1 times [2020-06-22 09:49:25,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:25,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:25,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:25,483 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 09:49:25,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:25,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:25,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:25,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:25,486 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2020-06-22 09:49:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:25,601 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. [2020-06-22 09:49:25,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:25,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:25,603 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:49:25,603 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 09:49:25,604 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 09:49:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 09:49:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-06-22 09:49:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 09:49:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2020-06-22 09:49:25,610 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 3 [2020-06-22 09:49:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:25,610 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. [2020-06-22 09:49:25,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. [2020-06-22 09:49:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:49:25,611 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:25,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:49:25,611 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 124293, now seen corresponding path program 1 times [2020-06-22 09:49:25,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:25,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:25,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:25,650 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 09:49:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:25,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:25,652 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 3 states. [2020-06-22 09:49:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:25,777 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2020-06-22 09:49:25,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:25,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:49:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:25,779 INFO L225 Difference]: With dead ends: 42 [2020-06-22 09:49:25,779 INFO L226 Difference]: Without dead ends: 40 [2020-06-22 09:49:25,779 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 09:49:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-06-22 09:49:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-06-22 09:49:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 09:49:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2020-06-22 09:49:25,784 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 3 [2020-06-22 09:49:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:25,785 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. [2020-06-22 09:49:25,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2020-06-22 09:49:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:49:25,785 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:25,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:49:25,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash 3850587, now seen corresponding path program 1 times [2020-06-22 09:49:25,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:25,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:25,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:25,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:25,821 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 09:49:25,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:25,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:25,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:25,823 INFO L87 Difference]: Start difference. First operand 40 states and 69 transitions. Second operand 3 states. [2020-06-22 09:49:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:25,949 INFO L93 Difference]: Finished difference Result 40 states and 69 transitions. [2020-06-22 09:49:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:25,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:49:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:25,951 INFO L225 Difference]: With dead ends: 40 [2020-06-22 09:49:25,951 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:49:25,952 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 09:49:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:49:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 09:49:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:49:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2020-06-22 09:49:25,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 4 [2020-06-22 09:49:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:25,957 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2020-06-22 09:49:25,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2020-06-22 09:49:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:49:25,957 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:25,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:49:25,958 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash 3850589, now seen corresponding path program 1 times [2020-06-22 09:49:25,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:25,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:25,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:25,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:25,982 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 09:49:25,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:25,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:25,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:25,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:25,984 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2020-06-22 09:49:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:26,078 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2020-06-22 09:49:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:26,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:49:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:26,079 INFO L225 Difference]: With dead ends: 40 [2020-06-22 09:49:26,079 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 09:49:26,080 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 09:49:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 09:49:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-06-22 09:49:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 09:49:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2020-06-22 09:49:26,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 57 transitions. Word has length 4 [2020-06-22 09:49:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:26,084 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 57 transitions. [2020-06-22 09:49:26,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 57 transitions. [2020-06-22 09:49:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 09:49:26,085 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:26,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 09:49:26,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 3850590, now seen corresponding path program 1 times [2020-06-22 09:49:26,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:26,120 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 09:49:26,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:26,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:26,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:26,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:26,121 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. Second operand 3 states. [2020-06-22 09:49:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:26,212 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2020-06-22 09:49:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:26,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 09:49:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:26,213 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:49:26,213 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 09:49:26,213 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 09:49:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 09:49:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 09:49:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 09:49:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 53 transitions. [2020-06-22 09:49:26,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 53 transitions. Word has length 4 [2020-06-22 09:49:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:26,218 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 53 transitions. [2020-06-22 09:49:26,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 53 transitions. [2020-06-22 09:49:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:49:26,218 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:26,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:49:26,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash 119366637, now seen corresponding path program 1 times [2020-06-22 09:49:26,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:26,252 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 09:49:26,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:26,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:26,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:26,254 INFO L87 Difference]: Start difference. First operand 32 states and 53 transitions. Second operand 3 states. [2020-06-22 09:49:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:26,333 INFO L93 Difference]: Finished difference Result 32 states and 53 transitions. [2020-06-22 09:49:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:26,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:49:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:26,335 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:49:26,335 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 09:49:26,335 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 09:49:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 09:49:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 09:49:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:49:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2020-06-22 09:49:26,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 5 [2020-06-22 09:49:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:26,339 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2020-06-22 09:49:26,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2020-06-22 09:49:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:49:26,340 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:49:26,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:49:26,340 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION]=== [2020-06-22 09:49:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 119366635, now seen corresponding path program 1 times [2020-06-22 09:49:26,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:26,365 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 09:49:26,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:49:26,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:49:26,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:49:26,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:49:26,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:49:26,367 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 3 states. [2020-06-22 09:49:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:49:26,418 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2020-06-22 09:49:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:49:26,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:49:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:49:26,419 INFO L225 Difference]: With dead ends: 25 [2020-06-22 09:49:26,419 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:49:26,420 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 09:49:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:49:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:49:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:49:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:49:26,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-06-22 09:49:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:49:26,421 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:26,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:49:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:49:26,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:49:26,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:49:26,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:49:26,466 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,467 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point L17-2(lines 17 23) no Hoare annotation was computed. [2020-06-22 09:49:26,468 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-06-22 09:49:26,469 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 17 23) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) [2020-06-22 09:49:26,469 INFO L448 ceAbstractionStarter]: For program point L17-5(lines 17 23) no Hoare annotation was computed. [2020-06-22 09:49:26,469 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,469 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 21) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:49:26,470 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 09:49:26,471 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:49:26,479 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:26,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:26 BasicIcfg [2020-06-22 09:49:26,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:49:26,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:49:26,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:49:26,494 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:49:26,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:26,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:49:24" (1/5) ... [2020-06-22 09:49:26,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0a4fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:49:26, skipping insertion in model container [2020-06-22 09:49:26,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:26,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:49:24" (2/5) ... [2020-06-22 09:49:26,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0a4fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:49:26, skipping insertion in model container [2020-06-22 09:49:26,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:26,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:49:24" (3/5) ... [2020-06-22 09:49:26,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0a4fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:26, skipping insertion in model container [2020-06-22 09:49:26,496 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:26,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:49:24" (4/5) ... [2020-06-22 09:49:26,497 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c0a4fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:26, skipping insertion in model container [2020-06-22 09:49:26,497 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:49:26,497 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:49:26" (5/5) ... [2020-06-22 09:49:26,498 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:49:26,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:49:26,520 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:49:26,520 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:49:26,520 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:49:26,520 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:49:26,520 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:49:26,520 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:49:26,521 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:49:26,521 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:49:26,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-06-22 09:49:26,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:49:26,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:49:26,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:49:26,536 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:26,536 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:26,536 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:49:26,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2020-06-22 09:49:26,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:49:26,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:49:26,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:49:26,539 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:26,539 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:26,545 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue [93] 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] 15#L-1true [159] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 16#L10true [83] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 34#L10-1true [114] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 38#L11true [94] L11-->L12: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 20#L12true [105] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 43#L13true [137] L13-->L17-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem3_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 44#L17-4true [2020-06-22 09:49:26,546 INFO L796 eck$LassoCheckResult]: Loop: 44#L17-4true [124] L17-4-->L17-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 30#L17-1true [110] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 27#L17-2true [109] L17-2-->L18: Formula: (<= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 9#L18true [75] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 7#L18-1true [149] L18-1-->L22: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem7_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 40#L22true [97] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 35#L22-1true [90] L22-1-->L22-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 13#L22-2true [223] L22-2-->L17-4: Formula: (and (= |v_#memory_int_21| (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27) v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem10_6|)))) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_22|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int, ULTIMATE.start_test_fun_#t~mem9] 44#L17-4true [2020-06-22 09:49:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1281483396, now seen corresponding path program 1 times [2020-06-22 09:49:26,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1588196002, now seen corresponding path program 1 times [2020-06-22 09:49:26,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1849924323, now seen corresponding path program 1 times [2020-06-22 09:49:26,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:26,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:27,145 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2020-06-22 09:49:27,302 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-06-22 09:49:27,316 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:49:27,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:49:27,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:49:27,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:49:27,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:49:27,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:49:27,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:49:27,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:49:27,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:49:27,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:49:27,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:49:27,342 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 09:49:27,350 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 09:49:27,352 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 09:49:27,355 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 09:49:27,358 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 09:49:27,360 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 09:49:27,368 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 09:49:27,371 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 09:49:27,373 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 09:49:27,375 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 09:49:27,378 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 09:49:27,749 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2020-06-22 09:49:27,864 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 09:49:27,864 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 09:49:27,866 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 09:49:27,867 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 09:49:27,869 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 09:49:27,871 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 09:49:27,873 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 09:49:28,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:49:28,334 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:49:28,336 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 09:49:28,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,344 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 09:49:28,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,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 09:49:28,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,349 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 09:49:28,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:28,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:28,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,356 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 09:49:28,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,359 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 09:49:28,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,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 09:49:28,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,365 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 09:49:28,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:28,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:28,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,370 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 09:49:28,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:28,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:28,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:28,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,373 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 09:49:28,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:28,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:28,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,379 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 09:49:28,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:28,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:28,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:28,400 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 09:49:28,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:28,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:28,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:28,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:28,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:28,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:28,436 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:49:28,458 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:49:28,458 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 09:49:28,461 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:49:28,462 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:49:28,462 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:49:28,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1 Supporting invariants [] [2020-06-22 09:49:28,572 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:49:28,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:28,579 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:28,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:49:28,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:28,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:49:28,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:28,883 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 09:49:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:29,109 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:29,118 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:29,127 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:29,135 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:29,136 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 09:49:29,139 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 10 loop predicates [2020-06-22 09:49:29,140 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 44 states. Second operand 10 states. [2020-06-22 09:49:31,381 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 44 states.. Second operand 10 states. Result 405 states and 664 transitions. Complement of second has 106 states. [2020-06-22 09:49:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 32 states 5 stem states 24 non-accepting loop states 3 accepting loop states [2020-06-22 09:49:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:49:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 423 transitions. [2020-06-22 09:49:31,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 7 letters. Loop has 8 letters. [2020-06-22 09:49:31,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:31,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 15 letters. Loop has 8 letters. [2020-06-22 09:49:31,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:31,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 423 transitions. Stem has 7 letters. Loop has 16 letters. [2020-06-22 09:49:31,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:31,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 664 transitions. [2020-06-22 09:49:31,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2020-06-22 09:49:31,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 56 states and 61 transitions. [2020-06-22 09:49:31,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-06-22 09:49:31,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-06-22 09:49:31,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2020-06-22 09:49:31,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:49:31,418 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-06-22 09:49:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2020-06-22 09:49:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 15. [2020-06-22 09:49:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 09:49:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-06-22 09:49:31,421 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 09:49:31,421 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-06-22 09:49:31,421 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:49:31,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-06-22 09:49:31,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:49:31,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:49:31,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:49:31,422 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:31,422 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:49:31,423 INFO L794 eck$LassoCheckResult]: Stem: 807#ULTIMATE.startENTRY [93] 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] 804#L-1 [158] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 805#L10 [83] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 800#L10-1 [114] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 801#L11 [94] L11-->L12: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 808#L12 [105] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 809#L13 [137] L13-->L17-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem3_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 803#L17-4 [2020-06-22 09:49:31,424 INFO L796 eck$LassoCheckResult]: Loop: 803#L17-4 [124] L17-4-->L17-1: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 797#L17-1 [110] L17-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 795#L17-2 [109] L17-2-->L18: Formula: (<= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 796#L18 [75] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 798#L18-1 [149] L18-1-->L22: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem7_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 799#L22 [97] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (select |v_#valid_33| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_23|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 806#L22-1 [90] L22-1-->L22-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_25|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 802#L22-2 [223] L22-2-->L17-4: Formula: (and (= |v_#memory_int_21| (store |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27 (store (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_27) v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem10_6|)))) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_20 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~z_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_20)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_22|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_27, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, #length=|v_#length_34|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_20} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int, ULTIMATE.start_test_fun_#t~mem9] 803#L17-4 [2020-06-22 09:49:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1310112547, now seen corresponding path program 1 times [2020-06-22 09:49:31,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1588196002, now seen corresponding path program 2 times [2020-06-22 09:49:31,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:31,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:49:31,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1344365698, now seen corresponding path program 1 times [2020-06-22 09:49:31,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:49:31,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:49:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:49:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:49:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:31,908 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2020-06-22 09:49:32,052 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-06-22 09:49:32,055 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:49:32,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:49:32,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:49:32,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:49:32,056 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:49:32,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:49:32,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:49:32,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:49:32,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:49:32,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:49:32,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:49:32,060 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 09:49:32,062 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 09:49:32,064 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 09:49:32,065 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 09:49:32,068 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 09:49:32,371 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 09:49:32,479 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2020-06-22 09:49:32,480 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 09:49:32,482 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 09:49:32,484 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 09:49:32,487 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 09:49:32,489 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 09:49:32,490 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 09:49:32,492 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 09:49:32,495 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 09:49:32,496 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 09:49:32,498 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 09:49:32,500 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 09:49:32,502 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 09:49:32,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:49:32,958 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:49:32,958 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 09:49:32,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:32,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:32,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:32,961 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 09:49:32,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:32,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:32,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:32,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:32,963 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 09:49:32,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:49:32,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:49:32,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:49:32,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:32,965 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 09:49:32,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:32,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:32,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:32,969 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 09:49:32,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:32,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:32,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:32,977 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 09:49:32,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:32,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:32,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:32,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:32,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:32,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:33,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:49:33,001 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 09:49:33,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:49:33,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:49:33,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:49:33,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:49:33,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:49:33,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:49:33,022 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:49:33,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:49:33,031 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 09:49:33,032 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:49:33,033 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:49:33,033 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:49:33,034 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1 Supporting invariants [] [2020-06-22 09:49:33,109 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-06-22 09:49:33,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:33,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:49:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:49:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:33,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 09:49:33,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:33,199 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-06-22 09:49:33,200 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:49:33,218 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:49:33,219 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:49:33,219 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2020-06-22 09:49:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:49:33,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2020-06-22 09:49:33,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:49:33,444 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 09:49:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:33,622 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:33,631 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:33,640 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:49:33,650 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:49:33,650 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 09:49:33,650 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 10 loop predicates [2020-06-22 09:49:33,650 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 20 transitions. cyclomatic complexity: 6 Second operand 10 states. [2020-06-22 09:49:34,053 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 20 transitions. cyclomatic complexity: 6. Second operand 10 states. Result 31 states and 37 transitions. Complement of second has 24 states. [2020-06-22 09:49:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 2 accepting loop states [2020-06-22 09:49:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 09:49:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2020-06-22 09:49:34,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 7 letters. Loop has 8 letters. [2020-06-22 09:49:34,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 15 letters. Loop has 8 letters. [2020-06-22 09:49:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 34 transitions. Stem has 7 letters. Loop has 16 letters. [2020-06-22 09:49:34,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:49:34,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-06-22 09:49:34,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:34,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-06-22 09:49:34,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:49:34,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:49:34,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:49:34,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:49:34,063 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:34,063 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:34,063 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:49:34,063 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:49:34,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:49:34,063 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:49:34,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:49:34,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:49:34 BasicIcfg [2020-06-22 09:49:34,069 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:49:34,070 INFO L168 Benchmark]: Toolchain (without parser) took 10055.30 ms. Allocated memory was 649.6 MB in the beginning and 847.8 MB in the end (delta: 198.2 MB). Free memory was 565.2 MB in the beginning and 550.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 213.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,071 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:49:34,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.18 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 565.2 MB in the beginning and 649.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 686.3 MB. Free memory was 649.3 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 09:49:34,072 INFO L168 Benchmark]: Boogie Preprocessor took 23.70 ms. Allocated memory is still 686.3 MB. Free memory was 647.1 MB in the beginning and 646.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,073 INFO L168 Benchmark]: RCFGBuilder took 361.32 ms. Allocated memory is still 686.3 MB. Free memory was 646.1 MB in the beginning and 618.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,073 INFO L168 Benchmark]: BlockEncodingV2 took 135.54 ms. Allocated memory is still 686.3 MB. Free memory was 618.2 MB in the beginning and 607.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,074 INFO L168 Benchmark]: TraceAbstraction took 1596.08 ms. Allocated memory is still 686.3 MB. Free memory was 607.4 MB in the beginning and 423.0 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,074 INFO L168 Benchmark]: BuchiAutomizer took 7578.64 ms. Allocated memory was 686.3 MB in the beginning and 847.8 MB in the end (delta: 161.5 MB). Free memory was 423.0 MB in the beginning and 550.3 MB in the end (delta: -127.3 MB). Peak memory consumption was 34.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:49:34,079 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 52 locations, 55 edges - StatisticsResult: Encoded RCFG 44 locations, 77 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.18 ms. Allocated memory was 649.6 MB in the beginning and 686.3 MB in the end (delta: 36.7 MB). Free memory was 565.2 MB in the beginning and 649.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.82 ms. Allocated memory is still 686.3 MB. Free memory was 649.3 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 23.70 ms. Allocated memory is still 686.3 MB. Free memory was 647.1 MB in the beginning and 646.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 361.32 ms. Allocated memory is still 686.3 MB. Free memory was 646.1 MB in the beginning and 618.2 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 135.54 ms. Allocated memory is still 686.3 MB. Free memory was 618.2 MB in the beginning and 607.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1596.08 ms. Allocated memory is still 686.3 MB. Free memory was 607.4 MB in the beginning and 423.0 MB in the end (delta: 184.4 MB). Peak memory consumption was 184.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 7578.64 ms. Allocated memory was 686.3 MB in the beginning and 847.8 MB in the end (delta: 161.5 MB). Free memory was 423.0 MB in the beginning and 550.3 MB in the end (delta: -127.3 MB). Peak memory consumption was 34.1 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 - 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: 22]: 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: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: 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: 13]: 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: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: 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: 17]: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: 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: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-06-22 09:49:34,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:34,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:34,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:34,089 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:34,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:49:34,090 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == z_ref) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && 1 == \valid[x_ref]) && y_ref == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 26 error locations. SAFE Result, 1.5s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 369 SDslu, 5 SDs, 0 SdLazy, 405 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 1 and consists of 32 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 1 and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 1.0s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 41 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 746 SDslu, 177 SDs, 0 SdLazy, 1532 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax100 hnf100 lsp95 ukn67 mio100 lsp36 div100 bol100 ite100 ukn100 eq179 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:49:20.808 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:49:34.316 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check