31.15/14.16 YES 31.15/14.16 31.15/14.16 Ultimate: Cannot open display: 31.15/14.16 This is Ultimate 0.1.24-8dc7c08-m 31.15/14.16 [2019-03-28 12:46:30,905 INFO L170 SettingsManager]: Resetting all preferences to default values... 31.15/14.16 [2019-03-28 12:46:30,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 31.15/14.16 [2019-03-28 12:46:30,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,920 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 31.15/14.16 [2019-03-28 12:46:30,921 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 31.15/14.16 [2019-03-28 12:46:30,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 31.15/14.16 [2019-03-28 12:46:30,924 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 31.15/14.16 [2019-03-28 12:46:30,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 31.15/14.16 [2019-03-28 12:46:30,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 31.15/14.16 [2019-03-28 12:46:30,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 31.15/14.16 [2019-03-28 12:46:30,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 31.15/14.16 [2019-03-28 12:46:30,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 31.15/14.16 [2019-03-28 12:46:30,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 31.15/14.16 [2019-03-28 12:46:30,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 31.15/14.16 [2019-03-28 12:46:30,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 31.15/14.16 [2019-03-28 12:46:30,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 31.15/14.16 [2019-03-28 12:46:30,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 31.15/14.16 [2019-03-28 12:46:30,936 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 31.15/14.16 [2019-03-28 12:46:30,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 31.15/14.16 [2019-03-28 12:46:30,938 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 31.15/14.16 [2019-03-28 12:46:30,940 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 31.15/14.16 [2019-03-28 12:46:30,941 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 31.15/14.16 [2019-03-28 12:46:30,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 31.15/14.16 [2019-03-28 12:46:30,943 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 31.15/14.16 [2019-03-28 12:46:30,944 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 31.15/14.16 [2019-03-28 12:46:30,944 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 31.15/14.16 [2019-03-28 12:46:30,945 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 31.15/14.16 [2019-03-28 12:46:30,946 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 31.15/14.16 [2019-03-28 12:46:30,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 31.15/14.16 [2019-03-28 12:46:30,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 31.15/14.16 [2019-03-28 12:46:30,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 31.15/14.16 [2019-03-28 12:46:30,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 31.15/14.16 [2019-03-28 12:46:30,949 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 31.15/14.16 [2019-03-28 12:46:30,964 INFO L110 SettingsManager]: Loading preferences was successful 31.15/14.16 [2019-03-28 12:46:30,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 31.15/14.16 [2019-03-28 12:46:30,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 31.15/14.16 [2019-03-28 12:46:30,965 INFO L133 SettingsManager]: * Rewrite not-equals=true 31.15/14.16 [2019-03-28 12:46:30,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 31.15/14.16 [2019-03-28 12:46:30,965 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 31.15/14.16 [2019-03-28 12:46:30,966 INFO L133 SettingsManager]: * Use SBE=true 31.15/14.16 [2019-03-28 12:46:30,966 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 31.15/14.16 [2019-03-28 12:46:30,966 INFO L133 SettingsManager]: * Use old map elimination=false 31.15/14.16 [2019-03-28 12:46:30,966 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 31.15/14.16 [2019-03-28 12:46:30,966 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 31.15/14.16 [2019-03-28 12:46:30,966 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 31.15/14.16 [2019-03-28 12:46:30,967 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 31.15/14.16 [2019-03-28 12:46:30,967 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 31.15/14.16 [2019-03-28 12:46:30,967 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.15/14.16 [2019-03-28 12:46:30,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 31.15/14.16 [2019-03-28 12:46:30,967 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 31.15/14.16 [2019-03-28 12:46:30,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE 31.15/14.16 [2019-03-28 12:46:30,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 31.15/14.16 [2019-03-28 12:46:30,968 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 31.15/14.16 [2019-03-28 12:46:30,968 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 31.15/14.16 [2019-03-28 12:46:30,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 31.15/14.16 [2019-03-28 12:46:30,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 31.15/14.16 [2019-03-28 12:46:30,969 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 31.15/14.16 [2019-03-28 12:46:30,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.15/14.16 [2019-03-28 12:46:30,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 31.15/14.16 [2019-03-28 12:46:30,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 31.15/14.16 [2019-03-28 12:46:30,969 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 31.15/14.16 [2019-03-28 12:46:30,969 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 31.15/14.16 [2019-03-28 12:46:31,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 31.15/14.16 [2019-03-28 12:46:31,014 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 31.15/14.16 [2019-03-28 12:46:31,018 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 31.15/14.16 [2019-03-28 12:46:31,020 INFO L271 PluginConnector]: Initializing CDTParser... 31.15/14.16 [2019-03-28 12:46:31,020 INFO L276 PluginConnector]: CDTParser initialized 31.15/14.16 [2019-03-28 12:46:31,021 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 31.15/14.16 [2019-03-28 12:46:31,127 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8b279fb0294e4515a0289b2ac06bc24a/FLAG3e88622e7 31.15/14.16 [2019-03-28 12:46:31,465 INFO L307 CDTParser]: Found 1 translation units. 31.15/14.16 [2019-03-28 12:46:31,465 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 31.15/14.16 [2019-03-28 12:46:31,466 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 31.15/14.16 [2019-03-28 12:46:31,472 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8b279fb0294e4515a0289b2ac06bc24a/FLAG3e88622e7 31.15/14.16 [2019-03-28 12:46:31,874 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8b279fb0294e4515a0289b2ac06bc24a 31.15/14.16 [2019-03-28 12:46:31,885 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 31.15/14.16 [2019-03-28 12:46:31,887 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 31.15/14.16 [2019-03-28 12:46:31,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 31.15/14.16 [2019-03-28 12:46:31,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 31.15/14.16 [2019-03-28 12:46:31,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 31.15/14.16 [2019-03-28 12:46:31,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:31" (1/1) ... 31.15/14.16 [2019-03-28 12:46:31,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfbbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:31,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:31" (1/1) ... 31.15/14.16 [2019-03-28 12:46:31,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 31.15/14.16 [2019-03-28 12:46:31,921 INFO L176 MainTranslator]: Built tables and reachable declarations 31.15/14.16 [2019-03-28 12:46:32,080 INFO L206 PostProcessor]: Analyzing one entry point: main 31.15/14.16 [2019-03-28 12:46:32,092 INFO L191 MainTranslator]: Completed pre-run 31.15/14.16 [2019-03-28 12:46:32,109 INFO L206 PostProcessor]: Analyzing one entry point: main 31.15/14.16 [2019-03-28 12:46:32,182 INFO L195 MainTranslator]: Completed translation 31.15/14.16 [2019-03-28 12:46:32,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32 WrapperNode 31.15/14.16 [2019-03-28 12:46:32,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 31.15/14.16 [2019-03-28 12:46:32,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 31.15/14.16 [2019-03-28 12:46:32,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 31.15/14.16 [2019-03-28 12:46:32,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 31.15/14.16 [2019-03-28 12:46:32,193 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:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,202 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:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 31.15/14.16 [2019-03-28 12:46:32,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 31.15/14.16 [2019-03-28 12:46:32,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 31.15/14.16 [2019-03-28 12:46:32,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized 31.15/14.16 [2019-03-28 12:46:32,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 31.15/14.16 [2019-03-28 12:46:32,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 31.15/14.16 [2019-03-28 12:46:32,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... 31.15/14.16 [2019-03-28 12:46:32,247 INFO L276 PluginConnector]: RCFGBuilder initialized 31.15/14.16 [2019-03-28 12:46:32,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 31.15/14.16 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.15/14.16 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 31.15/14.16 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.15/14.16 [2019-03-28 12:46:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 31.15/14.16 [2019-03-28 12:46:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 31.15/14.16 [2019-03-28 12:46:32,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 31.15/14.16 [2019-03-28 12:46:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 31.15/14.16 [2019-03-28 12:46:32,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 31.15/14.16 [2019-03-28 12:46:32,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 31.15/14.16 [2019-03-28 12:46:32,526 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 31.15/14.16 [2019-03-28 12:46:32,526 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 31.15/14.16 [2019-03-28 12:46:32,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32 BoogieIcfgContainer 31.15/14.16 [2019-03-28 12:46:32,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 31.15/14.16 [2019-03-28 12:46:32,529 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 31.15/14.16 [2019-03-28 12:46:32,529 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 31.15/14.16 [2019-03-28 12:46:32,531 INFO L276 PluginConnector]: BlockEncodingV2 initialized 31.15/14.16 [2019-03-28 12:46:32,532 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (1/1) ... 31.15/14.16 [2019-03-28 12:46:32,549 INFO L313 BlockEncoder]: Initial Icfg 35 locations, 38 edges 31.15/14.16 [2019-03-28 12:46:32,550 INFO L258 BlockEncoder]: Using Remove infeasible edges 31.15/14.16 [2019-03-28 12:46:32,551 INFO L263 BlockEncoder]: Using Maximize final states 31.15/14.16 [2019-03-28 12:46:32,552 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 31.15/14.16 [2019-03-28 12:46:32,552 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 31.15/14.16 [2019-03-28 12:46:32,554 INFO L296 BlockEncoder]: Using Remove sink states 31.15/14.16 [2019-03-28 12:46:32,555 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 31.15/14.16 [2019-03-28 12:46:32,555 INFO L179 BlockEncoder]: Using Rewrite not-equals 31.15/14.16 [2019-03-28 12:46:32,577 INFO L185 BlockEncoder]: Using Use SBE 31.15/14.16 [2019-03-28 12:46:32,607 INFO L200 BlockEncoder]: SBE split 18 edges 31.15/14.16 [2019-03-28 12:46:32,613 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 31.15/14.16 [2019-03-28 12:46:32,615 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.15/14.16 [2019-03-28 12:46:32,648 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 31.15/14.16 [2019-03-28 12:46:32,651 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 31.15/14.16 [2019-03-28 12:46:32,653 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 31.15/14.16 [2019-03-28 12:46:32,653 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.15/14.16 [2019-03-28 12:46:32,653 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 31.15/14.16 [2019-03-28 12:46:32,654 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 31.15/14.16 [2019-03-28 12:46:32,655 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 50 edges 31.15/14.16 [2019-03-28 12:46:32,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32 BasicIcfg 31.15/14.16 [2019-03-28 12:46:32,655 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 31.15/14.16 [2019-03-28 12:46:32,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 31.15/14.16 [2019-03-28 12:46:32,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... 31.15/14.16 [2019-03-28 12:46:32,660 INFO L276 PluginConnector]: TraceAbstraction initialized 31.15/14.16 [2019-03-28 12:46:32,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:31" (1/4) ... 31.15/14.16 [2019-03-28 12:46:32,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a63e83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:32, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:32,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (2/4) ... 31.15/14.16 [2019-03-28 12:46:32,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a63e83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:32, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:32,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (3/4) ... 31.15/14.16 [2019-03-28 12:46:32,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a63e83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:32, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:32,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32" (4/4) ... 31.15/14.16 [2019-03-28 12:46:32,664 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.15/14.16 [2019-03-28 12:46:32,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 31.15/14.16 [2019-03-28 12:46:32,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 31.15/14.16 [2019-03-28 12:46:32,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 31.15/14.16 [2019-03-28 12:46:32,728 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.15/14.16 [2019-03-28 12:46:32,728 INFO L382 AbstractCegarLoop]: Interprodecural is true 31.15/14.16 [2019-03-28 12:46:32,729 INFO L383 AbstractCegarLoop]: Hoare is true 31.15/14.16 [2019-03-28 12:46:32,729 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 31.15/14.16 [2019-03-28 12:46:32,729 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 31.15/14.16 [2019-03-28 12:46:32,729 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.15/14.16 [2019-03-28 12:46:32,729 INFO L387 AbstractCegarLoop]: Difference is false 31.15/14.16 [2019-03-28 12:46:32,729 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 31.15/14.16 [2019-03-28 12:46:32,729 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 31.15/14.16 [2019-03-28 12:46:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. 31.15/14.16 [2019-03-28 12:46:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.15/14.16 [2019-03-28 12:46:32,751 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:32,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.15/14.16 [2019-03-28 12:46:32,752 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 113174, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:32,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:32,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:32,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:32,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:32,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:32,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:32,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:32,956 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,075 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. 31.15/14.16 [2019-03-28 12:46:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,091 INFO L225 Difference]: With dead ends: 28 31.15/14.16 [2019-03-28 12:46:33,091 INFO L226 Difference]: Without dead ends: 24 31.15/14.16 [2019-03-28 12:46:33,094 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 31.15/14.16 [2019-03-28 12:46:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 31.15/14.16 [2019-03-28 12:46:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 31.15/14.16 [2019-03-28 12:46:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 31.15/14.16 [2019-03-28 12:46:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. 31.15/14.16 [2019-03-28 12:46:33,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 42 transitions. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,134 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 42 transitions. 31.15/14.16 [2019-03-28 12:46:33,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. 31.15/14.16 [2019-03-28 12:46:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.15/14.16 [2019-03-28 12:46:33,134 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:33,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,135 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:33,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,161 INFO L87 Difference]: Start difference. First operand 24 states and 42 transitions. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,224 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. 31.15/14.16 [2019-03-28 12:46:33,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,225 INFO L225 Difference]: With dead ends: 28 31.15/14.16 [2019-03-28 12:46:33,225 INFO L226 Difference]: Without dead ends: 24 31.15/14.16 [2019-03-28 12:46:33,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 31.15/14.16 [2019-03-28 12:46:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 31.15/14.16 [2019-03-28 12:46:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 31.15/14.16 [2019-03-28 12:46:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:33,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,231 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:33,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.15/14.16 [2019-03-28 12:46:33,232 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:33,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 113177, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,277 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,342 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,343 INFO L225 Difference]: With dead ends: 24 31.15/14.16 [2019-03-28 12:46:33,343 INFO L226 Difference]: Without dead ends: 20 31.15/14.16 [2019-03-28 12:46:33,344 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 31.15/14.16 [2019-03-28 12:46:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 31.15/14.16 [2019-03-28 12:46:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 31.15/14.16 [2019-03-28 12:46:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 31.15/14.16 [2019-03-28 12:46:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. 31.15/14.16 [2019-03-28 12:46:33,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 3 31.15/14.16 [2019-03-28 12:46:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,348 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. 31.15/14.16 [2019-03-28 12:46:33,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. 31.15/14.16 [2019-03-28 12:46:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 31.15/14.16 [2019-03-28 12:46:33,349 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:33,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash -925009780, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:33,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,398 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,461 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. 31.15/14.16 [2019-03-28 12:46:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,462 INFO L225 Difference]: With dead ends: 20 31.15/14.16 [2019-03-28 12:46:33,462 INFO L226 Difference]: Without dead ends: 17 31.15/14.16 [2019-03-28 12:46:33,463 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 31.15/14.16 [2019-03-28 12:46:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 31.15/14.16 [2019-03-28 12:46:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 31.15/14.16 [2019-03-28 12:46:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 31.15/14.16 [2019-03-28 12:46:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 31.15/14.16 [2019-03-28 12:46:33,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,467 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 31.15/14.16 [2019-03-28 12:46:33,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 31.15/14.16 [2019-03-28 12:46:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 31.15/14.16 [2019-03-28 12:46:33,467 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:33,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -925009778, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,494 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,529 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. 31.15/14.16 [2019-03-28 12:46:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,531 INFO L225 Difference]: With dead ends: 20 31.15/14.16 [2019-03-28 12:46:33,531 INFO L226 Difference]: Without dead ends: 17 31.15/14.16 [2019-03-28 12:46:33,531 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 31.15/14.16 [2019-03-28 12:46:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 31.15/14.16 [2019-03-28 12:46:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 31.15/14.16 [2019-03-28 12:46:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 31.15/14.16 [2019-03-28 12:46:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. 31.15/14.16 [2019-03-28 12:46:33,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,535 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. 31.15/14.16 [2019-03-28 12:46:33,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. 31.15/14.16 [2019-03-28 12:46:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 31.15/14.16 [2019-03-28 12:46:33,536 INFO L394 BasicCegarLoop]: Found error trace 31.15/14.16 [2019-03-28 12:46:33,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 31.15/14.16 [2019-03-28 12:46:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -925009777, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.15/14.16 [2019-03-28 12:46:33,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.15/14.16 [2019-03-28 12:46:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,568 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,598 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. 31.15/14.16 [2019-03-28 12:46:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.15/14.16 [2019-03-28 12:46:33,599 INFO L225 Difference]: With dead ends: 17 31.15/14.16 [2019-03-28 12:46:33,599 INFO L226 Difference]: Without dead ends: 0 31.15/14.16 [2019-03-28 12:46:33,600 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 31.15/14.16 [2019-03-28 12:46:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 31.15/14.16 [2019-03-28 12:46:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 31.15/14.16 [2019-03-28 12:46:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 31.15/14.16 [2019-03-28 12:46:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 31.15/14.16 [2019-03-28 12:46:33,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 31.15/14.16 [2019-03-28 12:46:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. 31.15/14.16 [2019-03-28 12:46:33,601 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 31.15/14.16 [2019-03-28 12:46:33,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 31.15/14.16 [2019-03-28 12:46:33,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 31.15/14.16 [2019-03-28 12:46:33,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,631 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,632 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,633 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,633 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 14) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,633 INFO L444 ceAbstractionStarter]: At program point L9-2(lines 8 15) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~y~0.base) 1) (= (select |#length| ULTIMATE.start_main_~y~0.base) 4) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= ULTIMATE.start_main_~y~0.offset 0)) 31.15/14.16 [2019-03-28 12:46:33,633 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,633 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,634 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,635 INFO L448 ceAbstractionStarter]: For program point L8-6(lines 8 15) no Hoare annotation was computed. 31.15/14.16 [2019-03-28 12:46:33,635 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 31.15/14.16 [2019-03-28 12:46:33,644 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.15/14.16 [2019-03-28 12:46:33,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.15/14.16 [2019-03-28 12:46:33,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.15/14.16 [2019-03-28 12:46:33,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.15/14.16 [2019-03-28 12:46:33,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:33 BasicIcfg 31.15/14.16 [2019-03-28 12:46:33,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 31.15/14.16 [2019-03-28 12:46:33,654 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 31.15/14.16 [2019-03-28 12:46:33,654 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 31.15/14.16 [2019-03-28 12:46:33,658 INFO L276 PluginConnector]: BuchiAutomizer initialized 31.15/14.16 [2019-03-28 12:46:33,658 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.15/14.16 [2019-03-28 12:46:33,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:31" (1/5) ... 31.15/14.16 [2019-03-28 12:46:33,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26ff45fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:33, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:33,659 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.15/14.16 [2019-03-28 12:46:33,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (2/5) ... 31.15/14.16 [2019-03-28 12:46:33,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26ff45fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:33, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:33,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.15/14.16 [2019-03-28 12:46:33,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (3/5) ... 31.15/14.16 [2019-03-28 12:46:33,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26ff45fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:33, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:33,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.15/14.16 [2019-03-28 12:46:33,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32" (4/5) ... 31.15/14.16 [2019-03-28 12:46:33,661 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26ff45fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:33, skipping insertion in model container 31.15/14.16 [2019-03-28 12:46:33,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.15/14.16 [2019-03-28 12:46:33,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:33" (5/5) ... 31.15/14.16 [2019-03-28 12:46:33,663 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.15/14.16 [2019-03-28 12:46:33,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.15/14.16 [2019-03-28 12:46:33,683 INFO L374 BuchiCegarLoop]: Interprodecural is true 31.15/14.16 [2019-03-28 12:46:33,683 INFO L375 BuchiCegarLoop]: Hoare is true 31.15/14.16 [2019-03-28 12:46:33,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 31.15/14.16 [2019-03-28 12:46:33,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 31.15/14.16 [2019-03-28 12:46:33,684 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.15/14.16 [2019-03-28 12:46:33,684 INFO L379 BuchiCegarLoop]: Difference is false 31.15/14.16 [2019-03-28 12:46:33,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 31.15/14.16 [2019-03-28 12:46:33,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 31.15/14.16 [2019-03-28 12:46:33,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 31.15/14.16 [2019-03-28 12:46:33,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:33,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.15/14.16 [2019-03-28 12:46:33,693 INFO L119 BuchiIsEmpty]: Starting construction of run 31.15/14.16 [2019-03-28 12:46:33,697 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.15/14.16 [2019-03-28 12:46:33,697 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,697 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 31.15/14.16 [2019-03-28 12:46:33,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. 31.15/14.16 [2019-03-28 12:46:33,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:33,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.15/14.16 [2019-03-28 12:46:33,700 INFO L119 BuchiIsEmpty]: Starting construction of run 31.15/14.16 [2019-03-28 12:46:33,700 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.15/14.16 [2019-03-28 12:46:33,700 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,705 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [83] 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] 6#L-1true [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 3#L9-2true 31.15/14.16 [2019-03-28 12:46:33,706 INFO L796 eck$LassoCheckResult]: Loop: 3#L9-2true [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 17#L8-1true [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 14#L8-2true [77] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 26#L8-6true [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 4#L9true [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 8#L10true [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 20#L10-1true [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 3#L9-2true 31.15/14.16 [2019-03-28 12:46:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1808998383, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 31.15/14.16 [2019-03-28 12:46:33,756 INFO L811 eck$LassoCheckResult]: loop already infeasible 31.15/14.16 [2019-03-28 12:46:33,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,758 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,852 INFO L93 Difference]: Finished difference Result 30 states and 52 transitions. 31.15/14.16 [2019-03-28 12:46:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 52 transitions. 31.15/14.16 [2019-03-28 12:46:33,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 31.15/14.16 [2019-03-28 12:46:33,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 16 states and 24 transitions. 31.15/14.16 [2019-03-28 12:46:33,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 31.15/14.16 [2019-03-28 12:46:33,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 31.15/14.16 [2019-03-28 12:46:33,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. 31.15/14.16 [2019-03-28 12:46:33,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.15/14.16 [2019-03-28 12:46:33,861 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. 31.15/14.16 [2019-03-28 12:46:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. 31.15/14.16 [2019-03-28 12:46:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. 31.15/14.16 [2019-03-28 12:46:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 31.15/14.16 [2019-03-28 12:46:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. 31.15/14.16 [2019-03-28 12:46:33,864 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. 31.15/14.16 [2019-03-28 12:46:33,864 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 23 transitions. 31.15/14.16 [2019-03-28 12:46:33,865 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 31.15/14.16 [2019-03-28 12:46:33,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. 31.15/14.16 [2019-03-28 12:46:33,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 31.15/14.16 [2019-03-28 12:46:33,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.15/14.16 [2019-03-28 12:46:33,866 INFO L119 BuchiIsEmpty]: Starting construction of run 31.15/14.16 [2019-03-28 12:46:33,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.15/14.16 [2019-03-28 12:46:33,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,867 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRY [83] 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] 77#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 70#L9-2 31.15/14.16 [2019-03-28 12:46:33,867 INFO L796 eck$LassoCheckResult]: Loop: 70#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 71#L8-1 [122] L8-1-->L8-2: Formula: (and (>= 0 |v_ULTIMATE.start_main_#t~mem2_3|) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 72#L8-2 [77] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 81#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 73#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 74#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 76#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 70#L9-2 31.15/14.16 [2019-03-28 12:46:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 2 times 31.15/14.16 [2019-03-28 12:46:33,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1837627534, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:33,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.15/14.16 [2019-03-28 12:46:33,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 31.15/14.16 [2019-03-28 12:46:33,904 INFO L811 eck$LassoCheckResult]: loop already infeasible 31.15/14.16 [2019-03-28 12:46:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.15/14.16 [2019-03-28 12:46:33,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.15/14.16 [2019-03-28 12:46:33,905 INFO L87 Difference]: Start difference. First operand 15 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. 31.15/14.16 [2019-03-28 12:46:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.15/14.16 [2019-03-28 12:46:33,943 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. 31.15/14.16 [2019-03-28 12:46:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.15/14.16 [2019-03-28 12:46:33,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. 31.15/14.16 [2019-03-28 12:46:33,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:33,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 31.15/14.16 [2019-03-28 12:46:33,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 31.15/14.16 [2019-03-28 12:46:33,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.15/14.16 [2019-03-28 12:46:33,946 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 31.15/14.16 [2019-03-28 12:46:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 31.15/14.16 [2019-03-28 12:46:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,948 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,948 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,948 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 31.15/14.16 [2019-03-28 12:46:33,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. 31.15/14.16 [2019-03-28 12:46:33,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:33,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.15/14.16 [2019-03-28 12:46:33,950 INFO L119 BuchiIsEmpty]: Starting construction of run 31.15/14.16 [2019-03-28 12:46:33,950 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.15/14.16 [2019-03-28 12:46:33,950 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:33,951 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY [83] 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] 113#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 107#L9-2 31.15/14.16 [2019-03-28 12:46:33,951 INFO L796 eck$LassoCheckResult]: Loop: 107#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 108#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 106#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 104#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 105#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 117#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 109#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 110#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 112#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 107#L9-2 31.15/14.16 [2019-03-28 12:46:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash 3650, now seen corresponding path program 3 times 31.15/14.16 [2019-03-28 12:46:33,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2087092835, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:33,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:33,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:33,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:34,243 INFO L216 LassoAnalysis]: Preferences: 31.15/14.16 [2019-03-28 12:46:34,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.15/14.16 [2019-03-28 12:46:34,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.15/14.16 [2019-03-28 12:46:34,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.15/14.16 [2019-03-28 12:46:34,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.15/14.16 [2019-03-28 12:46:34,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.15/14.16 [2019-03-28 12:46:34,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.15/14.16 [2019-03-28 12:46:34,245 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.15/14.16 [2019-03-28 12:46:34,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 31.15/14.16 [2019-03-28 12:46:34,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.15/14.16 [2019-03-28 12:46:34,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.15/14.16 [2019-03-28 12:46:34,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,448 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 31.15/14.16 [2019-03-28 12:46:34,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:34,808 INFO L300 LassoAnalysis]: Preprocessing complete. 31.15/14.16 [2019-03-28 12:46:34,814 INFO L497 LassoAnalysis]: Using template 'affine'. 31.15/14.16 [2019-03-28 12:46:34,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:34,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:34,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:34,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:34,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:34,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:34,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:34,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:34,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:34,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:34,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:34,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:34,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:34,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.15/14.16 [2019-03-28 12:46:34,884 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.15/14.16 [2019-03-28 12:46:34,885 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 31.15/14.16 [2019-03-28 12:46:34,887 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.15/14.16 [2019-03-28 12:46:34,887 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.15/14.16 [2019-03-28 12:46:34,887 INFO L518 LassoAnalysis]: Proved termination. 31.15/14.16 [2019-03-28 12:46:34,888 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.15/14.16 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 31.15/14.16 Supporting invariants [] 31.15/14.16 [2019-03-28 12:46:34,917 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 31.15/14.16 [2019-03-28 12:46:34,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.15/14.16 [2019-03-28 12:46:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:34,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 31.15/14.16 [2019-03-28 12:46:34,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.15/14.16 [2019-03-28 12:46:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:34,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.15/14.16 [2019-03-28 12:46:34,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.15/14.16 [2019-03-28 12:46:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.15/14.16 [2019-03-28 12:46:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.15/14.16 [2019-03-28 12:46:35,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.15/14.16 [2019-03-28 12:46:35,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.15/14.16 [2019-03-28 12:46:35,127 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 28 treesize of output 16 31.15/14.16 [2019-03-28 12:46:35,128 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.15/14.16 [2019-03-28 12:46:35,135 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.15/14.16 [2019-03-28 12:46:35,135 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.15/14.16 [2019-03-28 12:46:35,136 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.15/14.16 [2019-03-28 12:46:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,201 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.15/14.16 [2019-03-28 12:46:35,201 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 31.15/14.16 [2019-03-28 12:46:35,205 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 5 loop predicates 31.15/14.16 [2019-03-28 12:46:35,206 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. 31.15/14.16 [2019-03-28 12:46:35,292 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 34 states and 43 transitions. Complement of second has 10 states. 31.15/14.16 [2019-03-28 12:46:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.15/14.16 [2019-03-28 12:46:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 31.15/14.16 [2019-03-28 12:46:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 31.15/14.16 [2019-03-28 12:46:35,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. 31.15/14.16 [2019-03-28 12:46:35,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.15/14.16 [2019-03-28 12:46:35,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. 31.15/14.16 [2019-03-28 12:46:35,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.15/14.16 [2019-03-28 12:46:35,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. 31.15/14.16 [2019-03-28 12:46:35,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.15/14.16 [2019-03-28 12:46:35,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. 31.15/14.16 [2019-03-28 12:46:35,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:35,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. 31.15/14.16 [2019-03-28 12:46:35,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 31.15/14.16 [2019-03-28 12:46:35,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 31.15/14.16 [2019-03-28 12:46:35,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. 31.15/14.16 [2019-03-28 12:46:35,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.15/14.16 [2019-03-28 12:46:35,305 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. 31.15/14.16 [2019-03-28 12:46:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. 31.15/14.16 [2019-03-28 12:46:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. 31.15/14.16 [2019-03-28 12:46:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 31.15/14.16 [2019-03-28 12:46:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:35,308 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:35,308 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:35,308 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 31.15/14.16 [2019-03-28 12:46:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 31.15/14.16 [2019-03-28 12:46:35,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.15/14.16 [2019-03-28 12:46:35,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.15/14.16 [2019-03-28 12:46:35,309 INFO L119 BuchiIsEmpty]: Starting construction of run 31.15/14.16 [2019-03-28 12:46:35,310 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.15/14.16 [2019-03-28 12:46:35,310 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.15/14.16 [2019-03-28 12:46:35,310 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY [83] 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] 309#L-1 [115] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 298#L9-2 31.15/14.16 [2019-03-28 12:46:35,311 INFO L796 eck$LassoCheckResult]: Loop: 298#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 299#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 296#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 292#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 293#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 317#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 318#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 311#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 307#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 298#L9-2 31.15/14.16 [2019-03-28 12:46:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 3649, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:35,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 2 times 31.15/14.16 [2019-03-28 12:46:35,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:35,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.15/14.16 [2019-03-28 12:46:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2011360956, now seen corresponding path program 1 times 31.15/14.16 [2019-03-28 12:46:35,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.15/14.16 [2019-03-28 12:46:35,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.15/14.16 [2019-03-28 12:46:35,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.15/14.16 [2019-03-28 12:46:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.15/14.16 [2019-03-28 12:46:35,551 INFO L216 LassoAnalysis]: Preferences: 31.15/14.16 [2019-03-28 12:46:35,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.15/14.16 [2019-03-28 12:46:35,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.15/14.16 [2019-03-28 12:46:35,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.15/14.16 [2019-03-28 12:46:35,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.15/14.16 [2019-03-28 12:46:35,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.15/14.16 [2019-03-28 12:46:35,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.15/14.16 [2019-03-28 12:46:35,552 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.15/14.16 [2019-03-28 12:46:35,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 31.15/14.16 [2019-03-28 12:46:35,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.15/14.16 [2019-03-28 12:46:35,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.15/14.16 [2019-03-28 12:46:35,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,712 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 31.15/14.16 [2019-03-28 12:46:35,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:35,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.15/14.16 [2019-03-28 12:46:36,028 INFO L300 LassoAnalysis]: Preprocessing complete. 31.15/14.16 [2019-03-28 12:46:36,028 INFO L497 LassoAnalysis]: Using template 'affine'. 31.15/14.16 [2019-03-28 12:46:36,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:36,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:36,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:36,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.15/14.16 [2019-03-28 12:46:36,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.15/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.15/14.16 Number of strict supporting invariants: 0 31.15/14.16 Number of non-strict supporting invariants: 1 31.15/14.16 Consider only non-deceasing supporting invariants: true 31.15/14.16 Simplify termination arguments: true 31.15/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.15/14.16 [2019-03-28 12:46:36,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.15/14.16 [2019-03-28 12:46:36,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.15/14.16 [2019-03-28 12:46:36,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.15/14.16 [2019-03-28 12:46:36,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.15/14.16 [2019-03-28 12:46:36,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.15/14.16 [2019-03-28 12:46:36,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.15/14.16 [2019-03-28 12:46:36,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.15/14.16 [2019-03-28 12:46:36,083 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.15/14.16 [2019-03-28 12:46:36,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.15/14.16 [2019-03-28 12:46:36,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 31.15/14.16 [2019-03-28 12:46:36,085 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.15/14.16 [2019-03-28 12:46:36,085 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.15/14.16 [2019-03-28 12:46:36,086 INFO L518 LassoAnalysis]: Proved termination. 31.15/14.16 [2019-03-28 12:46:36,086 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.15/14.16 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 31.15/14.16 Supporting invariants [] 31.15/14.16 [2019-03-28 12:46:36,114 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 31.22/14.16 [2019-03-28 12:46:36,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.22/14.16 [2019-03-28 12:46:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.16 [2019-03-28 12:46:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.16 [2019-03-28 12:46:36,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 31.22/14.16 [2019-03-28 12:46:36,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.16 [2019-03-28 12:46:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.16 [2019-03-28 12:46:36,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.16 [2019-03-28 12:46:36,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.16 [2019-03-28 12:46:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.22/14.16 [2019-03-28 12:46:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.16 [2019-03-28 12:46:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.16 [2019-03-28 12:46:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.16 [2019-03-28 12:46:36,317 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 28 treesize of output 16 31.22/14.16 [2019-03-28 12:46:36,317 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.16 [2019-03-28 12:46:36,323 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.16 [2019-03-28 12:46:36,324 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.16 [2019-03-28 12:46:36,324 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.22/14.16 [2019-03-28 12:46:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,378 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.16 [2019-03-28 12:46:36,378 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 31.22/14.16 [2019-03-28 12:46:36,379 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 5 loop predicates 31.22/14.16 [2019-03-28 12:46:36,379 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. 31.22/14.16 [2019-03-28 12:46:36,451 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. 31.22/14.16 [2019-03-28 12:46:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.22/14.16 [2019-03-28 12:46:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 31.22/14.16 [2019-03-28 12:46:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 31.22/14.16 [2019-03-28 12:46:36,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. 31.22/14.16 [2019-03-28 12:46:36,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.16 [2019-03-28 12:46:36,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. 31.22/14.16 [2019-03-28 12:46:36,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.16 [2019-03-28 12:46:36,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. 31.22/14.16 [2019-03-28 12:46:36,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.16 [2019-03-28 12:46:36,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. 31.22/14.16 [2019-03-28 12:46:36,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.16 [2019-03-28 12:46:36,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. 31.22/14.16 [2019-03-28 12:46:36,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 31.22/14.16 [2019-03-28 12:46:36,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 31.22/14.16 [2019-03-28 12:46:36,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. 31.22/14.16 [2019-03-28 12:46:36,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.22/14.16 [2019-03-28 12:46:36,461 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. 31.22/14.16 [2019-03-28 12:46:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. 31.22/14.16 [2019-03-28 12:46:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. 31.22/14.16 [2019-03-28 12:46:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 31.22/14.16 [2019-03-28 12:46:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 31.22/14.16 [2019-03-28 12:46:36,464 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.16 [2019-03-28 12:46:36,464 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.16 [2019-03-28 12:46:36,464 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 31.22/14.16 [2019-03-28 12:46:36,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 31.22/14.16 [2019-03-28 12:46:36,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.16 [2019-03-28 12:46:36,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.22/14.16 [2019-03-28 12:46:36,465 INFO L119 BuchiIsEmpty]: Starting construction of run 31.22/14.16 [2019-03-28 12:46:36,465 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.22/14.16 [2019-03-28 12:46:36,465 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.22/14.16 [2019-03-28 12:46:36,466 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY [83] 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] 529#L-1 [114] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 527#L9-2 31.22/14.16 [2019-03-28 12:46:36,466 INFO L796 eck$LassoCheckResult]: Loop: 527#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 541#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 540#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 539#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 538#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 537#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 536#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 530#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 526#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 527#L9-2 31.22/14.16 [2019-03-28 12:46:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.16 [2019-03-28 12:46:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash 3648, now seen corresponding path program 1 times 31.22/14.16 [2019-03-28 12:46:36,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.16 [2019-03-28 12:46:36,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.16 [2019-03-28 12:46:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.16 [2019-03-28 12:46:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 3 times 31.22/14.16 [2019-03-28 12:46:36,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.16 [2019-03-28 12:46:36,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.16 [2019-03-28 12:46:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.16 [2019-03-28 12:46:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1814847451, now seen corresponding path program 1 times 31.22/14.16 [2019-03-28 12:46:36,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.16 [2019-03-28 12:46:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.16 [2019-03-28 12:46:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.16 [2019-03-28 12:46:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.16 [2019-03-28 12:46:36,744 INFO L216 LassoAnalysis]: Preferences: 31.22/14.16 [2019-03-28 12:46:36,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.22/14.16 [2019-03-28 12:46:36,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.22/14.16 [2019-03-28 12:46:36,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.22/14.16 [2019-03-28 12:46:36,745 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.22/14.16 [2019-03-28 12:46:36,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.22/14.16 [2019-03-28 12:46:36,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.22/14.16 [2019-03-28 12:46:36,745 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.22/14.16 [2019-03-28 12:46:36,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 31.22/14.16 [2019-03-28 12:46:36,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.22/14.16 [2019-03-28 12:46:36,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.22/14.16 [2019-03-28 12:46:36,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:36,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.16 [2019-03-28 12:46:37,266 INFO L300 LassoAnalysis]: Preprocessing complete. 31.22/14.16 [2019-03-28 12:46:37,266 INFO L497 LassoAnalysis]: Using template 'affine'. 31.22/14.16 [2019-03-28 12:46:37,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.16 [2019-03-28 12:46:37,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.16 [2019-03-28 12:46:37,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.16 [2019-03-28 12:46:37,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.16 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.16 Number of strict supporting invariants: 0 31.22/14.16 Number of non-strict supporting invariants: 1 31.22/14.16 Consider only non-deceasing supporting invariants: true 31.22/14.16 Simplify termination arguments: true 31.22/14.16 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.16 [2019-03-28 12:46:37,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.16 [2019-03-28 12:46:37,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.16 [2019-03-28 12:46:37,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.16 [2019-03-28 12:46:37,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.16 [2019-03-28 12:46:37,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.16 [2019-03-28 12:46:37,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:37,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:37,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:37,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:37,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:37,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:37,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:37,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:37,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:37,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:37,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:37,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.22/14.17 [2019-03-28 12:46:37,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.22/14.17 [2019-03-28 12:46:37,333 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 31.22/14.17 [2019-03-28 12:46:37,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.22/14.17 [2019-03-28 12:46:37,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.22/14.17 [2019-03-28 12:46:37,334 INFO L518 LassoAnalysis]: Proved termination. 31.22/14.17 [2019-03-28 12:46:37,334 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.22/14.17 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 31.22/14.17 Supporting invariants [] 31.22/14.17 [2019-03-28 12:46:37,361 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 31.22/14.17 [2019-03-28 12:46:37,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.22/14.17 [2019-03-28 12:46:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:37,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:37,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:37,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:37,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.22/14.17 [2019-03-28 12:46:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:37,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:37,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:37,524 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 28 treesize of output 16 31.22/14.17 [2019-03-28 12:46:37,525 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:37,529 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:37,530 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:37,530 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.22/14.17 [2019-03-28 12:46:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,587 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:37,588 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 31.22/14.17 [2019-03-28 12:46:37,588 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 5 loop predicates 31.22/14.17 [2019-03-28 12:46:37,588 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. 31.22/14.17 [2019-03-28 12:46:37,658 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. 31.22/14.17 [2019-03-28 12:46:37,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.22/14.17 [2019-03-28 12:46:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 31.22/14.17 [2019-03-28 12:46:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 31.22/14.17 [2019-03-28 12:46:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:37,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:37,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. 31.22/14.17 [2019-03-28 12:46:37,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:37,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. 31.22/14.17 [2019-03-28 12:46:37,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.17 [2019-03-28 12:46:37,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:37,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 31.22/14.17 [2019-03-28 12:46:37,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 31.22/14.17 [2019-03-28 12:46:37,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:37,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.22/14.17 [2019-03-28 12:46:37,667 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. 31.22/14.17 [2019-03-28 12:46:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 31.22/14.17 [2019-03-28 12:46:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:37,670 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:37,670 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:37,670 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 31.22/14.17 [2019-03-28 12:46:37,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:37,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.17 [2019-03-28 12:46:37,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.22/14.17 [2019-03-28 12:46:37,671 INFO L119 BuchiIsEmpty]: Starting construction of run 31.22/14.17 [2019-03-28 12:46:37,671 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 31.22/14.17 [2019-03-28 12:46:37,671 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.22/14.17 [2019-03-28 12:46:37,672 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY [83] 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] 749#L-1 [113] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 747#L9-2 31.22/14.17 [2019-03-28 12:46:37,672 INFO L796 eck$LassoCheckResult]: Loop: 747#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 761#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 760#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 759#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 758#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 757#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 756#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 750#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 746#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 747#L9-2 31.22/14.17 [2019-03-28 12:46:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 3647, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:37,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1905334148, now seen corresponding path program 4 times 31.22/14.17 [2019-03-28 12:46:37,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:37,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1618333946, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:37,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:37,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:37,853 INFO L216 LassoAnalysis]: Preferences: 31.22/14.17 [2019-03-28 12:46:37,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.22/14.17 [2019-03-28 12:46:37,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.22/14.17 [2019-03-28 12:46:37,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.22/14.17 [2019-03-28 12:46:37,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.22/14.17 [2019-03-28 12:46:37,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.22/14.17 [2019-03-28 12:46:37,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.22/14.17 [2019-03-28 12:46:37,854 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.22/14.17 [2019-03-28 12:46:37,854 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso 31.22/14.17 [2019-03-28 12:46:37,854 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.22/14.17 [2019-03-28 12:46:37,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.22/14.17 [2019-03-28 12:46:37,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:37,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:37,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:38,289 INFO L300 LassoAnalysis]: Preprocessing complete. 31.22/14.17 [2019-03-28 12:46:38,290 INFO L497 LassoAnalysis]: Using template 'affine'. 31.22/14.17 [2019-03-28 12:46:38,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:38,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:38,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:38,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:38,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:38,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:38,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:38,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:38,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:38,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:38,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:38,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:38,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:38,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:38,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:38,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:38,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:38,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:38,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:38,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:38,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:38,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:38,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:38,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:38,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:38,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:38,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:38,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:38,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:38,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:38,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:38,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:38,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:38,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:38,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.22/14.17 [2019-03-28 12:46:38,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.22/14.17 [2019-03-28 12:46:38,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 31.22/14.17 [2019-03-28 12:46:38,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.22/14.17 [2019-03-28 12:46:38,311 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 31.22/14.17 [2019-03-28 12:46:38,311 INFO L518 LassoAnalysis]: Proved termination. 31.22/14.17 [2019-03-28 12:46:38,311 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.22/14.17 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 31.22/14.17 Supporting invariants [] 31.22/14.17 [2019-03-28 12:46:38,358 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 31.22/14.17 [2019-03-28 12:46:38,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.22/14.17 [2019-03-28 12:46:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:38,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:38,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:38,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:38,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.22/14.17 [2019-03-28 12:46:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:38,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:38,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:38,538 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 28 treesize of output 16 31.22/14.17 [2019-03-28 12:46:38,539 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:38,543 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:38,544 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:38,544 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.22/14.17 [2019-03-28 12:46:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,600 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:38,600 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 5 predicates after loop cannibalization 31.22/14.17 [2019-03-28 12:46:38,601 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 5 loop predicates 31.22/14.17 [2019-03-28 12:46:38,601 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. 31.22/14.17 [2019-03-28 12:46:38,684 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 50 states and 62 transitions. Complement of second has 10 states. 31.22/14.17 [2019-03-28 12:46:38,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states 31.22/14.17 [2019-03-28 12:46:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 31.22/14.17 [2019-03-28 12:46:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 31.22/14.17 [2019-03-28 12:46:38,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:38,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:38,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 11 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:38,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:38,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 18 letters. 31.22/14.17 [2019-03-28 12:46:38,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:38,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. 31.22/14.17 [2019-03-28 12:46:38,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.17 [2019-03-28 12:46:38,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:38,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 31.22/14.17 [2019-03-28 12:46:38,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 31.22/14.17 [2019-03-28 12:46:38,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:38,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.22/14.17 [2019-03-28 12:46:38,693 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. 31.22/14.17 [2019-03-28 12:46:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. 31.22/14.17 [2019-03-28 12:46:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 31.22/14.17 [2019-03-28 12:46:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:38,697 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:38,697 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:38,697 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 31.22/14.17 [2019-03-28 12:46:38,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. 31.22/14.17 [2019-03-28 12:46:38,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 31.22/14.17 [2019-03-28 12:46:38,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.22/14.17 [2019-03-28 12:46:38,698 INFO L119 BuchiIsEmpty]: Starting construction of run 31.22/14.17 [2019-03-28 12:46:38,699 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.22/14.17 [2019-03-28 12:46:38,699 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 31.22/14.17 [2019-03-28 12:46:38,699 INFO L794 eck$LassoCheckResult]: Stem: 971#ULTIMATE.startENTRY [83] 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] 969#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 960#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 958#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 956#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 952#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 953#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 974#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 962#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 963#L12 31.22/14.17 [2019-03-28 12:46:38,700 INFO L796 eck$LassoCheckResult]: Loop: 963#L12 [154] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet7_5|)) |v_#memory_int_11|)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] 972#L13 [91] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 973#L13-1 [156] L13-1-->L9-2: Formula: (and (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem8_6| (- 1)))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_20| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 967#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 981#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 980#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 979#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 978#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 977#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 976#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 963#L12 31.22/14.17 [2019-03-28 12:46:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash 475914215, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:38,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:38,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:38,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1904629489, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:38,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1748672139, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:38,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:38,973 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 31.22/14.17 [2019-03-28 12:46:39,025 INFO L216 LassoAnalysis]: Preferences: 31.22/14.17 [2019-03-28 12:46:39,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.22/14.17 [2019-03-28 12:46:39,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.22/14.17 [2019-03-28 12:46:39,025 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.22/14.17 [2019-03-28 12:46:39,025 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.22/14.17 [2019-03-28 12:46:39,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.22/14.17 [2019-03-28 12:46:39,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.22/14.17 [2019-03-28 12:46:39,026 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.22/14.17 [2019-03-28 12:46:39,026 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso 31.22/14.17 [2019-03-28 12:46:39,026 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.22/14.17 [2019-03-28 12:46:39,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.22/14.17 [2019-03-28 12:46:39,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:39,472 INFO L300 LassoAnalysis]: Preprocessing complete. 31.22/14.17 [2019-03-28 12:46:39,472 INFO L497 LassoAnalysis]: Using template 'affine'. 31.22/14.17 [2019-03-28 12:46:39,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:39,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:39,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:39,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:39,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:39,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:39,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:39,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:39,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:39,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:39,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:39,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.22/14.17 [2019-03-28 12:46:39,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.22/14.17 [2019-03-28 12:46:39,514 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 31.22/14.17 [2019-03-28 12:46:39,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.22/14.17 [2019-03-28 12:46:39,517 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 31.22/14.17 [2019-03-28 12:46:39,517 INFO L518 LassoAnalysis]: Proved termination. 31.22/14.17 [2019-03-28 12:46:39,517 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.22/14.17 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_5 31.22/14.17 Supporting invariants [] 31.22/14.17 [2019-03-28 12:46:39,563 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed 31.22/14.17 [2019-03-28 12:46:39,565 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.22/14.17 [2019-03-28 12:46:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:39,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:39,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:39,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 31.22/14.17 [2019-03-28 12:46:39,610 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,613 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,614 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,614 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 31.22/14.17 [2019-03-28 12:46:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:39,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:39,630 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 31.22/14.17 [2019-03-28 12:46:39,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,637 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,638 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,638 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 31.22/14.17 [2019-03-28 12:46:39,661 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 31.22/14.17 [2019-03-28 12:46:39,662 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,668 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,668 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,669 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 31.22/14.17 [2019-03-28 12:46:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.22/14.17 [2019-03-28 12:46:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:39,778 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:39,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:39,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:39,831 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 31.22/14.17 [2019-03-28 12:46:39,831 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,838 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,839 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,839 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 31.22/14.17 [2019-03-28 12:46:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:39,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:39,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:39,875 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 31.22/14.17 [2019-03-28 12:46:39,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,883 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,883 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,884 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 31.22/14.17 [2019-03-28 12:46:39,889 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 31.22/14.17 [2019-03-28 12:46:39,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,897 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:39,897 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:39,898 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 31.22/14.17 [2019-03-28 12:46:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:39,938 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:39,938 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 7 predicates after loop cannibalization 31.22/14.17 [2019-03-28 12:46:39,938 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates 31.22/14.17 [2019-03-28 12:46:39,938 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10 Second operand 8 states. 31.22/14.17 [2019-03-28 12:46:40,213 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 38 transitions. cyclomatic complexity: 10. Second operand 8 states. Result 83 states and 96 transitions. Complement of second has 39 states. 31.22/14.17 [2019-03-28 12:46:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 8 non-accepting loop states 2 accepting loop states 31.22/14.17 [2019-03-28 12:46:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 31.22/14.17 [2019-03-28 12:46:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. 31.22/14.17 [2019-03-28 12:46:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 9 letters. Loop has 10 letters. 31.22/14.17 [2019-03-28 12:46:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 19 letters. Loop has 10 letters. 31.22/14.17 [2019-03-28 12:46:40,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:40,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 48 transitions. Stem has 9 letters. Loop has 20 letters. 31.22/14.17 [2019-03-28 12:46:40,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:40,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 96 transitions. 31.22/14.17 [2019-03-28 12:46:40,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 31.22/14.17 [2019-03-28 12:46:40,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 60 states and 72 transitions. 31.22/14.17 [2019-03-28 12:46:40,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 31.22/14.17 [2019-03-28 12:46:40,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 31.22/14.17 [2019-03-28 12:46:40,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 72 transitions. 31.22/14.17 [2019-03-28 12:46:40,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 31.22/14.17 [2019-03-28 12:46:40,221 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 72 transitions. 31.22/14.17 [2019-03-28 12:46:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 72 transitions. 31.22/14.17 [2019-03-28 12:46:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. 31.22/14.17 [2019-03-28 12:46:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. 31.22/14.17 [2019-03-28 12:46:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. 31.22/14.17 [2019-03-28 12:46:40,225 INFO L729 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. 31.22/14.17 [2019-03-28 12:46:40,225 INFO L609 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. 31.22/14.17 [2019-03-28 12:46:40,225 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 31.22/14.17 [2019-03-28 12:46:40,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. 31.22/14.17 [2019-03-28 12:46:40,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 31.22/14.17 [2019-03-28 12:46:40,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.22/14.17 [2019-03-28 12:46:40,226 INFO L119 BuchiIsEmpty]: Starting construction of run 31.22/14.17 [2019-03-28 12:46:40,227 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] 31.22/14.17 [2019-03-28 12:46:40,227 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 31.22/14.17 [2019-03-28 12:46:40,228 INFO L794 eck$LassoCheckResult]: Stem: 1326#ULTIMATE.startENTRY [83] 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] 1323#L-1 [116] L-1-->L9-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~nondet7, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem3] 1324#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1344#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1342#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1340#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1339#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1338#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1336#L9 [63] L9-->L12: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1327#L12 [154] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_16)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_16)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 |v_ULTIMATE.start_main_#t~nondet7_5|)) |v_#memory_int_11|)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_18|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet7] 1328#L13 [91] L13-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_7)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1331#L13-1 [156] L13-1-->L9-2: Formula: (and (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~y~0.base_13)) (= (store |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13 (store (select |v_#memory_int_16| v_ULTIMATE.start_main_~y~0.base_13) v_ULTIMATE.start_main_~y~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem8_6| (- 1)))) |v_#memory_int_15|) (<= (+ v_ULTIMATE.start_main_~y~0.offset_10 4) (select |v_#length_20| v_ULTIMATE.start_main_~y~0.base_13)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_10)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_13, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_10, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 1332#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1355#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1354#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1353#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1351#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1349#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1317#L9 31.22/14.17 [2019-03-28 12:46:40,228 INFO L796 eck$LassoCheckResult]: Loop: 1317#L9 [129] L9-->L10: Formula: (< 0 |v_ULTIMATE.start_main_#t~nondet5_3|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5] 1318#L10 [65] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem6_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6] 1321#L10-1 [155] L10-1-->L9-2: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~x~0.base_17)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_17) v_ULTIMATE.start_main_~x~0.offset_13 (+ |v_ULTIMATE.start_main_#t~mem6_6| (- 1)))) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_13 4) (select |v_#length_19| v_ULTIMATE.start_main_~x~0.base_17)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_13)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_13, #length=|v_#length_19|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_17, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem6] 1313#L9-2 [59] L9-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1314#L8-1 [121] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1311#L8-2 [76] L8-2-->L8-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1307#L8-3 [73] L8-3-->L8-4: Formula: (and (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~y~0.base_4)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4) |v_ULTIMATE.start_main_#t~mem3_2|) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1308#L8-4 [127] L8-4-->L8-6: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem3_3|) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1333#L8-6 [90] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1317#L9 31.22/14.17 [2019-03-28 12:46:40,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1441882102, now seen corresponding path program 2 times 31.22/14.17 [2019-03-28 12:46:40,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2110938160, now seen corresponding path program 5 times 31.22/14.17 [2019-03-28 12:46:40,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:40,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:40,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1060325817, now seen corresponding path program 1 times 31.22/14.17 [2019-03-28 12:46:40,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.22/14.17 [2019-03-28 12:46:40,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.22/14.17 [2019-03-28 12:46:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.22/14.17 [2019-03-28 12:46:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:40,626 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 31.22/14.17 [2019-03-28 12:46:40,697 INFO L216 LassoAnalysis]: Preferences: 31.22/14.17 [2019-03-28 12:46:40,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.22/14.17 [2019-03-28 12:46:40,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.22/14.17 [2019-03-28 12:46:40,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.22/14.17 [2019-03-28 12:46:40,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.22/14.17 [2019-03-28 12:46:40,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.22/14.17 [2019-03-28 12:46:40,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.22/14.17 [2019-03-28 12:46:40,698 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.22/14.17 [2019-03-28 12:46:40,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso 31.22/14.17 [2019-03-28 12:46:40,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.22/14.17 [2019-03-28 12:46:40,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.22/14.17 [2019-03-28 12:46:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:40,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.22/14.17 [2019-03-28 12:46:41,119 INFO L300 LassoAnalysis]: Preprocessing complete. 31.22/14.17 [2019-03-28 12:46:41,120 INFO L497 LassoAnalysis]: Using template 'affine'. 31.22/14.17 [2019-03-28 12:46:41,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.22/14.17 [2019-03-28 12:46:41,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.22/14.17 [2019-03-28 12:46:41,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.22/14.17 Termination analysis: LINEAR_WITH_GUESSES 31.22/14.17 Number of strict supporting invariants: 0 31.22/14.17 Number of non-strict supporting invariants: 1 31.22/14.17 Consider only non-deceasing supporting invariants: true 31.22/14.17 Simplify termination arguments: true 31.22/14.17 Simplify supporting invariants: trueOverapproximate stem: false 31.22/14.17 [2019-03-28 12:46:41,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.22/14.17 [2019-03-28 12:46:41,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.22/14.17 [2019-03-28 12:46:41,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.22/14.17 [2019-03-28 12:46:41,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.22/14.17 [2019-03-28 12:46:41,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.22/14.17 [2019-03-28 12:46:41,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.22/14.17 [2019-03-28 12:46:41,147 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.22/14.17 [2019-03-28 12:46:41,151 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 31.22/14.17 [2019-03-28 12:46:41,151 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. 31.22/14.17 [2019-03-28 12:46:41,151 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.22/14.17 [2019-03-28 12:46:41,152 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 31.22/14.17 [2019-03-28 12:46:41,152 INFO L518 LassoAnalysis]: Proved termination. 31.22/14.17 [2019-03-28 12:46:41,152 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.22/14.17 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_6 31.22/14.17 Supporting invariants [] 31.22/14.17 [2019-03-28 12:46:41,178 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 31.22/14.17 [2019-03-28 12:46:41,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.22/14.17 [2019-03-28 12:46:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.22/14.17 [2019-03-28 12:46:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:41,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:41,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:41,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:41,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:41,239 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 28 treesize of output 16 31.22/14.17 [2019-03-28 12:46:41,240 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:41,244 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:41,245 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:41,245 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.22/14.17 [2019-03-28 12:46:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.22/14.17 [2019-03-28 12:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:41,308 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:41,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:41,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.22/14.17 [2019-03-28 12:46:41,388 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.22/14.17 [2019-03-28 12:46:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.22/14.17 [2019-03-28 12:46:41,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core 31.22/14.17 [2019-03-28 12:46:41,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.22/14.17 [2019-03-28 12:46:41,400 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 28 treesize of output 16 31.22/14.17 [2019-03-28 12:46:41,401 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:41,406 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.22/14.17 [2019-03-28 12:46:41,406 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.22/14.17 [2019-03-28 12:46:41,406 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 31.22/14.17 [2019-03-28 12:46:41,412 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 31.22/14.17 [2019-03-28 12:46:41,412 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 5 loop predicates 31.22/14.17 [2019-03-28 12:46:41,412 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 49 states and 60 transitions. cyclomatic complexity: 14 Second operand 7 states. 31.22/14.17 [2019-03-28 12:46:41,562 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 49 states and 60 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 166 states and 198 transitions. Complement of second has 31 states. 31.22/14.17 [2019-03-28 12:46:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 2 accepting loop states 31.22/14.17 [2019-03-28 12:46:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 31.22/14.17 [2019-03-28 12:46:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. 31.22/14.17 [2019-03-28 12:46:41,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 18 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:41,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:41,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 27 letters. Loop has 9 letters. 31.22/14.17 [2019-03-28 12:46:41,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:41,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 39 transitions. Stem has 18 letters. Loop has 18 letters. 31.22/14.17 [2019-03-28 12:46:41,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.22/14.17 [2019-03-28 12:46:41,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 198 transitions. 31.22/14.17 [2019-03-28 12:46:41,570 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.22/14.17 [2019-03-28 12:46:41,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 31.22/14.17 [2019-03-28 12:46:41,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 31.22/14.17 [2019-03-28 12:46:41,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.22/14.17 [2019-03-28 12:46:41,570 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,570 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,571 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,571 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 31.22/14.17 [2019-03-28 12:46:41,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 31.22/14.17 [2019-03-28 12:46:41,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.22/14.17 [2019-03-28 12:46:41,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 31.22/14.17 [2019-03-28 12:46:41,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:41 BasicIcfg 31.22/14.17 [2019-03-28 12:46:41,577 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 31.22/14.17 [2019-03-28 12:46:41,578 INFO L168 Benchmark]: Toolchain (without parser) took 9691.84 ms. Allocated memory was 649.6 MB in the beginning and 863.0 MB in the end (delta: 213.4 MB). Free memory was 558.5 MB in the beginning and 580.3 MB in the end (delta: -21.9 MB). Peak memory consumption was 191.5 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,579 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.52 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 558.5 MB in the beginning and 651.6 MB in the end (delta: -93.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 684.2 MB. Free memory was 651.6 MB in the beginning and 648.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,580 INFO L168 Benchmark]: Boogie Preprocessor took 23.07 ms. Allocated memory is still 684.2 MB. Free memory was 648.5 MB in the beginning and 647.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,581 INFO L168 Benchmark]: RCFGBuilder took 281.84 ms. Allocated memory is still 684.2 MB. Free memory was 647.2 MB in the beginning and 625.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,581 INFO L168 Benchmark]: BlockEncodingV2 took 126.86 ms. Allocated memory is still 684.2 MB. Free memory was 625.1 MB in the beginning and 617.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,582 INFO L168 Benchmark]: TraceAbstraction took 997.33 ms. Allocated memory is still 684.2 MB. Free memory was 615.6 MB in the beginning and 518.9 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,582 INFO L168 Benchmark]: BuchiAutomizer took 7923.04 ms. Allocated memory was 684.2 MB in the beginning and 863.0 MB in the end (delta: 178.8 MB). Free memory was 518.9 MB in the beginning and 580.3 MB in the end (delta: -61.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 50.3 GB. 31.22/14.17 [2019-03-28 12:46:41,586 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 31.22/14.17 --- Results --- 31.22/14.17 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 31.22/14.17 - StatisticsResult: Initial Icfg 31.22/14.17 35 locations, 38 edges 31.22/14.17 - StatisticsResult: Encoded RCFG 31.22/14.17 28 locations, 50 edges 31.22/14.17 * Results from de.uni_freiburg.informatik.ultimate.core: 31.22/14.17 - StatisticsResult: Toolchain Benchmarks 31.22/14.17 Benchmark results are: 31.22/14.17 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 31.22/14.17 * CACSL2BoogieTranslator took 295.52 ms. Allocated memory was 649.6 MB in the beginning and 684.2 MB in the end (delta: 34.6 MB). Free memory was 558.5 MB in the beginning and 651.6 MB in the end (delta: -93.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 31.22/14.17 * Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 684.2 MB. Free memory was 651.6 MB in the beginning and 648.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 31.22/14.17 * Boogie Preprocessor took 23.07 ms. Allocated memory is still 684.2 MB. Free memory was 648.5 MB in the beginning and 647.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 31.22/14.17 * RCFGBuilder took 281.84 ms. Allocated memory is still 684.2 MB. Free memory was 647.2 MB in the beginning and 625.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 31.22/14.17 * BlockEncodingV2 took 126.86 ms. Allocated memory is still 684.2 MB. Free memory was 625.1 MB in the beginning and 617.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 31.22/14.17 * TraceAbstraction took 997.33 ms. Allocated memory is still 684.2 MB. Free memory was 615.6 MB in the beginning and 518.9 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 50.3 GB. 31.22/14.17 * BuchiAutomizer took 7923.04 ms. Allocated memory was 684.2 MB in the beginning and 863.0 MB in the end (delta: 178.8 MB). Free memory was 518.9 MB in the beginning and 580.3 MB in the end (delta: -61.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 50.3 GB. 31.22/14.17 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #length 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #length 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #length 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #length 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 - GenericResult: Unfinished Backtranslation 31.22/14.17 unknown boogie variable #memory_int 31.22/14.17 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 31.22/14.17 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 8]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 8]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 8]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 8]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.22/14.17 For all program executions holds that pointer dereference always succeeds at this location 31.22/14.17 - AllSpecificationsHoldResult: All specifications hold 31.22/14.17 14 specifications checked. All of them hold 31.22/14.17 - InvariantResult [Line: 8]: Loop Invariant 31.22/14.17 [2019-03-28 12:46:41,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.22/14.17 [2019-03-28 12:46:41,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.22/14.17 [2019-03-28 12:46:41,595 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.22/14.17 [2019-03-28 12:46:41,596 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.22/14.17 Derived loop invariant: ((((\valid[y] == 1 && unknown-#length-unknown[y] == 4) && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[x]) && y == 0 31.22/14.17 - StatisticsResult: Ultimate Automizer benchmark data 31.22/14.17 CFG has 1 procedures, 28 locations, 14 error locations. SAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 150 SDslu, 4 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 31.22/14.17 - StatisticsResult: Constructed decomposition of program 31.22/14.17 Your program was decomposed into 8 terminating modules (2 trivial, 0 deterministic, 6 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 11 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. 31.22/14.17 - StatisticsResult: Timing statistics 31.22/14.17 BüchiAutomizer plugin needed 7.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 64 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 7. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 101 SDtfs, 316 SDslu, 204 SDs, 0 SdLazy, 494 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf100 lsp93 ukn78 mio100 lsp40 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 31.22/14.17 - TerminationAnalysisResult: Termination proven 31.22/14.17 Buchi Automizer proved that your program is terminating 31.22/14.17 RESULT: Ultimate proved your program to be correct! 31.22/14.17 !SESSION 2019-03-28 12:46:28.591 ----------------------------------------------- 31.22/14.17 eclipse.buildId=unknown 31.22/14.17 java.version=1.8.0_181 31.22/14.17 java.vendor=Oracle Corporation 31.22/14.17 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 31.22/14.17 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.22/14.17 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 31.22/14.17 31.22/14.17 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:41.824 31.22/14.17 !MESSAGE The workspace will exit with unsaved changes in this session. 31.22/14.17 Received shutdown request... 31.22/14.17 Ultimate: 31.22/14.17 GTK+ Version Check 31.22/14.17 EOF