YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:24:25,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:24:25,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:24:25,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:24:25,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:24:25,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:24:25,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:24:25,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:24:25,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:24:25,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:24:25,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:24:25,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:24:25,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:24:25,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:24:25,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:24:25,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:24:25,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:24:25,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:24:25,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:24:25,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:24:25,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:24:25,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:24:25,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:24:25,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:24:25,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:24:25,222 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:24:25,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:24:25,223 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:24:25,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:24:25,224 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:24:25,224 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:24:25,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:24:25,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:24:25,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:24:25,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:24:25,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:24:25,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:24:25,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:24:25,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:24:25,229 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:24:25,243 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:24:25,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:24:25,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:24:25,244 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:24:25,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:24:25,245 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:25,245 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:24:25,245 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:24:25,245 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:24:25,246 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:24:25,246 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:24:25,246 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:24:25,246 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:24:25,246 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:24:25,247 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:24:25,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:24:25,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:24:25,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:24:25,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:24:25,247 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:24:25,248 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:24:25,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:24:25,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:24:25,248 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:24:25,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:25,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:24:25,249 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:24:25,249 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:24:25,249 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:24:25,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:24:25,288 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:24:25,291 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:24:25,293 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:24:25,293 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:24:25,294 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:24:25,380 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ed91338978e24b79bf73bb487eda5537/FLAG6b49f4c52 [2020-06-22 10:24:25,730 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:24:25,731 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:24:25,731 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:24:25,737 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ed91338978e24b79bf73bb487eda5537/FLAG6b49f4c52 [2020-06-22 10:24:26,126 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ed91338978e24b79bf73bb487eda5537 [2020-06-22 10:24:26,138 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:24:26,139 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:24:26,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:24:26,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:24:26,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a14c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26, skipping insertion in model container [2020-06-22 10:24:26,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:24:26,175 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:24:26,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,421 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:24:26,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,456 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:24:26,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26 WrapperNode [2020-06-22 10:24:26,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:24:26,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:24:26,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:24:26,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:24:26,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:24:26,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:24:26,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:24:26,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:24:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:24:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:24:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:24:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:24:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:24:26,930 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:24:26,930 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:24:26,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26 BoogieIcfgContainer [2020-06-22 10:24:26,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:24:26,933 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:24:26,933 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:24:26,935 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:24:26,936 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,955 INFO L313 BlockEncoder]: Initial Icfg 59 locations, 61 edges [2020-06-22 10:24:26,957 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:24:26,958 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:24:26,958 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:24:26,959 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:26,960 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:24:26,961 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:24:26,961 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:24:26,989 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:24:27,036 INFO L200 BlockEncoder]: SBE split 33 edges [2020-06-22 10:24:27,042 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:24:27,044 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,081 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:24:27,084 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:24:27,086 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:24:27,086 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,086 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:24:27,087 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:24:27,087 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 99 edges [2020-06-22 10:24:27,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27 BasicIcfg [2020-06-22 10:24:27,088 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:24:27,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:24:27,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:24:27,092 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:24:27,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:24:26" (1/4) ... [2020-06-22 10:24:27,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2d7c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/4) ... [2020-06-22 10:24:27,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2d7c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (3/4) ... [2020-06-22 10:24:27,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2d7c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/4) ... [2020-06-22 10:24:27,096 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:27,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:24:27,116 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-06-22 10:24:27,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-06-22 10:24:27,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:27,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:24:27,163 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:24:27,163 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:27,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:27,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:27,164 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:24:27,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:27,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:24:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-06-22 10:24:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:24:27,185 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:24:27,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash 133301, now seen corresponding path program 1 times [2020-06-22 10:24:27,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:27,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:27,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,416 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 10:24:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,657 INFO L93 Difference]: Finished difference Result 51 states and 99 transitions. [2020-06-22 10:24:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:27,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:24:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,674 INFO L225 Difference]: With dead ends: 51 [2020-06-22 10:24:27,674 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 10:24:27,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 10:24:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 10:24:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:24:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. [2020-06-22 10:24:27,720 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 91 transitions. Word has length 3 [2020-06-22 10:24:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,721 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 91 transitions. [2020-06-22 10:24:27,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 91 transitions. [2020-06-22 10:24:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:24:27,722 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:24:27,723 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,723 INFO L82 PathProgramCache]: Analyzing trace with hash 133303, now seen corresponding path program 1 times [2020-06-22 10:24:27,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,759 INFO L87 Difference]: Start difference. First operand 47 states and 91 transitions. Second operand 3 states. [2020-06-22 10:24:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,928 INFO L93 Difference]: Finished difference Result 51 states and 91 transitions. [2020-06-22 10:24:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:27,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:24:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,930 INFO L225 Difference]: With dead ends: 51 [2020-06-22 10:24:27,930 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 10:24:27,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 10:24:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 10:24:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 10:24:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 87 transitions. [2020-06-22 10:24:27,938 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 87 transitions. Word has length 3 [2020-06-22 10:24:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,938 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 87 transitions. [2020-06-22 10:24:27,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2020-06-22 10:24:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:24:27,939 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:24:27,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 133304, now seen corresponding path program 1 times [2020-06-22 10:24:27,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:27,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,985 INFO L87 Difference]: Start difference. First operand 47 states and 87 transitions. Second operand 3 states. [2020-06-22 10:24:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,174 INFO L93 Difference]: Finished difference Result 47 states and 87 transitions. [2020-06-22 10:24:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:24:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,176 INFO L225 Difference]: With dead ends: 47 [2020-06-22 10:24:28,176 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 10:24:28,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 10:24:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-06-22 10:24:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 10:24:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 83 transitions. [2020-06-22 10:24:28,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 83 transitions. Word has length 3 [2020-06-22 10:24:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,183 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 83 transitions. [2020-06-22 10:24:28,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 83 transitions. [2020-06-22 10:24:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:24:28,184 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:24:28,184 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 4129919, now seen corresponding path program 1 times [2020-06-22 10:24:28,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,227 INFO L87 Difference]: Start difference. First operand 43 states and 83 transitions. Second operand 3 states. [2020-06-22 10:24:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,367 INFO L93 Difference]: Finished difference Result 43 states and 83 transitions. [2020-06-22 10:24:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:24:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,368 INFO L225 Difference]: With dead ends: 43 [2020-06-22 10:24:28,368 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 10:24:28,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 10:24:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 10:24:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 10:24:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 75 transitions. [2020-06-22 10:24:28,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 75 transitions. Word has length 4 [2020-06-22 10:24:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,375 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 75 transitions. [2020-06-22 10:24:28,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 75 transitions. [2020-06-22 10:24:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:24:28,375 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:24:28,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash 4129920, now seen corresponding path program 1 times [2020-06-22 10:24:28,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,416 INFO L87 Difference]: Start difference. First operand 39 states and 75 transitions. Second operand 3 states. [2020-06-22 10:24:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,543 INFO L93 Difference]: Finished difference Result 39 states and 75 transitions. [2020-06-22 10:24:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:24:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,544 INFO L225 Difference]: With dead ends: 39 [2020-06-22 10:24:28,544 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:24:28,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:24:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 10:24:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 10:24:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2020-06-22 10:24:28,549 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 4 [2020-06-22 10:24:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,549 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. [2020-06-22 10:24:28,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. [2020-06-22 10:24:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:28,550 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:28,551 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 128024770, now seen corresponding path program 1 times [2020-06-22 10:24:28,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,587 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. [2020-06-22 10:24:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,693 INFO L93 Difference]: Finished difference Result 35 states and 67 transitions. [2020-06-22 10:24:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:24:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,695 INFO L225 Difference]: With dead ends: 35 [2020-06-22 10:24:28,695 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:24:28,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:24:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 10:24:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:24:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2020-06-22 10:24:28,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 5 [2020-06-22 10:24:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,700 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. [2020-06-22 10:24:28,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. [2020-06-22 10:24:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:28,700 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:28,701 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 128024772, now seen corresponding path program 1 times [2020-06-22 10:24:28,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,725 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand 3 states. [2020-06-22 10:24:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,804 INFO L93 Difference]: Finished difference Result 35 states and 61 transitions. [2020-06-22 10:24:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:24:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,805 INFO L225 Difference]: With dead ends: 35 [2020-06-22 10:24:28,805 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 10:24:28,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 10:24:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 10:24:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 10:24:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-06-22 10:24:28,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 5 [2020-06-22 10:24:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,810 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-06-22 10:24:28,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. [2020-06-22 10:24:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:28,811 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:28,811 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 128024773, now seen corresponding path program 1 times [2020-06-22 10:24:28,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,847 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 3 states. [2020-06-22 10:24:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,959 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. [2020-06-22 10:24:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:24:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,960 INFO L225 Difference]: With dead ends: 32 [2020-06-22 10:24:28,960 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:24:28,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:24:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:24:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:24:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2020-06-22 10:24:28,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 55 transitions. Word has length 5 [2020-06-22 10:24:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,965 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 55 transitions. [2020-06-22 10:24:28,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 55 transitions. [2020-06-22 10:24:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:28,965 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,966 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash -326201459, now seen corresponding path program 1 times [2020-06-22 10:24:28,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:28,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,996 INFO L87 Difference]: Start difference. First operand 29 states and 55 transitions. Second operand 3 states. [2020-06-22 10:24:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,099 INFO L93 Difference]: Finished difference Result 29 states and 55 transitions. [2020-06-22 10:24:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:29,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:24:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,100 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:24:29,100 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:24:29,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:24:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:24:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:24:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2020-06-22 10:24:29,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 6 [2020-06-22 10:24:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,104 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 47 transitions. [2020-06-22 10:24:29,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 47 transitions. [2020-06-22 10:24:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:29,105 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash -326201457, now seen corresponding path program 1 times [2020-06-22 10:24:29,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:29,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,128 INFO L87 Difference]: Start difference. First operand 25 states and 47 transitions. Second operand 3 states. [2020-06-22 10:24:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,225 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. [2020-06-22 10:24:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:29,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:24:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,226 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:24:29,226 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:24:29,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:24:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:24:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:24:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2020-06-22 10:24:29,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 6 [2020-06-22 10:24:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,230 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. [2020-06-22 10:24:29,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. [2020-06-22 10:24:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:29,231 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,231 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -326201456, now seen corresponding path program 1 times [2020-06-22 10:24:29,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:29,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:29,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:29,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,262 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 3 states. [2020-06-22 10:24:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,352 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. [2020-06-22 10:24:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:29,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:24:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,353 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:24:29,353 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:24:29,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:24:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:24:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:24:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:24:29,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-06-22 10:24:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:29,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:24:29,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:24:29,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:24:29,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2020-06-22 10:24:29,408 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 15 19) no Hoare annotation was computed. [2020-06-22 10:24:29,409 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L444 ceAbstractionStarter]: At program point L15-9(lines 14 19) 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_~c~0.offset) (= 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) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point L15-10(lines 15 19) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,410 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,411 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:24:29,412 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 10:24:29,413 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,413 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 10:24:29,413 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:24:29,423 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:29,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:29 BasicIcfg [2020-06-22 10:24:29,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:24:29,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:24:29,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:24:29,438 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:24:29,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:29,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:24:26" (1/5) ... [2020-06-22 10:24:29,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5451b237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:29, skipping insertion in model container [2020-06-22 10:24:29,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:29,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/5) ... [2020-06-22 10:24:29,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5451b237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:29, skipping insertion in model container [2020-06-22 10:24:29,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:29,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:26" (3/5) ... [2020-06-22 10:24:29,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5451b237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:29, skipping insertion in model container [2020-06-22 10:24:29,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:29,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/5) ... [2020-06-22 10:24:29,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5451b237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:29, skipping insertion in model container [2020-06-22 10:24:29,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:29,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:29" (5/5) ... [2020-06-22 10:24:29,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:29,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:29,465 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:24:29,477 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:24:29,477 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:29,477 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:29,478 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:29,478 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:24:29,478 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:29,478 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:24:29,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 10:24:29,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:24:29,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,492 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,492 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:24:29,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-06-22 10:24:29,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:24:29,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,496 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,496 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,501 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [102] 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] 10#L-1true [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |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_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_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|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_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_5|, #valid=|v_#valid_7|} 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_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_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~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_#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_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_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_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_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_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_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_test_fun_#t~mem12, 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~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_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, 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_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 22#L11true [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (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_8|, #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_6|, 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_8|, #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_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 19#L11-1true [98] L11-1-->L12: 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_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, 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_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, 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] 39#L12true [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| 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|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| 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_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, 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] 51#L13true [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 5#L15-9true [2020-06-22 10:24:29,502 INFO L796 eck$LassoCheckResult]: Loop: 5#L15-9true [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_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)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) 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_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #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_14|, 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~mem4] 14#L15true [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 30#L15-1true [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 29#L15-2true [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 8#L15-7true [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 35#L16true [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 33#L16-1true [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 45#L17true [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| 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~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 42#L17-1true [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 7#L18true [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 6#L18-1true [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 5#L15-9true [2020-06-22 10:24:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 1 times [2020-06-22 10:24:29,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1705532831, now seen corresponding path program 1 times [2020-06-22 10:24:29,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:24:29,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,575 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-06-22 10:24:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,731 INFO L93 Difference]: Finished difference Result 53 states and 101 transitions. [2020-06-22 10:24:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:29,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 101 transitions. [2020-06-22 10:24:29,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 10:24:29,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 22 states and 40 transitions. [2020-06-22 10:24:29,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:24:29,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 10:24:29,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 40 transitions. [2020-06-22 10:24:29,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:29,739 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 40 transitions. [2020-06-22 10:24:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 40 transitions. [2020-06-22 10:24:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-06-22 10:24:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:24:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2020-06-22 10:24:29,742 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 10:24:29,742 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 39 transitions. [2020-06-22 10:24:29,742 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:24:29,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 39 transitions. [2020-06-22 10:24:29,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:24:29,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,744 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,744 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,745 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY [102] 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] 123#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |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_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_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|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_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_5|, #valid=|v_#valid_7|} 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_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_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~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_#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_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_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_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_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_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_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_test_fun_#t~mem12, 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~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_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, 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_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 124#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (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_8|, #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_6|, 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_8|, #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_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 126#L11-1 [98] L11-1-->L12: 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_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, 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_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, 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] 127#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| 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|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| 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_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, 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] 130#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 120#L15-9 [2020-06-22 10:24:29,745 INFO L796 eck$LassoCheckResult]: Loop: 120#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_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)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) 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_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #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_14|, 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~mem4] 115#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 116#L15-1 [216] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|) (not |v_ULTIMATE.start_test_fun_#t~short8_2|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 133#L15-2 [113] L15-2-->L15-7: Formula: (not |v_ULTIMATE.start_test_fun_#t~short8_5|) InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_5|} AuxVars[] AssignedVars[] 122#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 119#L16 [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 113#L16-1 [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 114#L17 [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| 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~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 117#L17-1 [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 118#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 121#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 120#L15-9 [2020-06-22 10:24:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 2 times [2020-06-22 10:24:29,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,775 INFO L82 PathProgramCache]: Analyzing trace with hash 781980002, now seen corresponding path program 1 times [2020-06-22 10:24:29,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:29,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:29,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,786 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:24:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:29,787 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. cyclomatic complexity: 19 Second operand 3 states. [2020-06-22 10:24:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,863 INFO L93 Difference]: Finished difference Result 22 states and 38 transitions. [2020-06-22 10:24:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:29,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 38 transitions. [2020-06-22 10:24:29,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:24:29,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 35 transitions. [2020-06-22 10:24:29,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-06-22 10:24:29,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-06-22 10:24:29,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 35 transitions. [2020-06-22 10:24:29,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:29,866 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 10:24:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 35 transitions. [2020-06-22 10:24:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 10:24:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:24:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 10:24:29,868 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 10:24:29,868 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 10:24:29,868 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:24:29,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 35 transitions. [2020-06-22 10:24:29,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:24:29,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:29,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:29,870 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,870 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,870 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY [102] 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] 172#L-1 [186] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |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_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_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|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_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_5|, #valid=|v_#valid_7|} 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_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_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~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_#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_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_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_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_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_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_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_test_fun_#t~mem12, 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~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_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, 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_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 173#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (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_8|, #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_6|, 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_8|, #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_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 174#L11-1 [98] L11-1-->L12: 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_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, 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_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, 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] 175#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| 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|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| 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_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, 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] 179#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 169#L15-9 [2020-06-22 10:24:29,871 INFO L796 eck$LassoCheckResult]: Loop: 169#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_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)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) 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_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #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_14|, 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~mem4] 162#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 163#L15-1 [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 181#L15-2 [112] L15-2-->L15-3: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 180#L15-3 [109] L15-3-->L15-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| 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_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, 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_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, 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~mem6] 178#L15-4 [106] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, 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_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_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~mem7] 176#L15-5 [229] L15-5-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 171#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 166#L16 [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 164#L16-1 [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 165#L17 [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| 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~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 167#L17-1 [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 168#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 170#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 169#L15-9 [2020-06-22 10:24:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash -312348709, now seen corresponding path program 3 times [2020-06-22 10:24:29,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash -32277304, now seen corresponding path program 1 times [2020-06-22 10:24:29,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:29,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -893409502, now seen corresponding path program 1 times [2020-06-22 10:24:29,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:30,100 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 10:24:30,703 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-06-22 10:24:30,939 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-06-22 10:24:30,953 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:30,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:30,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:30,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:30,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:30,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:30,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:30,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:30,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:24:30,955 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:30,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:30,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:30,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,548 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-06-22 10:24:31,719 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-06-22 10:24:31,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:24:31,967 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-06-22 10:24:32,319 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:32,324 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:32,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:32,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:32,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,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 10:24:32,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:32,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:32,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:32,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:32,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:32,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:32,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:32,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:32,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:24:32,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:32,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:32,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:32,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:32,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:32,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:32,410 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:32,443 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:24:32,444 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2020-06-22 10:24:32,446 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:32,448 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:24:32,448 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:32,449 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2020-06-22 10:24:32,644 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:24:32,648 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:32,648 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:32,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:32,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:24:32,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:32,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2020-06-22 10:24:32,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:33,069 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 10:24:33,070 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 10:24:33,123 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,235 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2020-06-22 10:24:33,235 INFO L497 ElimStorePlain]: treesize reduction 141, result has 32.9 percent of original size [2020-06-22 10:24:33,236 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,236 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:71 [2020-06-22 10:24:33,419 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:33,420 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 126 [2020-06-22 10:24:33,453 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,475 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:33,475 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 10:24:33,476 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,546 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:33,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 126 [2020-06-22 10:24:33,605 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,617 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2020-06-22 10:24:33,618 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:33,817 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2020-06-22 10:24:33,818 INFO L497 ElimStorePlain]: treesize reduction 353, result has 32.8 percent of original size [2020-06-22 10:24:33,820 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-06-22 10:24:33,820 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:215, output treesize:141 [2020-06-22 10:25:39,178 WARN L188 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2020-06-22 10:25:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:25:49,606 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (and (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base))) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)))))) is different from true [2020-06-22 10:25:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:25:49,659 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:25:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:25:49,686 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:25:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:25:49,702 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:25:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:25:49,718 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:25:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:25:49,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 10:25:49,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:25:49,870 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 10:25:49,871 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 105 [2020-06-22 10:25:49,884 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,035 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-06-22 10:25:50,036 INFO L497 ElimStorePlain]: treesize reduction 95, result has 54.5 percent of original size [2020-06-22 10:25:50,036 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,037 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:113 [2020-06-22 10:25:50,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,295 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,296 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 87 [2020-06-22 10:25:50,300 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,440 INFO L340 Elim1Store]: treesize reduction 12, result has 89.6 percent of original size [2020-06-22 10:25:50,441 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 138 [2020-06-22 10:25:50,456 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,506 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 91 [2020-06-22 10:25:50,510 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,656 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-06-22 10:25:50,657 INFO L340 Elim1Store]: treesize reduction 12, result has 89.6 percent of original size [2020-06-22 10:25:50,657 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 138 [2020-06-22 10:25:50,672 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,726 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,727 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 82 [2020-06-22 10:25:50,729 INFO L427 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,757 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2020-06-22 10:25:50,757 INFO L427 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,824 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,824 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 92 [2020-06-22 10:25:50,825 INFO L427 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:25:50,883 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,883 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 82 [2020-06-22 10:25:50,885 INFO L427 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:50,933 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:25:50,934 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 87 [2020-06-22 10:25:50,938 INFO L427 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-06-22 10:25:51,317 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 72 [2020-06-22 10:25:51,317 INFO L497 ElimStorePlain]: treesize reduction 1191, result has 22.0 percent of original size [2020-06-22 10:25:51,320 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2020-06-22 10:25:51,320 INFO L217 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:401, output treesize:326 [2020-06-22 10:26:26,704 WARN L188 SmtUtils]: Spent 24.07 s on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2020-06-22 10:26:29,115 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2020-06-22 10:26:35,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 10:26:36,554 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset))) (or (<= .cse0 (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (exists ((v_prenex_8 Int)) (let ((.cse1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) v_prenex_8))) (and (or (= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) 1) .cse1) (and (= v_prenex_8 c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ .cse1 c_oldRank0))))) (<= 0 c_oldRank0) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (<= .cse0 (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0 1)))) is different from true [2020-06-22 10:26:37,687 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (<= (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (exists ((v_prenex_8 Int)) (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) v_prenex_8))) (and (or (= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) 1) .cse0) (and (= v_prenex_8 c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ .cse0 c_oldRank0))))) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset))))) is different from true [2020-06-22 10:26:38,847 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) (exists ((v_prenex_8 Int)) (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) v_prenex_8))) (and (or (= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) 1) .cse0) (and (= v_prenex_8 c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ .cse0 c_oldRank0))))) (<= 0 c_oldRank0) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset)))) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset))) is different from true [2020-06-22 10:26:40,099 WARN L860 $PredicateComparison]: unable to prove that (or (<= (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base) (exists ((v_prenex_8 Int)) (let ((.cse0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) v_prenex_8))) (and (or (= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) 1) .cse0) (and (= v_prenex_8 c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ .cse0 c_oldRank0))))) (exists ((v_prenex_4 Int)) (not (and (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base) (= v_prenex_4 c_ULTIMATE.start_test_fun_~z_ref~0.offset))))) is different from true [2020-06-22 10:26:40,226 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 10:26:40,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 10:26:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:41,802 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:26:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:26:41,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2020-06-22 10:26:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:26:41,920 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:26:41,921 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 [2020-06-22 10:26:41,927 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:41,994 INFO L497 ElimStorePlain]: treesize reduction 88, result has 37.6 percent of original size [2020-06-22 10:26:41,995 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:26:41,995 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 [2020-06-22 10:26:55,787 WARN L188 SmtUtils]: Spent 3.83 s on a formula simplification that was a NOOP. DAG size: 31 [2020-06-22 10:26:55,899 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 10:26:55,899 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 10:26:55,929 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:26:56,029 INFO L497 ElimStorePlain]: treesize reduction 154, result has 33.9 percent of original size [2020-06-22 10:26:56,030 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:26:56,030 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:79 [2020-06-22 10:26:57,145 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 10:26:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:26:57,230 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:26:57,230 INFO L98 LoopCannibalizer]: 17 predicates before loop cannibalization 63 predicates after loop cannibalization [2020-06-22 10:26:57,235 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 63 loop predicates [2020-06-22 10:26:57,236 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16 Second operand 14 states. [2020-06-22 10:26:58,873 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 15 [2020-06-22 10:26:59,453 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 20 [2020-06-22 10:27:00,701 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 23 [2020-06-22 10:27:01,000 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2020-06-22 10:27:02,407 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2020-06-22 10:27:02,725 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 39 [2020-06-22 10:27:03,056 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2020-06-22 10:27:03,423 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2020-06-22 10:27:03,787 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 43 [2020-06-22 10:27:04,035 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 21 [2020-06-22 10:27:04,370 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 23 [2020-06-22 10:27:07,379 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-06-22 10:27:07,681 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 34 [2020-06-22 10:27:08,010 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2020-06-22 10:27:10,392 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2020-06-22 10:27:10,682 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 36 [2020-06-22 10:27:12,017 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 38 [2020-06-22 10:27:14,769 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 35 [2020-06-22 10:27:16,280 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 37 [2020-06-22 10:27:18,909 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 34 [2020-06-22 10:27:21,859 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 46 [2020-06-22 10:27:22,134 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-06-22 10:27:23,746 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 48 [2020-06-22 10:27:24,046 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 [2020-06-22 10:27:24,582 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 49 [2020-06-22 10:27:25,169 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 31 [2020-06-22 10:27:25,779 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 33 [2020-06-22 10:27:26,116 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2020-06-22 10:27:26,464 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 38 [2020-06-22 10:27:26,487 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 35 transitions. cyclomatic complexity: 16. Second operand 14 states. Result 214 states and 232 transitions. Complement of second has 182 states. [2020-06-22 10:27:26,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 49 states 4 stem states 41 non-accepting loop states 4 accepting loop states [2020-06-22 10:27:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:27:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 143 transitions. [2020-06-22 10:27:26,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 143 transitions. Stem has 6 letters. Loop has 14 letters. [2020-06-22 10:27:26,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 143 transitions. Stem has 20 letters. Loop has 14 letters. [2020-06-22 10:27:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 143 transitions. Stem has 6 letters. Loop has 28 letters. [2020-06-22 10:27:26,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:26,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 232 transitions. [2020-06-22 10:27:26,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2020-06-22 10:27:26,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 92 states and 103 transitions. [2020-06-22 10:27:26,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-06-22 10:27:26,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-06-22 10:27:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 103 transitions. [2020-06-22 10:27:26,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:27:26,513 INFO L706 BuchiCegarLoop]: Abstraction has 92 states and 103 transitions. [2020-06-22 10:27:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 103 transitions. [2020-06-22 10:27:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 20. [2020-06-22 10:27:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 10:27:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-06-22 10:27:26,515 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 10:27:26,515 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-06-22 10:27:26,515 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:27:26,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-06-22 10:27:26,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 10:27:26,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:26,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:26,517 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:27:26,517 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:26,517 INFO L794 eck$LassoCheckResult]: Stem: 1105#ULTIMATE.startENTRY [102] 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] 1100#L-1 [173] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= (store (store (store (store |v_#length_5| |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_#t~malloc3.base_1| 4) |v_#length_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.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_#t~malloc1.base_1| 0) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_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|) (= 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|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet15_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_5|, #valid=|v_#valid_7|} 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_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_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~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_#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_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_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_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_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_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_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_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_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_test_fun_#t~mem12, 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~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_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short8, 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_main_#t~ret16, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1101#L11 [103] L11-->L11-1: Formula: (and (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (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_8|, #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_6|, 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_8|, #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_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1103#L11-1 [98] L11-1-->L12: 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_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, 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_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, 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] 1104#L12 [123] L12-->L13: Formula: (and (= 1 (select |v_#valid_12| 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|) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| 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_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, 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] 1108#L13 [134] L13-->L15-9: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_7|) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 1097#L15-9 [2020-06-22 10:27:26,518 INFO L796 eck$LassoCheckResult]: Loop: 1097#L15-9 [82] L15-9-->L15: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_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)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) 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_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_16|, #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_14|, 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~mem4] 1090#L15 [95] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~z_ref~0.base_6)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1091#L15-1 [215] L15-1-->L15-2: Formula: (and |v_ULTIMATE.start_test_fun_#t~short8_2| (< |v_ULTIMATE.start_test_fun_#t~mem5_3| |v_ULTIMATE.start_test_fun_#t~mem4_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1109#L15-2 [112] L15-2-->L15-3: Formula: |v_ULTIMATE.start_test_fun_#t~short8_3| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_3|} AuxVars[] AssignedVars[] 1107#L15-3 [109] L15-3-->L15-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_11| 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_~y_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, 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_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, 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~mem6] 1106#L15-4 [106] L15-4-->L15-5: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_22|, 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_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_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~mem7] 1102#L15-5 [229] L15-5-->L15-7: Formula: (and (< |v_ULTIMATE.start_test_fun_#t~mem7_3| |v_ULTIMATE.start_test_fun_#t~mem6_3|) |v_ULTIMATE.start_test_fun_#t~short8_4|) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} OutVars{ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short8] 1099#L15-7 [92] L15-7-->L16: Formula: |v_ULTIMATE.start_test_fun_#t~short8_9| InVars {ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short8=|v_ULTIMATE.start_test_fun_#t~short8_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7] 1094#L16 [118] L16-->L16-1: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1092#L16-1 [253] L16-1-->L17: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_38|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 1093#L17 [131] L17-->L17-1: Formula: (and (= (select (select |v_#memory_int_16| 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~mem10_2|) (= (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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_28|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|, 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} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1095#L17-1 [256] L17-1-->L18: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_29|) (= 1 (select |v_#valid_52| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1096#L18 [88] L18-->L18-1: Formula: (and (= (select |v_#valid_32| v_ULTIMATE.start_test_fun_~c~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_32|} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_19|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 1098#L18-1 [257] L18-1-->L15-9: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_42| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| 1))) |v_#memory_int_31|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_53| v_ULTIMATE.start_test_fun_~c~0.base_19) 1)) InVars {ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_32|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_31|, #length=|v_#length_42|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 1097#L15-9 [2020-06-22 10:27:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:26,519 INFO L82 PathProgramCache]: Analyzing trace with hash -324354482, now seen corresponding path program 1 times [2020-06-22 10:27:26,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:26,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:26,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:26,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -32277304, now seen corresponding path program 2 times [2020-06-22 10:27:26,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1494790229, now seen corresponding path program 1 times [2020-06-22 10:27:26,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:26,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:27:26,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:26,727 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 10:27:27,470 WARN L188 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-06-22 10:27:27,718 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-06-22 10:27:27,722 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:27:27,722 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:27:27,722 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:27:27,722 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:27:27,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:27:27,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:27:27,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:27:27,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:27:27,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:27:27,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:27:27,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:27:27,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:27,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:28,285 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-06-22 10:27:28,446 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-06-22 10:27:28,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:28,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:28,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:28,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:28,706 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-06-22 10:27:29,041 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:27:29,041 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:27:29,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:29,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:29,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:29,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:29,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:29,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:29,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:29,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:29,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:29,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:29,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:29,123 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:27:29,135 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:27:29,135 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 10:27:29,135 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:27:29,137 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:27:29,137 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:27:29,137 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2020-06-22 10:27:29,351 INFO L297 tatePredicateManager]: 40 out of 42 supporting invariants were superfluous and have been removed [2020-06-22 10:27:29,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:27:29,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:27:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:29,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 10:27:29,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:29,407 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:29,408 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2020-06-22 10:27:29,408 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:29,418 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:29,419 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:29,419 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:9 [2020-06-22 10:27:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:29,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2020-06-22 10:27:29,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:29,714 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 10:27:29,715 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 118 [2020-06-22 10:27:29,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:29,839 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2020-06-22 10:27:29,839 INFO L497 ElimStorePlain]: treesize reduction 156, result has 36.3 percent of original size [2020-06-22 10:27:29,840 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 10:27:29,840 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:79 [2020-06-22 10:27:44,925 WARN L188 SmtUtils]: Spent 5.04 s on a formula simplification that was a NOOP. DAG size: 43 [2020-06-22 10:27:50,019 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:50,020 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 75 [2020-06-22 10:27:50,021 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:50,034 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2020-06-22 10:27:50,034 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:50,042 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:50,042 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2020-06-22 10:27:50,042 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:50,084 INFO L497 ElimStorePlain]: treesize reduction 97, result has 27.6 percent of original size [2020-06-22 10:27:50,084 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:50,084 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:155, output treesize:34 [2020-06-22 10:27:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:55,364 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ c_oldRank0 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~z_ref~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset))) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (not (and (= ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)))))) is different from true [2020-06-22 10:27:56,912 WARN L860 $PredicateComparison]: unable to prove that (or (not (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset)) (not (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base)) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (not (and (= ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)))))) is different from true [2020-06-22 10:28:01,928 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (and (not (and (= ULTIMATE.start_test_fun_~x_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~z_ref~0.base))) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)))))) is different from true [2020-06-22 10:28:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:02,174 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:02,187 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:02,199 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:02,212 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:28:02,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 10:28:02,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:28:02,287 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:28:02,288 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 [2020-06-22 10:28:02,290 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:28:02,329 INFO L497 ElimStorePlain]: treesize reduction 47, result has 44.0 percent of original size [2020-06-22 10:28:02,330 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:28:02,330 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2020-06-22 10:28:02,481 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:28:02,482 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 91 [2020-06-22 10:28:02,487 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:28:02,494 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2020-06-22 10:28:02,495 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:28:02,586 INFO L497 ElimStorePlain]: treesize reduction 98, result has 47.0 percent of original size [2020-06-22 10:28:02,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-06-22 10:28:02,587 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:70 [2020-06-22 10:28:09,387 WARN L188 SmtUtils]: Spent 3.83 s on a formula simplification that was a NOOP. DAG size: 41 [2020-06-22 10:28:15,992 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 10:28:17,118 WARN L860 $PredicateComparison]: unable to prove that (or (<= 0 c_oldRank0) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 2) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 10:28:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:17,218 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:28:17,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2020-06-22 10:28:17,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:28:17,343 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:28:17,344 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 [2020-06-22 10:28:17,349 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:28:17,428 INFO L497 ElimStorePlain]: treesize reduction 96, result has 36.8 percent of original size [2020-06-22 10:28:17,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 10:28:17,430 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2020-06-22 10:28:32,365 WARN L188 SmtUtils]: Spent 3.85 s on a formula simplification that was a NOOP. DAG size: 33 [2020-06-22 10:28:38,503 INFO L340 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2020-06-22 10:28:38,503 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 115 [2020-06-22 10:28:38,523 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:28:38,611 INFO L497 ElimStorePlain]: treesize reduction 118, result has 47.6 percent of original size [2020-06-22 10:28:38,611 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 10:28:38,612 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:104 [2020-06-22 10:28:39,216 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-06-22 10:28:40,181 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~z_ref~0.offset) c_oldRank0)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= ULTIMATE.start_test_fun_~c~0.offset c_ULTIMATE.start_test_fun_~z_ref~0.offset) (= c_ULTIMATE.start_test_fun_~z_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true [2020-06-22 10:28:41,479 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-06-22 10:28:41,598 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-06-22 10:28:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:28:42,090 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:28:42,091 INFO L98 LoopCannibalizer]: 22 predicates before loop cannibalization 43 predicates after loop cannibalization [2020-06-22 10:28:42,091 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 43 loop predicates [2020-06-22 10:28:42,091 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 31 transitions. cyclomatic complexity: 12 Second operand 14 states. [2020-06-22 10:29:07,945 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 31 transitions. cyclomatic complexity: 12. Second operand 14 states. Result 46 states and 58 transitions. Complement of second has 38 states. [2020-06-22 10:29:07,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 2 stem states 17 non-accepting loop states 2 accepting loop states [2020-06-22 10:29:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:29:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2020-06-22 10:29:07,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 53 transitions. Stem has 6 letters. Loop has 14 letters. [2020-06-22 10:29:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:29:07,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 53 transitions. Stem has 20 letters. Loop has 14 letters. [2020-06-22 10:29:07,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:29:07,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 53 transitions. Stem has 6 letters. Loop has 28 letters. [2020-06-22 10:29:07,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:29:07,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2020-06-22 10:29:07,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:29:07,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2020-06-22 10:29:07,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:29:07,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:29:07,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:29:07,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:29:07,958 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:29:07,958 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:29:07,958 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:29:07,958 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:29:07,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:29:07,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:29:07,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:29:07,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:29:07 BasicIcfg [2020-06-22 10:29:07,965 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:29:07,965 INFO L168 Benchmark]: Toolchain (without parser) took 281826.86 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 559.6 MB in the beginning and 543.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 51.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,966 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:29:07,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.38 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 559.6 MB in the beginning and 648.1 MB in the end (delta: -88.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.15 ms. Allocated memory is still 685.2 MB. Free memory was 648.1 MB in the beginning and 646.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,967 INFO L168 Benchmark]: Boogie Preprocessor took 24.29 ms. Allocated memory is still 685.2 MB. Free memory was 646.0 MB in the beginning and 644.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,967 INFO L168 Benchmark]: RCFGBuilder took 402.00 ms. Allocated memory is still 685.2 MB. Free memory was 644.9 MB in the beginning and 616.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,968 INFO L168 Benchmark]: BlockEncodingV2 took 155.68 ms. Allocated memory is still 685.2 MB. Free memory was 616.2 MB in the beginning and 603.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,968 INFO L168 Benchmark]: TraceAbstraction took 2345.30 ms. Allocated memory was 685.2 MB in the beginning and 745.0 MB in the end (delta: 59.8 MB). Free memory was 602.2 MB in the beginning and 624.9 MB in the end (delta: -22.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,969 INFO L168 Benchmark]: BuchiAutomizer took 278529.82 ms. Allocated memory was 745.0 MB in the beginning and 685.8 MB in the end (delta: -59.2 MB). Free memory was 624.9 MB in the beginning and 543.9 MB in the end (delta: 81.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:29:07,972 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 59 locations, 61 edges - StatisticsResult: Encoded RCFG 51 locations, 99 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 316.38 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 559.6 MB in the beginning and 648.1 MB in the end (delta: -88.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 48.15 ms. Allocated memory is still 685.2 MB. Free memory was 648.1 MB in the beginning and 646.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.29 ms. Allocated memory is still 685.2 MB. Free memory was 646.0 MB in the beginning and 644.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 402.00 ms. Allocated memory is still 685.2 MB. Free memory was 644.9 MB in the beginning and 616.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 155.68 ms. Allocated memory is still 685.2 MB. Free memory was 616.2 MB in the beginning and 603.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2345.30 ms. Allocated memory was 685.2 MB in the beginning and 745.0 MB in the end (delta: 59.8 MB). Free memory was 602.2 MB in the beginning and 624.9 MB in the end (delta: -22.8 MB). Peak memory consumption was 37.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 278529.82 ms. Allocated memory was 745.0 MB in the beginning and 685.8 MB in the end (delta: -59.2 MB). Free memory was 624.9 MB in the beginning and 543.9 MB in the end (delta: 81.0 MB). Peak memory consumption was 21.8 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 #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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 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: 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: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 13]: 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 - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: 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: 18]: 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: 18]: 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: 17]: 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: 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 - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-06-22 10:29:07,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:29:07,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((\valid[z_ref] == 1 && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 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) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 30 error locations. SAFE Result, 2.2s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 502 SDslu, 7 SDs, 0 SdLazy, 623 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 49 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 21 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 278.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 5.7s. Construction of modules took 1.3s. Büchi inclusion checks took 271.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 73 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 93 SDtfs, 658 SDslu, 279 SDs, 0 SdLazy, 1415 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital571 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp38 div100 bol100 ite100 ukn100 eq187 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:24:22.886 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:29:08.209 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check