24.01/11.14 YES 24.01/11.14 24.01/11.14 Ultimate: Cannot open display: 24.01/11.14 This is Ultimate 0.1.24-8dc7c08-m 24.01/11.14 [2019-03-28 12:34:00,937 INFO L170 SettingsManager]: Resetting all preferences to default values... 24.01/11.14 [2019-03-28 12:34:00,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 24.01/11.14 [2019-03-28 12:34:00,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 24.01/11.14 [2019-03-28 12:34:00,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 24.01/11.14 [2019-03-28 12:34:00,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 24.01/11.14 [2019-03-28 12:34:00,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 24.01/11.14 [2019-03-28 12:34:00,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 24.01/11.14 [2019-03-28 12:34:00,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 24.01/11.14 [2019-03-28 12:34:00,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 24.01/11.14 [2019-03-28 12:34:00,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 24.01/11.14 [2019-03-28 12:34:00,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 24.01/11.14 [2019-03-28 12:34:00,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 24.01/11.14 [2019-03-28 12:34:00,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 24.01/11.14 [2019-03-28 12:34:00,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 24.01/11.14 [2019-03-28 12:34:00,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 24.01/11.14 [2019-03-28 12:34:00,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 24.01/11.14 [2019-03-28 12:34:00,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 24.01/11.14 [2019-03-28 12:34:00,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 24.01/11.14 [2019-03-28 12:34:00,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 24.01/11.14 [2019-03-28 12:34:00,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,971 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 24.01/11.14 [2019-03-28 12:34:00,972 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 24.01/11.14 [2019-03-28 12:34:00,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 24.01/11.14 [2019-03-28 12:34:00,974 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 24.01/11.14 [2019-03-28 12:34:00,975 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 24.01/11.14 [2019-03-28 12:34:00,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 24.01/11.14 [2019-03-28 12:34:00,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 24.01/11.14 [2019-03-28 12:34:00,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 24.01/11.14 [2019-03-28 12:34:00,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 24.01/11.14 [2019-03-28 12:34:00,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 24.01/11.14 [2019-03-28 12:34:00,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 24.01/11.14 [2019-03-28 12:34:00,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 24.01/11.14 [2019-03-28 12:34:00,980 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 24.01/11.14 [2019-03-28 12:34:00,995 INFO L110 SettingsManager]: Loading preferences was successful 24.01/11.14 [2019-03-28 12:34:00,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 24.01/11.14 [2019-03-28 12:34:00,996 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 24.01/11.14 [2019-03-28 12:34:00,996 INFO L133 SettingsManager]: * Rewrite not-equals=true 24.01/11.14 [2019-03-28 12:34:00,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 24.01/11.14 [2019-03-28 12:34:00,997 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 24.01/11.14 [2019-03-28 12:34:00,997 INFO L133 SettingsManager]: * Use SBE=true 24.01/11.14 [2019-03-28 12:34:00,997 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 24.01/11.14 [2019-03-28 12:34:00,997 INFO L133 SettingsManager]: * Use old map elimination=false 24.01/11.14 [2019-03-28 12:34:00,997 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 24.01/11.14 [2019-03-28 12:34:00,997 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 24.01/11.14 [2019-03-28 12:34:00,998 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 24.01/11.14 [2019-03-28 12:34:00,998 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 24.01/11.14 [2019-03-28 12:34:00,998 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 24.01/11.14 [2019-03-28 12:34:00,998 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.01/11.14 [2019-03-28 12:34:00,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 24.01/11.14 [2019-03-28 12:34:00,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 24.01/11.14 [2019-03-28 12:34:00,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE 24.01/11.14 [2019-03-28 12:34:00,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 24.01/11.14 [2019-03-28 12:34:00,999 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 24.01/11.14 [2019-03-28 12:34:00,999 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 24.01/11.14 [2019-03-28 12:34:00,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 24.01/11.14 [2019-03-28 12:34:01,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 24.01/11.14 [2019-03-28 12:34:01,000 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 24.01/11.14 [2019-03-28 12:34:01,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.01/11.14 [2019-03-28 12:34:01,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 24.01/11.14 [2019-03-28 12:34:01,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 24.01/11.14 [2019-03-28 12:34:01,001 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 24.01/11.14 [2019-03-28 12:34:01,001 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 24.01/11.14 [2019-03-28 12:34:01,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 24.01/11.14 [2019-03-28 12:34:01,039 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 24.01/11.14 [2019-03-28 12:34:01,043 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 24.01/11.14 [2019-03-28 12:34:01,044 INFO L271 PluginConnector]: Initializing CDTParser... 24.01/11.14 [2019-03-28 12:34:01,045 INFO L276 PluginConnector]: CDTParser initialized 24.01/11.14 [2019-03-28 12:34:01,045 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 24.01/11.14 [2019-03-28 12:34:01,101 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/64e95fd86c57462c85996a68d90d9dca/FLAGc63536baa 24.01/11.14 [2019-03-28 12:34:01,446 INFO L307 CDTParser]: Found 1 translation units. 24.01/11.14 [2019-03-28 12:34:01,447 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 24.01/11.14 [2019-03-28 12:34:01,447 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 24.01/11.14 [2019-03-28 12:34:01,454 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/64e95fd86c57462c85996a68d90d9dca/FLAGc63536baa 24.01/11.14 [2019-03-28 12:34:01,847 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/64e95fd86c57462c85996a68d90d9dca 24.01/11.14 [2019-03-28 12:34:01,859 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 24.01/11.14 [2019-03-28 12:34:01,860 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 24.01/11.14 [2019-03-28 12:34:01,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 24.01/11.14 [2019-03-28 12:34:01,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 24.01/11.14 [2019-03-28 12:34:01,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 24.01/11.14 [2019-03-28 12:34:01,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:01" (1/1) ... 24.01/11.14 [2019-03-28 12:34:01,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a48b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:01, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:01,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:01" (1/1) ... 24.01/11.14 [2019-03-28 12:34:01,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 24.01/11.14 [2019-03-28 12:34:01,897 INFO L176 MainTranslator]: Built tables and reachable declarations 24.01/11.14 [2019-03-28 12:34:02,065 INFO L206 PostProcessor]: Analyzing one entry point: main 24.01/11.14 [2019-03-28 12:34:02,079 INFO L191 MainTranslator]: Completed pre-run 24.01/11.14 [2019-03-28 12:34:02,157 INFO L206 PostProcessor]: Analyzing one entry point: main 24.01/11.14 [2019-03-28 12:34:02,173 INFO L195 MainTranslator]: Completed translation 24.01/11.14 [2019-03-28 12:34:02,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02 WrapperNode 24.01/11.14 [2019-03-28 12:34:02,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 24.01/11.14 [2019-03-28 12:34:02,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 24.01/11.14 [2019-03-28 12:34:02,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 24.01/11.14 [2019-03-28 12:34:02,175 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 24.01/11.14 [2019-03-28 12:34:02,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 24.01/11.14 [2019-03-28 12:34:02,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 24.01/11.14 [2019-03-28 12:34:02,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 24.01/11.14 [2019-03-28 12:34:02,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized 24.01/11.14 [2019-03-28 12:34:02,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 24.01/11.14 [2019-03-28 12:34:02,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 24.01/11.14 [2019-03-28 12:34:02,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... 24.01/11.14 [2019-03-28 12:34:02,243 INFO L276 PluginConnector]: RCFGBuilder initialized 24.01/11.14 [2019-03-28 12:34:02,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (1/1) ... 24.01/11.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.01/11.14 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 24.01/11.14 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.01/11.14 [2019-03-28 12:34:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 24.01/11.14 [2019-03-28 12:34:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 24.01/11.14 [2019-03-28 12:34:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 24.01/11.14 [2019-03-28 12:34:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 24.01/11.14 [2019-03-28 12:34:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 24.01/11.14 [2019-03-28 12:34:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 24.01/11.14 [2019-03-28 12:34:02,608 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 24.01/11.14 [2019-03-28 12:34:02,609 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 24.01/11.14 [2019-03-28 12:34:02,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:02 BoogieIcfgContainer 24.01/11.14 [2019-03-28 12:34:02,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 24.01/11.14 [2019-03-28 12:34:02,611 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 24.01/11.14 [2019-03-28 12:34:02,611 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 24.01/11.14 [2019-03-28 12:34:02,614 INFO L276 PluginConnector]: BlockEncodingV2 initialized 24.01/11.14 [2019-03-28 12:34:02,614 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:02" (1/1) ... 24.01/11.14 [2019-03-28 12:34:02,636 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 65 edges 24.01/11.14 [2019-03-28 12:34:02,638 INFO L258 BlockEncoder]: Using Remove infeasible edges 24.01/11.14 [2019-03-28 12:34:02,639 INFO L263 BlockEncoder]: Using Maximize final states 24.01/11.14 [2019-03-28 12:34:02,639 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 24.01/11.14 [2019-03-28 12:34:02,640 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 24.01/11.14 [2019-03-28 12:34:02,641 INFO L296 BlockEncoder]: Using Remove sink states 24.01/11.14 [2019-03-28 12:34:02,642 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 24.01/11.14 [2019-03-28 12:34:02,643 INFO L179 BlockEncoder]: Using Rewrite not-equals 24.01/11.14 [2019-03-28 12:34:02,671 INFO L185 BlockEncoder]: Using Use SBE 24.01/11.14 [2019-03-28 12:34:02,706 INFO L200 BlockEncoder]: SBE split 31 edges 24.01/11.14 [2019-03-28 12:34:02,711 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility 24.01/11.14 [2019-03-28 12:34:02,713 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.01/11.14 [2019-03-28 12:34:02,747 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 24.01/11.14 [2019-03-28 12:34:02,751 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 24.01/11.14 [2019-03-28 12:34:02,753 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 24.01/11.14 [2019-03-28 12:34:02,753 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.01/11.14 [2019-03-28 12:34:02,754 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 24.01/11.14 [2019-03-28 12:34:02,754 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 24.01/11.14 [2019-03-28 12:34:02,755 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 88 edges 24.01/11.14 [2019-03-28 12:34:02,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:02 BasicIcfg 24.01/11.14 [2019-03-28 12:34:02,755 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 24.01/11.14 [2019-03-28 12:34:02,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 24.01/11.14 [2019-03-28 12:34:02,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... 24.01/11.14 [2019-03-28 12:34:02,760 INFO L276 PluginConnector]: TraceAbstraction initialized 24.01/11.14 [2019-03-28 12:34:02,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:01" (1/4) ... 24.01/11.14 [2019-03-28 12:34:02,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ef25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:02, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:02,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (2/4) ... 24.01/11.14 [2019-03-28 12:34:02,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ef25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:02, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:02,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:02" (3/4) ... 24.01/11.14 [2019-03-28 12:34:02,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ef25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:02, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:02,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:02" (4/4) ... 24.01/11.14 [2019-03-28 12:34:02,764 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.01/11.14 [2019-03-28 12:34:02,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 24.01/11.14 [2019-03-28 12:34:02,783 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. 24.01/11.14 [2019-03-28 12:34:02,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. 24.01/11.14 [2019-03-28 12:34:02,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.01/11.14 [2019-03-28 12:34:02,830 INFO L382 AbstractCegarLoop]: Interprodecural is true 24.01/11.14 [2019-03-28 12:34:02,831 INFO L383 AbstractCegarLoop]: Hoare is true 24.01/11.14 [2019-03-28 12:34:02,831 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 24.01/11.14 [2019-03-28 12:34:02,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 24.01/11.14 [2019-03-28 12:34:02,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.01/11.14 [2019-03-28 12:34:02,831 INFO L387 AbstractCegarLoop]: Difference is false 24.01/11.14 [2019-03-28 12:34:02,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 24.01/11.14 [2019-03-28 12:34:02,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 24.01/11.14 [2019-03-28 12:34:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. 24.01/11.14 [2019-03-28 12:34:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 24.01/11.14 [2019-03-28 12:34:02,854 INFO L394 BasicCegarLoop]: Found error trace 24.01/11.14 [2019-03-28 12:34:02,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 24.01/11.14 [2019-03-28 12:34:02,855 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== 24.01/11.14 [2019-03-28 12:34:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 163082, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:02,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:02,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:02,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:03,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:03,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.01/11.14 [2019-03-28 12:34:03,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.01/11.14 [2019-03-28 12:34:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:03,077 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:03,259 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. 24.01/11.14 [2019-03-28 12:34:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 24.01/11.14 [2019-03-28 12:34:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.01/11.14 [2019-03-28 12:34:03,275 INFO L225 Difference]: With dead ends: 51 24.01/11.14 [2019-03-28 12:34:03,275 INFO L226 Difference]: Without dead ends: 44 24.01/11.14 [2019-03-28 12:34:03,279 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 24.01/11.14 [2019-03-28 12:34:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 24.01/11.14 [2019-03-28 12:34:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 24.01/11.14 [2019-03-28 12:34:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 24.01/11.14 [2019-03-28 12:34:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. 24.01/11.14 [2019-03-28 12:34:03,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 3 24.01/11.14 [2019-03-28 12:34:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. 24.01/11.14 [2019-03-28 12:34:03,323 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 74 transitions. 24.01/11.14 [2019-03-28 12:34:03,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 74 transitions. 24.01/11.14 [2019-03-28 12:34:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 24.01/11.14 [2019-03-28 12:34:03,323 INFO L394 BasicCegarLoop]: Found error trace 24.01/11.14 [2019-03-28 12:34:03,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== 24.01/11.14 [2019-03-28 12:34:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash 163079, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:03,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.01/11.14 [2019-03-28 12:34:03,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.01/11.14 [2019-03-28 12:34:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:03,355 INFO L87 Difference]: Start difference. First operand 44 states and 74 transitions. Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:03,472 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. 24.01/11.14 [2019-03-28 12:34:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 24.01/11.14 [2019-03-28 12:34:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.01/11.14 [2019-03-28 12:34:03,474 INFO L225 Difference]: With dead ends: 44 24.01/11.14 [2019-03-28 12:34:03,474 INFO L226 Difference]: Without dead ends: 37 24.01/11.14 [2019-03-28 12:34:03,475 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 24.01/11.14 [2019-03-28 12:34:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 24.01/11.14 [2019-03-28 12:34:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 24.01/11.14 [2019-03-28 12:34:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 24.01/11.14 [2019-03-28 12:34:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 60 transitions. 24.01/11.14 [2019-03-28 12:34:03,481 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 60 transitions. Word has length 3 24.01/11.14 [2019-03-28 12:34:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. 24.01/11.14 [2019-03-28 12:34:03,482 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 60 transitions. 24.01/11.14 [2019-03-28 12:34:03,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 60 transitions. 24.01/11.14 [2019-03-28 12:34:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 24.01/11.14 [2019-03-28 12:34:03,482 INFO L394 BasicCegarLoop]: Found error trace 24.01/11.14 [2019-03-28 12:34:03,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,483 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== 24.01/11.14 [2019-03-28 12:34:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 5053643, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:03,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:03,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:03,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:03,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:03,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.01/11.14 [2019-03-28 12:34:03,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.01/11.14 [2019-03-28 12:34:03,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:03,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:03,513 INFO L87 Difference]: Start difference. First operand 37 states and 60 transitions. Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:03,589 INFO L93 Difference]: Finished difference Result 37 states and 60 transitions. 24.01/11.14 [2019-03-28 12:34:03,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 24.01/11.14 [2019-03-28 12:34:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.01/11.14 [2019-03-28 12:34:03,591 INFO L225 Difference]: With dead ends: 37 24.01/11.14 [2019-03-28 12:34:03,591 INFO L226 Difference]: Without dead ends: 30 24.01/11.14 [2019-03-28 12:34:03,591 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 24.01/11.14 [2019-03-28 12:34:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 24.01/11.14 [2019-03-28 12:34:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 24.01/11.14 [2019-03-28 12:34:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 24.01/11.14 [2019-03-28 12:34:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. 24.01/11.14 [2019-03-28 12:34:03,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 4 24.01/11.14 [2019-03-28 12:34:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. 24.01/11.14 [2019-03-28 12:34:03,597 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. 24.01/11.14 [2019-03-28 12:34:03,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. 24.01/11.14 [2019-03-28 12:34:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 24.01/11.14 [2019-03-28 12:34:03,597 INFO L394 BasicCegarLoop]: Found error trace 24.01/11.14 [2019-03-28 12:34:03,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION]=== 24.01/11.14 [2019-03-28 12:34:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash 5053645, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:03,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:03,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:03,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:03,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.01/11.14 [2019-03-28 12:34:03,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.01/11.14 [2019-03-28 12:34:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:03,641 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:03,708 INFO L93 Difference]: Finished difference Result 30 states and 46 transitions. 24.01/11.14 [2019-03-28 12:34:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 24.01/11.14 [2019-03-28 12:34:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.01/11.14 [2019-03-28 12:34:03,709 INFO L225 Difference]: With dead ends: 30 24.01/11.14 [2019-03-28 12:34:03,709 INFO L226 Difference]: Without dead ends: 0 24.01/11.14 [2019-03-28 12:34:03,709 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 24.01/11.14 [2019-03-28 12:34:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 24.01/11.14 [2019-03-28 12:34:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 24.01/11.14 [2019-03-28 12:34:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 24.01/11.14 [2019-03-28 12:34:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:03,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 24.01/11.14 [2019-03-28 12:34:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. 24.01/11.14 [2019-03-28 12:34:03,711 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:03,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:03,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 24.01/11.14 [2019-03-28 12:34:03,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:03,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11-5(lines 11 21) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,788 INFO L448 ceAbstractionStarter]: For program point L11-7(lines 11 21) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 20) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,789 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,790 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 19) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,791 INFO L444 ceAbstractionStarter]: At program point L17-3(lines 17 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (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) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 24.01/11.14 [2019-03-28 12:34:03,791 INFO L444 ceAbstractionStarter]: At program point L17-4(lines 10 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (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) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 24.01/11.14 [2019-03-28 12:34:03,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,792 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,792 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (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) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 24.01/11.14 [2019-03-28 12:34:03,792 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,792 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,793 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,793 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,793 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,793 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,794 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 24.01/11.14 [2019-03-28 12:34:03,794 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 24.01/11.14 [2019-03-28 12:34:03,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,812 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,814 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,816 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.14 [2019-03-28 12:34:03,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:03 BasicIcfg 24.01/11.14 [2019-03-28 12:34:03,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 24.01/11.14 [2019-03-28 12:34:03,819 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 24.01/11.14 [2019-03-28 12:34:03,819 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 24.01/11.14 [2019-03-28 12:34:03,823 INFO L276 PluginConnector]: BuchiAutomizer initialized 24.01/11.14 [2019-03-28 12:34:03,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.01/11.14 [2019-03-28 12:34:03,824 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:01" (1/5) ... 24.01/11.14 [2019-03-28 12:34:03,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a717630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:03, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:03,826 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.01/11.14 [2019-03-28 12:34:03,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:02" (2/5) ... 24.01/11.14 [2019-03-28 12:34:03,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a717630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:03, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:03,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.01/11.14 [2019-03-28 12:34:03,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:02" (3/5) ... 24.01/11.14 [2019-03-28 12:34:03,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a717630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:03, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:03,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.01/11.14 [2019-03-28 12:34:03,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:02" (4/5) ... 24.01/11.14 [2019-03-28 12:34:03,828 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a717630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:03, skipping insertion in model container 24.01/11.14 [2019-03-28 12:34:03,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.01/11.14 [2019-03-28 12:34:03,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:03" (5/5) ... 24.01/11.14 [2019-03-28 12:34:03,830 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.01/11.14 [2019-03-28 12:34:03,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.01/11.14 [2019-03-28 12:34:03,853 INFO L374 BuchiCegarLoop]: Interprodecural is true 24.01/11.14 [2019-03-28 12:34:03,853 INFO L375 BuchiCegarLoop]: Hoare is true 24.01/11.14 [2019-03-28 12:34:03,853 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 24.01/11.14 [2019-03-28 12:34:03,853 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 24.01/11.14 [2019-03-28 12:34:03,853 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.01/11.14 [2019-03-28 12:34:03,854 INFO L379 BuchiCegarLoop]: Difference is false 24.01/11.14 [2019-03-28 12:34:03,854 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 24.01/11.14 [2019-03-28 12:34:03,854 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 24.01/11.14 [2019-03-28 12:34:03,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 24.01/11.14 [2019-03-28 12:34:03,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 24.01/11.14 [2019-03-28 12:34:03,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:03,866 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:03,871 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,871 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,871 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 24.01/11.14 [2019-03-28 12:34:03,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. 24.01/11.14 [2019-03-28 12:34:03,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 24.01/11.14 [2019-03-28 12:34:03,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:03,875 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:03,875 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,875 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:03,882 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [132] 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] 11#L-1true [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 34#L9true [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 33#L9-1true [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 51#L17-4true 24.01/11.14 [2019-03-28 12:34:03,883 INFO L796 eck$LassoCheckResult]: Loop: 51#L17-4true [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 25#L11true [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 22#L11-1true [130] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short4_5|) InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} AuxVars[] AssignedVars[] 4#L11-5true [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 39#L12true [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 37#L12-1true [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 36#L12-2true [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 52#L17-3true [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 43#L17-1true [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 51#L17-4true 24.01/11.14 [2019-03-28 12:34:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:03,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:03,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -482413291, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:03,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:03,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:03,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.01/11.14 [2019-03-28 12:34:03,945 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.01/11.14 [2019-03-28 12:34:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:03,947 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:04,090 INFO L93 Difference]: Finished difference Result 53 states and 90 transitions. 24.01/11.14 [2019-03-28 12:34:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:04,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 90 transitions. 24.01/11.14 [2019-03-28 12:34:04,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 24.01/11.14 [2019-03-28 12:34:04,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 23 states and 32 transitions. 24.01/11.14 [2019-03-28 12:34:04,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 24.01/11.14 [2019-03-28 12:34:04,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 24.01/11.14 [2019-03-28 12:34:04,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. 24.01/11.14 [2019-03-28 12:34:04,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:04,099 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. 24.01/11.14 [2019-03-28 12:34:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. 24.01/11.14 [2019-03-28 12:34:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. 24.01/11.14 [2019-03-28 12:34:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 24.01/11.14 [2019-03-28 12:34:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,103 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,103 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,103 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 24.01/11.14 [2019-03-28 12:34:04,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 24.01/11.14 [2019-03-28 12:34:04,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:04,104 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:04,105 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,105 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,106 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY [132] 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] 124#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 123#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 120#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 114#L17-4 24.01/11.14 [2019-03-28 12:34:04,106 INFO L796 eck$LassoCheckResult]: Loop: 114#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 130#L11 [222] L11-->L11-1: Formula: (and (>= 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|) (not |v_ULTIMATE.start_test_fun_#t~short4_2|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 131#L11-1 [130] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short4_5|) InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_5|} AuxVars[] AssignedVars[] 116#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 117#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 132#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 126#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 119#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 113#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 114#L17-4 24.01/11.14 [2019-03-28 12:34:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 2 times 24.01/11.14 [2019-03-28 12:34:04,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1260397044, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:04,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:04,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:04,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.01/11.14 [2019-03-28 12:34:04,142 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.01/11.14 [2019-03-28 12:34:04,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.01/11.14 [2019-03-28 12:34:04,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.01/11.14 [2019-03-28 12:34:04,143 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. 24.01/11.14 [2019-03-28 12:34:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:04,176 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. 24.01/11.14 [2019-03-28 12:34:04,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.01/11.14 [2019-03-28 12:34:04,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. 24.01/11.14 [2019-03-28 12:34:04,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 24.01/11.14 [2019-03-28 12:34:04,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 24.01/11.14 [2019-03-28 12:34:04,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 24.01/11.14 [2019-03-28 12:34:04,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:04,179 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 24.01/11.14 [2019-03-28 12:34:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 24.01/11.14 [2019-03-28 12:34:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,182 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,182 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,182 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 24.01/11.14 [2019-03-28 12:34:04,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. 24.01/11.14 [2019-03-28 12:34:04,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 24.01/11.14 [2019-03-28 12:34:04,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:04,183 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:04,184 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,184 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,184 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY [132] 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] 175#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 173#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 171#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 165#L17-4 24.01/11.14 [2019-03-28 12:34:04,185 INFO L796 eck$LassoCheckResult]: Loop: 165#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 181#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 176#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 174#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 172#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 167#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 168#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 182#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 177#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 178#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 179#L13-1 [191] L13-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 165#L17-4 24.01/11.14 [2019-03-28 12:34:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,185 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 3 times 24.01/11.14 [2019-03-28 12:34:04,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1733772375, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:04,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:04,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.01/11.14 [2019-03-28 12:34:04,244 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.01/11.14 [2019-03-28 12:34:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 24.01/11.14 [2019-03-28 12:34:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 24.01/11.14 [2019-03-28 12:34:04,244 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. 24.01/11.14 [2019-03-28 12:34:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:04,339 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 24.01/11.14 [2019-03-28 12:34:04,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 24.01/11.14 [2019-03-28 12:34:04,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 24.01/11.14 [2019-03-28 12:34:04,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 24.01/11.14 [2019-03-28 12:34:04,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:04,342 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. 24.01/11.14 [2019-03-28 12:34:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. 24.01/11.14 [2019-03-28 12:34:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 24.01/11.14 [2019-03-28 12:34:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. 24.01/11.14 [2019-03-28 12:34:04,344 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. 24.01/11.14 [2019-03-28 12:34:04,344 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. 24.01/11.14 [2019-03-28 12:34:04,345 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 24.01/11.14 [2019-03-28 12:34:04,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. 24.01/11.14 [2019-03-28 12:34:04,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 24.01/11.14 [2019-03-28 12:34:04,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:04,346 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:04,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,346 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,347 INFO L794 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY [132] 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] 239#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 237#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 235#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 229#L17-4 24.01/11.14 [2019-03-28 12:34:04,348 INFO L796 eck$LassoCheckResult]: Loop: 229#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 245#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 240#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 238#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 236#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 231#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 232#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 246#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 241#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 234#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 228#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 229#L17-4 24.01/11.14 [2019-03-28 12:34:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 4 times 24.01/11.14 [2019-03-28 12:34:04,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1733730741, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:04,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:04,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:04,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 24.01/11.14 [2019-03-28 12:34:04,402 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.01/11.14 [2019-03-28 12:34:04,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 24.01/11.14 [2019-03-28 12:34:04,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 24.01/11.14 [2019-03-28 12:34:04,403 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 7 Second operand 5 states. 24.01/11.14 [2019-03-28 12:34:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:04,487 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 24.01/11.14 [2019-03-28 12:34:04,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 24.01/11.14 [2019-03-28 12:34:04,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 24.01/11.14 [2019-03-28 12:34:04,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 24.01/11.14 [2019-03-28 12:34:04,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:04,490 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. 24.01/11.14 [2019-03-28 12:34:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. 24.01/11.14 [2019-03-28 12:34:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 24.01/11.14 [2019-03-28 12:34:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,492 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,493 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,493 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 24.01/11.14 [2019-03-28 12:34:04,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. 24.01/11.14 [2019-03-28 12:34:04,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 24.01/11.14 [2019-03-28 12:34:04,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:04,494 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:04,494 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,494 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:04,495 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY [132] 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] 303#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 301#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 298#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 299#L17-4 24.01/11.14 [2019-03-28 12:34:04,496 INFO L796 eck$LassoCheckResult]: Loop: 299#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 310#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 304#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 302#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 300#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 294#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 295#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 311#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 305#L12-2 [186] L12-2-->L17-3: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem6_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 306#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 292#L17-1 [152] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem9_6|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 293#L18 [108] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (select |v_#valid_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_14| 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_2|)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_24|, 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, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_14|, #length=|v_#length_24|, 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] 296#L18-1 [270] L18-1-->L17-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_21 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~y_ref~0.base_28)) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_28 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_28) v_ULTIMATE.start_test_fun_~y_ref~0.offset_21 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| (- 1)))) |v_#memory_int_25|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_21) (= 1 (select |v_#valid_46| v_ULTIMATE.start_test_fun_~y_ref~0.base_28))) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_28, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_21} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_28, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_21} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 297#L17-3 [164] L17-3-->L17-1: Formula: (and (= 1 (select |v_#valid_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_24|} OutVars{#valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, #length=|v_#length_22|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 315#L17-1 [192] L17-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem9_4|) InVars {ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_4|} OutVars{ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 299#L17-4 24.01/11.14 [2019-03-28 12:34:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 5056454, now seen corresponding path program 5 times 24.01/11.14 [2019-03-28 12:34:04,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1257027297, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:04,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash -720606084, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:04,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:04,722 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 24.01/11.14 [2019-03-28 12:34:04,938 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 24.01/11.14 [2019-03-28 12:34:05,041 INFO L216 LassoAnalysis]: Preferences: 24.01/11.14 [2019-03-28 12:34:05,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.01/11.14 [2019-03-28 12:34:05,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.01/11.14 [2019-03-28 12:34:05,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.01/11.14 [2019-03-28 12:34:05,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.01/11.14 [2019-03-28 12:34:05,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.01/11.14 [2019-03-28 12:34:05,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.01/11.14 [2019-03-28 12:34:05,043 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.01/11.14 [2019-03-28 12:34:05,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 24.01/11.14 [2019-03-28 12:34:05,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.01/11.14 [2019-03-28 12:34:05,043 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.01/11.14 [2019-03-28 12:34:05,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,260 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 24.01/11.14 [2019-03-28 12:34:05,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:05,653 INFO L300 LassoAnalysis]: Preprocessing complete. 24.01/11.14 [2019-03-28 12:34:05,658 INFO L497 LassoAnalysis]: Using template 'affine'. 24.01/11.14 [2019-03-28 12:34:05,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:05,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:05,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:05,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:05,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:05,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:05,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:05,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:05,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:05,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.01/11.14 [2019-03-28 12:34:05,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 24.01/11.14 [2019-03-28 12:34:05,804 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 24.01/11.14 [2019-03-28 12:34:05,806 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.01/11.14 [2019-03-28 12:34:05,808 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 24.01/11.14 [2019-03-28 12:34:05,809 INFO L518 LassoAnalysis]: Proved termination. 24.01/11.14 [2019-03-28 12:34:05,809 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.01/11.14 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)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 24.01/11.14 Supporting invariants [] 24.01/11.14 [2019-03-28 12:34:05,842 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 24.01/11.14 [2019-03-28 12:34:05,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.01/11.14 [2019-03-28 12:34:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:05,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:05,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:05,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:05,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:05,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 24.01/11.14 [2019-03-28 12:34:05,930 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:05,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:05,933 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:05,933 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 24.01/11.14 [2019-03-28 12:34:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:05,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:05,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:05,985 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 24.01/11.14 [2019-03-28 12:34:05,986 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:05,987 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:05,988 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:05,988 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 24.01/11.14 [2019-03-28 12:34:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,044 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 24.01/11.14 [2019-03-28 12:34:06,044 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,046 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,047 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 24.01/11.14 [2019-03-28 12:34:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,120 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 24.01/11.14 [2019-03-28 12:34:06,121 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,122 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,122 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,122 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 24.01/11.14 [2019-03-28 12:34:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,147 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 24.01/11.14 [2019-03-28 12:34:06,147 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,150 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,150 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,150 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 24.01/11.14 [2019-03-28 12:34:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,174 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 24.01/11.14 [2019-03-28 12:34:06,175 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,176 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,176 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,176 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:1 24.01/11.14 [2019-03-28 12:34:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,231 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 24.01/11.14 [2019-03-28 12:34:06,232 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,236 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,237 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,237 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 24.01/11.14 [2019-03-28 12:34:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:06,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:06,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:06,366 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 35 treesize of output 19 24.01/11.14 [2019-03-28 12:34:06,367 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,373 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.01/11.14 [2019-03-28 12:34:06,373 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.01/11.14 [2019-03-28 12:34:06,374 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 24.01/11.14 [2019-03-28 12:34:06,496 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 13 predicates after loop cannibalization 24.01/11.14 [2019-03-28 12:34:06,500 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates 24.01/11.14 [2019-03-28 12:34:06,500 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 31 transitions. cyclomatic complexity: 7 Second operand 6 states. 24.01/11.14 [2019-03-28 12:34:07,182 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 31 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 127 states and 142 transitions. Complement of second has 42 states. 24.01/11.14 [2019-03-28 12:34:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 1 stem states 19 non-accepting loop states 2 accepting loop states 24.01/11.14 [2019-03-28 12:34:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 24.01/11.14 [2019-03-28 12:34:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. 24.01/11.14 [2019-03-28 12:34:07,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 4 letters. Loop has 15 letters. 24.01/11.14 [2019-03-28 12:34:07,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:07,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 19 letters. Loop has 15 letters. 24.01/11.14 [2019-03-28 12:34:07,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:07,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 105 transitions. Stem has 4 letters. Loop has 30 letters. 24.01/11.14 [2019-03-28 12:34:07,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:07,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 142 transitions. 24.01/11.14 [2019-03-28 12:34:07,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 24.01/11.14 [2019-03-28 12:34:07,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 42 states and 47 transitions. 24.01/11.14 [2019-03-28 12:34:07,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 24.01/11.14 [2019-03-28 12:34:07,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 24.01/11.14 [2019-03-28 12:34:07,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 47 transitions. 24.01/11.14 [2019-03-28 12:34:07,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:07,204 INFO L706 BuchiCegarLoop]: Abstraction has 42 states and 47 transitions. 24.01/11.14 [2019-03-28 12:34:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 47 transitions. 24.01/11.14 [2019-03-28 12:34:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. 24.01/11.14 [2019-03-28 12:34:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 24.01/11.14 [2019-03-28 12:34:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. 24.01/11.14 [2019-03-28 12:34:07,207 INFO L729 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. 24.01/11.14 [2019-03-28 12:34:07,207 INFO L609 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. 24.01/11.14 [2019-03-28 12:34:07,207 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 24.01/11.14 [2019-03-28 12:34:07,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. 24.01/11.14 [2019-03-28 12:34:07,208 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 24.01/11.14 [2019-03-28 12:34:07,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:07,208 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:07,209 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:07,209 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:07,210 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY [132] 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] 961#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 960#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 957#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 958#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 969#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 970#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 959#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 956#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 952#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 953#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 968#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 962#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 963#L13-3 24.01/11.14 [2019-03-28 12:34:07,210 INFO L796 eck$LassoCheckResult]: Loop: 963#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 964#L13-1 [158] L13-1-->L14: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 971#L14 [122] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (= (select |v_#valid_20| 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_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 974#L14-1 [269] L14-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_17) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24) v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_23|)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 975#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 976#L13-1 [191] L13-1-->L17-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 972#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 973#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 965#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 966#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 981#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 980#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 979#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 978#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 977#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 963#L13-3 24.01/11.14 [2019-03-28 12:34:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -208621793, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:07,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1222541880, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:07,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.01/11.14 [2019-03-28 12:34:07,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 24.01/11.14 [2019-03-28 12:34:07,266 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.01/11.14 [2019-03-28 12:34:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 24.01/11.14 [2019-03-28 12:34:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 24.01/11.14 [2019-03-28 12:34:07,266 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 7 Second operand 5 states. 24.01/11.14 [2019-03-28 12:34:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.01/11.14 [2019-03-28 12:34:07,344 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. 24.01/11.14 [2019-03-28 12:34:07,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 24.01/11.14 [2019-03-28 12:34:07,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. 24.01/11.14 [2019-03-28 12:34:07,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 24.01/11.14 [2019-03-28 12:34:07,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. 24.01/11.14 [2019-03-28 12:34:07,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 24.01/11.14 [2019-03-28 12:34:07,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 24.01/11.14 [2019-03-28 12:34:07,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. 24.01/11.14 [2019-03-28 12:34:07,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:07,352 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. 24.01/11.14 [2019-03-28 12:34:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. 24.01/11.14 [2019-03-28 12:34:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. 24.01/11.14 [2019-03-28 12:34:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 24.01/11.14 [2019-03-28 12:34:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. 24.01/11.14 [2019-03-28 12:34:07,354 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 24.01/11.14 [2019-03-28 12:34:07,354 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. 24.01/11.14 [2019-03-28 12:34:07,354 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 24.01/11.14 [2019-03-28 12:34:07,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. 24.01/11.14 [2019-03-28 12:34:07,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 24.01/11.14 [2019-03-28 12:34:07,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.01/11.14 [2019-03-28 12:34:07,355 INFO L119 BuchiIsEmpty]: Starting construction of run 24.01/11.14 [2019-03-28 12:34:07,355 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:07,355 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.01/11.14 [2019-03-28 12:34:07,356 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY [132] 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] 1020#L-1 [204] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_5| |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_~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_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_#length_1| (store (store |v_#length_3| |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_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_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|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} 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~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_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_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret15=|v_ULTIMATE.start_main_#t~ret15_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_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~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~short4, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_main_#t~ret15, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 1018#L9 [140] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| 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|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #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_4|, 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_6|, #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_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1015#L9-1 [137] L9-1-->L17-4: 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_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, 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_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, 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] 1016#L17-4 [160] L17-4-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| 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_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, 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~mem2] 1026#L11 [221] L11-->L11-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short4_2| (< 0 |v_ULTIMATE.start_test_fun_#t~mem2_3|)) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 1021#L11-1 [129] L11-1-->L11-2: Formula: |v_ULTIMATE.start_test_fun_#t~short4_3| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} OutVars{ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_3|} AuxVars[] AssignedVars[] 1019#L11-2 [112] L11-2-->L11-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_6| 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_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, 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_12|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1017#L11-3 [231] L11-3-->L11-5: Formula: (and (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short4_4|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short4] 1013#L11-5 [104] L11-5-->L12: Formula: |v_ULTIMATE.start_test_fun_#t~short4_9| InVars {ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_9|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|, ULTIMATE.start_test_fun_#t~short4=|v_ULTIMATE.start_test_fun_#t~short4_8|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short4] 1014#L12 [148] L12-->L12-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 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_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1027#L12-1 [145] L12-1-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| 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~mem6_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, 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_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, 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_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 1022#L12-2 [143] L12-2-->L13-3: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem6_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_4|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 1023#L13-3 24.01/11.14 [2019-03-28 12:34:07,356 INFO L796 eck$LassoCheckResult]: Loop: 1023#L13-3 [154] L13-3-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1024#L13-1 [158] L13-1-->L14: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1028#L14 [122] L14-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (= (select |v_#valid_20| 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_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_20|} OutVars{#valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_18|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1029#L14-1 [269] L14-1-->L13-3: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 4) (select |v_#length_36| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_17) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~x_ref~0.base_24)) (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~x_ref~0.base_24) v_ULTIMATE.start_test_fun_~x_ref~0.offset_17 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_23|)) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_24|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_17, #length=|v_#length_36|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_24} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 1023#L13-3 24.01/11.14 [2019-03-28 12:34:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -208621793, now seen corresponding path program 2 times 24.01/11.14 [2019-03-28 12:34:07,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:07,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:07,376 INFO L82 PathProgramCache]: Analyzing trace with hash 5667224, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:07,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:07,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1335781814, now seen corresponding path program 1 times 24.01/11.14 [2019-03-28 12:34:07,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.01/11.14 [2019-03-28 12:34:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.01/11.14 [2019-03-28 12:34:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.01/11.14 [2019-03-28 12:34:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:07,689 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 24.01/11.14 [2019-03-28 12:34:07,768 INFO L216 LassoAnalysis]: Preferences: 24.01/11.14 [2019-03-28 12:34:07,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.01/11.14 [2019-03-28 12:34:07,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.01/11.14 [2019-03-28 12:34:07,768 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.01/11.14 [2019-03-28 12:34:07,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.01/11.14 [2019-03-28 12:34:07,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.01/11.14 [2019-03-28 12:34:07,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.01/11.14 [2019-03-28 12:34:07,769 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.01/11.14 [2019-03-28 12:34:07,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 24.01/11.14 [2019-03-28 12:34:07,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.01/11.14 [2019-03-28 12:34:07,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.01/11.14 [2019-03-28 12:34:07,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,945 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 24.01/11.14 [2019-03-28 12:34:07,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:07,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.01/11.14 [2019-03-28 12:34:08,220 INFO L300 LassoAnalysis]: Preprocessing complete. 24.01/11.14 [2019-03-28 12:34:08,221 INFO L497 LassoAnalysis]: Using template 'affine'. 24.01/11.14 [2019-03-28 12:34:08,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.01/11.14 [2019-03-28 12:34:08,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.01/11.14 [2019-03-28 12:34:08,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.01/11.14 Termination analysis: LINEAR_WITH_GUESSES 24.01/11.14 Number of strict supporting invariants: 0 24.01/11.14 Number of non-strict supporting invariants: 1 24.01/11.14 Consider only non-deceasing supporting invariants: true 24.01/11.14 Simplify termination arguments: true 24.01/11.14 Simplify supporting invariants: trueOverapproximate stem: false 24.01/11.14 [2019-03-28 12:34:08,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.01/11.14 [2019-03-28 12:34:08,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.01/11.14 [2019-03-28 12:34:08,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.01/11.14 [2019-03-28 12:34:08,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.01/11.14 [2019-03-28 12:34:08,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.01/11.14 [2019-03-28 12:34:08,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.01/11.14 [2019-03-28 12:34:08,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.01/11.14 [2019-03-28 12:34:08,295 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 24.01/11.14 [2019-03-28 12:34:08,295 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 24.01/11.14 [2019-03-28 12:34:08,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.01/11.14 [2019-03-28 12:34:08,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 24.01/11.14 [2019-03-28 12:34:08,297 INFO L518 LassoAnalysis]: Proved termination. 24.01/11.14 [2019-03-28 12:34:08,297 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.01/11.14 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 24.01/11.14 Supporting invariants [] 24.01/11.14 [2019-03-28 12:34:08,314 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed 24.01/11.14 [2019-03-28 12:34:08,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.01/11.14 [2019-03-28 12:34:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.01/11.14 [2019-03-28 12:34:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:08,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:08,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.01/11.14 [2019-03-28 12:34:08,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core 24.01/11.14 [2019-03-28 12:34:08,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.01/11.14 [2019-03-28 12:34:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.01/11.14 [2019-03-28 12:34:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.01/11.14 [2019-03-28 12:34:08,433 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 24.01/11.14 [2019-03-28 12:34:08,433 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 24.01/11.14 [2019-03-28 12:34:08,434 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates 24.01/11.14 [2019-03-28 12:34:08,434 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 5 states. 24.01/11.14 [2019-03-28 12:34:08,460 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 21 states and 25 transitions. Complement of second has 8 states. 24.01/11.14 [2019-03-28 12:34:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 24.01/11.14 [2019-03-28 12:34:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 24.01/11.14 [2019-03-28 12:34:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. 24.01/11.14 [2019-03-28 12:34:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. 24.01/11.14 [2019-03-28 12:34:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 17 letters. Loop has 4 letters. 24.01/11.14 [2019-03-28 12:34:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 8 letters. 24.01/11.14 [2019-03-28 12:34:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.01/11.14 [2019-03-28 12:34:08,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. 24.01/11.14 [2019-03-28 12:34:08,467 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.01/11.14 [2019-03-28 12:34:08,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 24.01/11.14 [2019-03-28 12:34:08,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 24.01/11.14 [2019-03-28 12:34:08,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,468 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 24.01/11.14 [2019-03-28 12:34:08,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 24.01/11.14 [2019-03-28 12:34:08,469 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.01/11.14 [2019-03-28 12:34:08,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 24.01/11.14 [2019-03-28 12:34:08,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:08 BasicIcfg 24.01/11.14 [2019-03-28 12:34:08,476 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 24.01/11.14 [2019-03-28 12:34:08,490 INFO L168 Benchmark]: Toolchain (without parser) took 6630.53 ms. Allocated memory was 649.6 MB in the beginning and 858.8 MB in the end (delta: 209.2 MB). Free memory was 558.5 MB in the beginning and 779.5 MB in the end (delta: -221.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 24.01/11.14 [2019-03-28 12:34:08,491 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.11 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.5 MB in the beginning and 638.4 MB in the end (delta: -79.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 673.2 MB. Free memory was 638.4 MB in the beginning and 635.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,492 INFO L168 Benchmark]: Boogie Preprocessor took 25.13 ms. Allocated memory is still 673.2 MB. Free memory was 635.2 MB in the beginning and 633.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,493 INFO L168 Benchmark]: RCFGBuilder took 368.33 ms. Allocated memory is still 673.2 MB. Free memory was 633.8 MB in the beginning and 607.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,493 INFO L168 Benchmark]: BlockEncodingV2 took 144.37 ms. Allocated memory is still 673.2 MB. Free memory was 607.3 MB in the beginning and 595.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,494 INFO L168 Benchmark]: TraceAbstraction took 1062.22 ms. Allocated memory is still 673.2 MB. Free memory was 595.2 MB in the beginning and 487.6 MB in the end (delta: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,494 INFO L168 Benchmark]: BuchiAutomizer took 4670.25 ms. Allocated memory was 673.2 MB in the beginning and 858.8 MB in the end (delta: 185.6 MB). Free memory was 486.2 MB in the beginning and 779.5 MB in the end (delta: -293.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 24.01/11.15 [2019-03-28 12:34:08,499 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 24.01/11.15 --- Results --- 24.01/11.15 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 24.01/11.15 - StatisticsResult: Initial Icfg 24.01/11.15 58 locations, 65 edges 24.01/11.15 - StatisticsResult: Encoded RCFG 24.01/11.15 51 locations, 88 edges 24.01/11.15 * Results from de.uni_freiburg.informatik.ultimate.core: 24.01/11.15 - StatisticsResult: Toolchain Benchmarks 24.01/11.15 Benchmark results are: 24.01/11.15 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.01/11.15 * CACSL2BoogieTranslator took 313.11 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 558.5 MB in the beginning and 638.4 MB in the end (delta: -79.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 24.01/11.15 * Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 673.2 MB. Free memory was 638.4 MB in the beginning and 635.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 24.01/11.15 * Boogie Preprocessor took 25.13 ms. Allocated memory is still 673.2 MB. Free memory was 635.2 MB in the beginning and 633.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 24.01/11.15 * RCFGBuilder took 368.33 ms. Allocated memory is still 673.2 MB. Free memory was 633.8 MB in the beginning and 607.3 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. 24.01/11.15 * BlockEncodingV2 took 144.37 ms. Allocated memory is still 673.2 MB. Free memory was 607.3 MB in the beginning and 595.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 24.01/11.15 * TraceAbstraction took 1062.22 ms. Allocated memory is still 673.2 MB. Free memory was 595.2 MB in the beginning and 487.6 MB in the end (delta: 107.6 MB). Peak memory consumption was 107.6 MB. Max. memory is 50.3 GB. 24.01/11.15 * BuchiAutomizer took 4670.25 ms. Allocated memory was 673.2 MB in the beginning and 858.8 MB in the end (delta: 185.6 MB). Free memory was 486.2 MB in the beginning and 779.5 MB in the end (delta: -293.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 24.01/11.15 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #length 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #memory_int 24.01/11.15 - GenericResult: Unfinished Backtranslation 24.01/11.15 unknown boogie variable #memory_int 24.01/11.15 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 24.01/11.15 - PositiveResult [Line: 12]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 13]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 12]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 12]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 11]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 12]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 14]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 14]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 14]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 14]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 13]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 18]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 9]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 9]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 18]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 17]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 18]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 17]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 11]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 22]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 11]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 22]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 10]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 11]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 22]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 10]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 18]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - PositiveResult [Line: 22]: pointer dereference always succeeds 24.01/11.15 For all program executions holds that pointer dereference always succeeds at this location 24.01/11.15 - AllSpecificationsHoldResult: All specifications hold 24.01/11.15 28 specifications checked. All of them hold 24.01/11.15 - InvariantResult [Line: 13]: Loop Invariant 24.01/11.15 [2019-03-28 12:34:08,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 24.01/11.15 - InvariantResult [Line: 10]: Loop Invariant 24.01/11.15 [2019-03-28 12:34:08,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 24.01/11.15 - InvariantResult [Line: 17]: Loop Invariant 24.01/11.15 [2019-03-28 12:34:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 [2019-03-28 12:34:08,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.01/11.15 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 24.01/11.15 - StatisticsResult: Ultimate Automizer benchmark data 24.01/11.15 CFG has 1 procedures, 51 locations, 28 error locations. SAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 190 SDslu, 2 SDs, 0 SdLazy, 182 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 81 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 24.01/11.15 - StatisticsResult: Constructed decomposition of program 24.01/11.15 Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 23 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. 24.01/11.15 - StatisticsResult: Timing statistics 24.01/11.15 BüchiAutomizer plugin needed 4.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 32 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 108 SDtfs, 150 SDslu, 285 SDs, 0 SdLazy, 657 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital188 mio100 ax100 hnf100 lsp96 ukn68 mio100 lsp35 div100 bol100 ite100 ukn100 eq181 hnf89 smp98 dnf100 smp100 tf100 neg100 sie104 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 24.01/11.15 - TerminationAnalysisResult: Termination proven 24.01/11.15 Buchi Automizer proved that your program is terminating 24.01/11.15 RESULT: Ultimate proved your program to be correct! 24.01/11.15 !SESSION 2019-03-28 12:33:58.595 ----------------------------------------------- 24.01/11.15 eclipse.buildId=unknown 24.01/11.15 java.version=1.8.0_181 24.01/11.15 java.vendor=Oracle Corporation 24.01/11.15 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 24.01/11.15 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 24.01/11.15 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 24.01/11.15 24.01/11.15 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:34:08.739 24.01/11.15 !MESSAGE The workspace will exit with unsaved changes in this session. 24.01/11.15 Received shutdown request... 24.01/11.15 Ultimate: 24.01/11.15 GTK+ Version Check 24.01/11.15 EOF