59.03/34.29 YES 59.03/34.29 59.03/34.29 Ultimate: Cannot open display: 59.03/34.29 This is Ultimate 0.1.24-8dc7c08-m 59.03/34.29 [2019-03-28 12:44:44,082 INFO L170 SettingsManager]: Resetting all preferences to default values... 59.03/34.29 [2019-03-28 12:44:44,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 59.03/34.29 [2019-03-28 12:44:44,096 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 59.03/34.29 [2019-03-28 12:44:44,097 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 59.03/34.29 [2019-03-28 12:44:44,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 59.03/34.29 [2019-03-28 12:44:44,100 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 59.03/34.29 [2019-03-28 12:44:44,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 59.03/34.29 [2019-03-28 12:44:44,102 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 59.03/34.29 [2019-03-28 12:44:44,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,103 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 59.03/34.29 [2019-03-28 12:44:44,104 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 59.03/34.29 [2019-03-28 12:44:44,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 59.03/34.29 [2019-03-28 12:44:44,106 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 59.03/34.29 [2019-03-28 12:44:44,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 59.03/34.29 [2019-03-28 12:44:44,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 59.03/34.29 [2019-03-28 12:44:44,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 59.03/34.29 [2019-03-28 12:44:44,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 59.03/34.29 [2019-03-28 12:44:44,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 59.03/34.29 [2019-03-28 12:44:44,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 59.03/34.29 [2019-03-28 12:44:44,115 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 59.03/34.29 [2019-03-28 12:44:44,117 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,117 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 59.03/34.29 [2019-03-28 12:44:44,118 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 59.03/34.29 [2019-03-28 12:44:44,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 59.03/34.29 [2019-03-28 12:44:44,120 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 59.03/34.29 [2019-03-28 12:44:44,120 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 59.03/34.29 [2019-03-28 12:44:44,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 59.03/34.29 [2019-03-28 12:44:44,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 59.03/34.29 [2019-03-28 12:44:44,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 59.03/34.29 [2019-03-28 12:44:44,124 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 59.03/34.29 [2019-03-28 12:44:44,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 59.03/34.29 [2019-03-28 12:44:44,125 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 59.03/34.29 [2019-03-28 12:44:44,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 59.03/34.29 [2019-03-28 12:44:44,126 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 59.03/34.29 [2019-03-28 12:44:44,141 INFO L110 SettingsManager]: Loading preferences was successful 59.03/34.29 [2019-03-28 12:44:44,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 59.03/34.29 [2019-03-28 12:44:44,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 59.03/34.29 [2019-03-28 12:44:44,143 INFO L133 SettingsManager]: * Rewrite not-equals=true 59.03/34.29 [2019-03-28 12:44:44,143 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 59.03/34.29 [2019-03-28 12:44:44,143 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 59.03/34.29 [2019-03-28 12:44:44,143 INFO L133 SettingsManager]: * Use SBE=true 59.03/34.29 [2019-03-28 12:44:44,143 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Use old map elimination=false 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 59.03/34.29 [2019-03-28 12:44:44,144 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 59.03/34.29 [2019-03-28 12:44:44,145 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 59.03/34.29 [2019-03-28 12:44:44,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 59.03/34.29 [2019-03-28 12:44:44,145 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 59.03/34.29 [2019-03-28 12:44:44,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE 59.03/34.29 [2019-03-28 12:44:44,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 59.03/34.29 [2019-03-28 12:44:44,146 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 59.03/34.29 [2019-03-28 12:44:44,146 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 59.03/34.29 [2019-03-28 12:44:44,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 59.03/34.29 [2019-03-28 12:44:44,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 59.03/34.29 [2019-03-28 12:44:44,146 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 59.03/34.29 [2019-03-28 12:44:44,146 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 59.03/34.29 [2019-03-28 12:44:44,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 59.03/34.29 [2019-03-28 12:44:44,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 59.03/34.29 [2019-03-28 12:44:44,147 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 59.03/34.29 [2019-03-28 12:44:44,147 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 59.03/34.29 [2019-03-28 12:44:44,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 59.03/34.29 [2019-03-28 12:44:44,186 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 59.03/34.29 [2019-03-28 12:44:44,190 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 59.03/34.29 [2019-03-28 12:44:44,191 INFO L271 PluginConnector]: Initializing CDTParser... 59.03/34.29 [2019-03-28 12:44:44,192 INFO L276 PluginConnector]: CDTParser initialized 59.03/34.29 [2019-03-28 12:44:44,193 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 59.03/34.29 [2019-03-28 12:44:44,251 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/278b8676387c467ba7a1d209dc86c42b/FLAGba7d9c434 59.03/34.29 [2019-03-28 12:44:44,606 INFO L307 CDTParser]: Found 1 translation units. 59.03/34.29 [2019-03-28 12:44:44,607 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 59.03/34.29 [2019-03-28 12:44:44,607 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 59.03/34.29 [2019-03-28 12:44:44,614 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/278b8676387c467ba7a1d209dc86c42b/FLAGba7d9c434 59.03/34.29 [2019-03-28 12:44:45,014 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/278b8676387c467ba7a1d209dc86c42b 59.03/34.29 [2019-03-28 12:44:45,026 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 59.03/34.29 [2019-03-28 12:44:45,028 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 59.03/34.29 [2019-03-28 12:44:45,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 59.03/34.29 [2019-03-28 12:44:45,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 59.03/34.29 [2019-03-28 12:44:45,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 59.03/34.29 [2019-03-28 12:44:45,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0df479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45, skipping insertion in model container 59.03/34.29 [2019-03-28 12:44:45,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 59.03/34.29 [2019-03-28 12:44:45,062 INFO L176 MainTranslator]: Built tables and reachable declarations 59.03/34.29 [2019-03-28 12:44:45,226 INFO L206 PostProcessor]: Analyzing one entry point: main 59.03/34.29 [2019-03-28 12:44:45,238 INFO L191 MainTranslator]: Completed pre-run 59.03/34.29 [2019-03-28 12:44:45,314 INFO L206 PostProcessor]: Analyzing one entry point: main 59.03/34.29 [2019-03-28 12:44:45,330 INFO L195 MainTranslator]: Completed translation 59.03/34.29 [2019-03-28 12:44:45,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45 WrapperNode 59.03/34.29 [2019-03-28 12:44:45,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 59.03/34.29 [2019-03-28 12:44:45,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 59.03/34.29 [2019-03-28 12:44:45,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 59.03/34.29 [2019-03-28 12:44:45,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 59.03/34.29 [2019-03-28 12:44:45,341 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:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,350 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:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 59.03/34.29 [2019-03-28 12:44:45,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 59.03/34.29 [2019-03-28 12:44:45,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 59.03/34.29 [2019-03-28 12:44:45,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized 59.03/34.29 [2019-03-28 12:44:45,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 59.03/34.29 [2019-03-28 12:44:45,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 59.03/34.29 [2019-03-28 12:44:45,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... 59.03/34.29 [2019-03-28 12:44:45,400 INFO L276 PluginConnector]: RCFGBuilder initialized 59.03/34.29 [2019-03-28 12:44:45,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (1/1) ... 59.03/34.29 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 59.03/34.29 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 59.03/34.29 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 59.03/34.29 [2019-03-28 12:44:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 59.03/34.29 [2019-03-28 12:44:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 59.03/34.29 [2019-03-28 12:44:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 59.03/34.29 [2019-03-28 12:44:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 59.03/34.29 [2019-03-28 12:44:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 59.03/34.29 [2019-03-28 12:44:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 59.03/34.29 [2019-03-28 12:44:45,854 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 59.03/34.29 [2019-03-28 12:44:45,854 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 59.03/34.29 [2019-03-28 12:44:45,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:45 BoogieIcfgContainer 59.03/34.29 [2019-03-28 12:44:45,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 59.03/34.29 [2019-03-28 12:44:45,857 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 59.03/34.29 [2019-03-28 12:44:45,857 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 59.03/34.29 [2019-03-28 12:44:45,859 INFO L276 PluginConnector]: BlockEncodingV2 initialized 59.03/34.29 [2019-03-28 12:44:45,860 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:45" (1/1) ... 59.03/34.29 [2019-03-28 12:44:45,880 INFO L313 BlockEncoder]: Initial Icfg 80 locations, 85 edges 59.03/34.29 [2019-03-28 12:44:45,882 INFO L258 BlockEncoder]: Using Remove infeasible edges 59.03/34.29 [2019-03-28 12:44:45,883 INFO L263 BlockEncoder]: Using Maximize final states 59.03/34.29 [2019-03-28 12:44:45,883 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 59.03/34.29 [2019-03-28 12:44:45,884 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 59.03/34.29 [2019-03-28 12:44:45,885 INFO L296 BlockEncoder]: Using Remove sink states 59.03/34.29 [2019-03-28 12:44:45,886 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 59.03/34.29 [2019-03-28 12:44:45,886 INFO L179 BlockEncoder]: Using Rewrite not-equals 59.03/34.29 [2019-03-28 12:44:45,921 INFO L185 BlockEncoder]: Using Use SBE 59.03/34.29 [2019-03-28 12:44:45,971 INFO L200 BlockEncoder]: SBE split 43 edges 59.03/34.29 [2019-03-28 12:44:45,976 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 59.03/34.29 [2019-03-28 12:44:45,978 INFO L71 MaximizeFinalStates]: 0 new accepting states 59.03/34.29 [2019-03-28 12:44:46,014 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding 59.03/34.29 [2019-03-28 12:44:46,017 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 59.03/34.29 [2019-03-28 12:44:46,019 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 59.03/34.29 [2019-03-28 12:44:46,019 INFO L71 MaximizeFinalStates]: 0 new accepting states 59.03/34.29 [2019-03-28 12:44:46,019 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 59.03/34.29 [2019-03-28 12:44:46,020 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 59.03/34.29 [2019-03-28 12:44:46,021 INFO L313 BlockEncoder]: Encoded RCFG 69 locations, 121 edges 59.03/34.29 [2019-03-28 12:44:46,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:46 BasicIcfg 59.03/34.29 [2019-03-28 12:44:46,021 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 59.03/34.29 [2019-03-28 12:44:46,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 59.03/34.29 [2019-03-28 12:44:46,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... 59.03/34.29 [2019-03-28 12:44:46,026 INFO L276 PluginConnector]: TraceAbstraction initialized 59.03/34.29 [2019-03-28 12:44:46,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:45" (1/4) ... 59.03/34.29 [2019-03-28 12:44:46,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df10412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:46, skipping insertion in model container 59.03/34.29 [2019-03-28 12:44:46,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (2/4) ... 59.03/34.29 [2019-03-28 12:44:46,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df10412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:46, skipping insertion in model container 59.03/34.29 [2019-03-28 12:44:46,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:45" (3/4) ... 59.03/34.29 [2019-03-28 12:44:46,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df10412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:46, skipping insertion in model container 59.03/34.29 [2019-03-28 12:44:46,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:46" (4/4) ... 59.03/34.29 [2019-03-28 12:44:46,030 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 59.03/34.29 [2019-03-28 12:44:46,040 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 59.03/34.29 [2019-03-28 12:44:46,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. 59.03/34.29 [2019-03-28 12:44:46,065 INFO L257 AbstractCegarLoop]: Starting to check reachability of 42 error locations. 59.03/34.29 [2019-03-28 12:44:46,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation 59.03/34.29 [2019-03-28 12:44:46,095 INFO L382 AbstractCegarLoop]: Interprodecural is true 59.03/34.29 [2019-03-28 12:44:46,096 INFO L383 AbstractCegarLoop]: Hoare is true 59.03/34.29 [2019-03-28 12:44:46,096 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 59.03/34.29 [2019-03-28 12:44:46,096 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 59.03/34.29 [2019-03-28 12:44:46,096 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 59.03/34.29 [2019-03-28 12:44:46,096 INFO L387 AbstractCegarLoop]: Difference is false 59.03/34.29 [2019-03-28 12:44:46,096 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 59.03/34.29 [2019-03-28 12:44:46,097 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 59.03/34.29 [2019-03-28 12:44:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. 59.03/34.29 [2019-03-28 12:44:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 59.03/34.29 [2019-03-28 12:44:46,119 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:46,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 59.03/34.29 [2019-03-28 12:44:46,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 170260, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:46,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:46,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:46,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:46,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:46,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:46,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:46,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:46,351 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:46,618 INFO L93 Difference]: Finished difference Result 69 states and 121 transitions. 59.03/34.29 [2019-03-28 12:44:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:46,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 59.03/34.29 [2019-03-28 12:44:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:46,634 INFO L225 Difference]: With dead ends: 69 59.03/34.29 [2019-03-28 12:44:46,634 INFO L226 Difference]: Without dead ends: 62 59.03/34.29 [2019-03-28 12:44:46,638 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 59.03/34.29 [2019-03-28 12:44:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. 59.03/34.29 [2019-03-28 12:44:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. 59.03/34.29 [2019-03-28 12:44:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 59.03/34.29 [2019-03-28 12:44:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 107 transitions. 59.03/34.29 [2019-03-28 12:44:46,682 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 107 transitions. Word has length 3 59.03/34.29 [2019-03-28 12:44:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 107 transitions. 59.03/34.29 [2019-03-28 12:44:46,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 107 transitions. 59.03/34.29 [2019-03-28 12:44:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 59.03/34.29 [2019-03-28 12:44:46,684 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:46,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 59.03/34.29 [2019-03-28 12:44:46,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 170257, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:46,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:46,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:46,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:46,725 INFO L87 Difference]: Start difference. First operand 62 states and 107 transitions. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:46,888 INFO L93 Difference]: Finished difference Result 62 states and 107 transitions. 59.03/34.29 [2019-03-28 12:44:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:46,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 59.03/34.29 [2019-03-28 12:44:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:46,890 INFO L225 Difference]: With dead ends: 62 59.03/34.29 [2019-03-28 12:44:46,890 INFO L226 Difference]: Without dead ends: 54 59.03/34.29 [2019-03-28 12:44:46,892 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 59.03/34.29 [2019-03-28 12:44:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. 59.03/34.29 [2019-03-28 12:44:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. 59.03/34.29 [2019-03-28 12:44:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. 59.03/34.29 [2019-03-28 12:44:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 92 transitions. 59.03/34.29 [2019-03-28 12:44:46,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 92 transitions. Word has length 3 59.03/34.29 [2019-03-28 12:44:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:46,899 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 92 transitions. 59.03/34.29 [2019-03-28 12:44:46,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. 59.03/34.29 [2019-03-28 12:44:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 59.03/34.29 [2019-03-28 12:44:46,900 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:46,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 59.03/34.29 [2019-03-28 12:44:46,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 5275217, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:46,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:46,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:46,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:46,954 INFO L87 Difference]: Start difference. First operand 54 states and 92 transitions. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:47,082 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. 59.03/34.29 [2019-03-28 12:44:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:47,084 INFO L225 Difference]: With dead ends: 54 59.03/34.29 [2019-03-28 12:44:47,084 INFO L226 Difference]: Without dead ends: 45 59.03/34.29 [2019-03-28 12:44:47,085 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 59.03/34.29 [2019-03-28 12:44:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 59.03/34.29 [2019-03-28 12:44:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 59.03/34.29 [2019-03-28 12:44:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 59.03/34.29 [2019-03-28 12:44:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. 59.03/34.29 [2019-03-28 12:44:47,091 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:47,092 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. 59.03/34.29 [2019-03-28 12:44:47,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. 59.03/34.29 [2019-03-28 12:44:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 59.03/34.29 [2019-03-28 12:44:47,092 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:47,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 59.03/34.29 [2019-03-28 12:44:47,093 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash 5275219, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:47,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:47,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:47,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:47,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:47,129 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:47,234 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. 59.03/34.29 [2019-03-28 12:44:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:47,236 INFO L225 Difference]: With dead ends: 54 59.03/34.29 [2019-03-28 12:44:47,236 INFO L226 Difference]: Without dead ends: 45 59.03/34.29 [2019-03-28 12:44:47,237 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 59.03/34.29 [2019-03-28 12:44:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 59.03/34.29 [2019-03-28 12:44:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. 59.03/34.29 [2019-03-28 12:44:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 59.03/34.29 [2019-03-28 12:44:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. 59.03/34.29 [2019-03-28 12:44:47,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:47,242 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. 59.03/34.29 [2019-03-28 12:44:47,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. 59.03/34.29 [2019-03-28 12:44:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 59.03/34.29 [2019-03-28 12:44:47,242 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:47,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 59.03/34.29 [2019-03-28 12:44:47,243 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 5275220, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:47,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:47,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:47,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:47,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:47,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:47,280 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:47,373 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. 59.03/34.29 [2019-03-28 12:44:47,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:47,375 INFO L225 Difference]: With dead ends: 45 59.03/34.29 [2019-03-28 12:44:47,375 INFO L226 Difference]: Without dead ends: 36 59.03/34.29 [2019-03-28 12:44:47,376 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 59.03/34.29 [2019-03-28 12:44:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 59.03/34.29 [2019-03-28 12:44:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 59.03/34.29 [2019-03-28 12:44:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 59.03/34.29 [2019-03-28 12:44:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. 59.03/34.29 [2019-03-28 12:44:47,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 4 59.03/34.29 [2019-03-28 12:44:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:47,380 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 56 transitions. 59.03/34.29 [2019-03-28 12:44:47,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. 59.03/34.29 [2019-03-28 12:44:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 59.03/34.29 [2019-03-28 12:44:47,381 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.29 [2019-03-28 12:44:47,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.29 [2019-03-28 12:44:47,381 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.29 [2019-03-28 12:44:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.29 [2019-03-28 12:44:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734388, now seen corresponding path program 1 times 59.03/34.29 [2019-03-28 12:44:47,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.29 [2019-03-28 12:44:47,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.29 [2019-03-28 12:44:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.29 [2019-03-28 12:44:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.29 [2019-03-28 12:44:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.29 [2019-03-28 12:44:47,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.29 [2019-03-28 12:44:47,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.29 [2019-03-28 12:44:47,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.29 [2019-03-28 12:44:47,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.29 [2019-03-28 12:44:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.29 [2019-03-28 12:44:47,424 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. Second operand 3 states. 59.03/34.29 [2019-03-28 12:44:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.29 [2019-03-28 12:44:47,496 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. 59.03/34.29 [2019-03-28 12:44:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 59.03/34.29 [2019-03-28 12:44:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.29 [2019-03-28 12:44:47,497 INFO L225 Difference]: With dead ends: 36 59.03/34.29 [2019-03-28 12:44:47,497 INFO L226 Difference]: Without dead ends: 31 59.03/34.29 [2019-03-28 12:44:47,498 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 59.03/34.29 [2019-03-28 12:44:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 59.03/34.29 [2019-03-28 12:44:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 59.03/34.29 [2019-03-28 12:44:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 59.03/34.29 [2019-03-28 12:44:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. 59.03/34.29 [2019-03-28 12:44:47,501 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 59.03/34.29 [2019-03-28 12:44:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.29 [2019-03-28 12:44:47,502 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. 59.03/34.29 [2019-03-28 12:44:47,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.29 [2019-03-28 12:44:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. 59.03/34.29 [2019-03-28 12:44:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 59.03/34.30 [2019-03-28 12:44:47,502 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.30 [2019-03-28 12:44:47,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,503 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.30 [2019-03-28 12:44:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734386, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:44:47,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:44:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:44:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.30 [2019-03-28 12:44:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.30 [2019-03-28 12:44:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.30 [2019-03-28 12:44:47,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.30 [2019-03-28 12:44:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.30 [2019-03-28 12:44:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.30 [2019-03-28 12:44:47,538 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 3 states. 59.03/34.30 [2019-03-28 12:44:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.30 [2019-03-28 12:44:47,578 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. 59.03/34.30 [2019-03-28 12:44:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.30 [2019-03-28 12:44:47,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 59.03/34.30 [2019-03-28 12:44:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.30 [2019-03-28 12:44:47,579 INFO L225 Difference]: With dead ends: 36 59.03/34.30 [2019-03-28 12:44:47,579 INFO L226 Difference]: Without dead ends: 31 59.03/34.30 [2019-03-28 12:44:47,580 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 59.03/34.30 [2019-03-28 12:44:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 59.03/34.30 [2019-03-28 12:44:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 59.03/34.30 [2019-03-28 12:44:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 59.03/34.30 [2019-03-28 12:44:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. 59.03/34.30 [2019-03-28 12:44:47,584 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 12 59.03/34.30 [2019-03-28 12:44:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.30 [2019-03-28 12:44:47,584 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. 59.03/34.30 [2019-03-28 12:44:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.30 [2019-03-28 12:44:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. 59.03/34.30 [2019-03-28 12:44:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 59.03/34.30 [2019-03-28 12:44:47,585 INFO L394 BasicCegarLoop]: Found error trace 59.03/34.30 [2019-03-28 12:44:47,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION]=== 59.03/34.30 [2019-03-28 12:44:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1834734385, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:44:47,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:44:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:44:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.30 [2019-03-28 12:44:47,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 59.03/34.30 [2019-03-28 12:44:47,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 59.03/34.30 [2019-03-28 12:44:47,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 59.03/34.30 [2019-03-28 12:44:47,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 59.03/34.30 [2019-03-28 12:44:47,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.30 [2019-03-28 12:44:47,626 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 3 states. 59.03/34.30 [2019-03-28 12:44:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 59.03/34.30 [2019-03-28 12:44:47,693 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. 59.03/34.30 [2019-03-28 12:44:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 59.03/34.30 [2019-03-28 12:44:47,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 59.03/34.30 [2019-03-28 12:44:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 59.03/34.30 [2019-03-28 12:44:47,695 INFO L225 Difference]: With dead ends: 31 59.03/34.30 [2019-03-28 12:44:47,695 INFO L226 Difference]: Without dead ends: 0 59.03/34.30 [2019-03-28 12:44:47,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 59.03/34.30 [2019-03-28 12:44:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 59.03/34.30 [2019-03-28 12:44:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 59.03/34.30 [2019-03-28 12:44:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 59.03/34.30 [2019-03-28 12:44:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:44:47,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 59.03/34.30 [2019-03-28 12:44:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. 59.03/34.30 [2019-03-28 12:44:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:44:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 59.03/34.30 [2019-03-28 12:44:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:44:47,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 59.03/34.30 [2019-03-28 12:44:47,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,731 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,732 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,732 INFO L448 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,735 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,735 INFO L444 ceAbstractionStarter]: At program point L16-4(lines 16 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_gcd_~r~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~r~0.base)) (= (select |#valid| ULTIMATE.start_gcd_~x_ref~0.base) 1) (= ULTIMATE.start_gcd_~x_ref~0.offset 0) (= ULTIMATE.start_gcd_~y_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_gcd_~r~0.base) 1) (= (select |#valid| ULTIMATE.start_gcd_~y_ref~0.base) 1) (= (select |#length| ULTIMATE.start_gcd_~x_ref~0.base) 4) (= (select |#length| ULTIMATE.start_gcd_~y_ref~0.base) 4)) 59.03/34.30 [2019-03-28 12:44:47,735 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,735 INFO L448 ceAbstractionStarter]: For program point L16-5(lines 16 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,736 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 21) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 5 23) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 13 21) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,737 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,738 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 59.03/34.30 [2019-03-28 12:44:47,741 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 59.03/34.30 [2019-03-28 12:44:47,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:44:47,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:47 BasicIcfg 59.03/34.30 [2019-03-28 12:44:47,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 59.03/34.30 [2019-03-28 12:44:47,762 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 59.03/34.30 [2019-03-28 12:44:47,762 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 59.03/34.30 [2019-03-28 12:44:47,765 INFO L276 PluginConnector]: BuchiAutomizer initialized 59.03/34.30 [2019-03-28 12:44:47,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.03/34.30 [2019-03-28 12:44:47,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:45" (1/5) ... 59.03/34.30 [2019-03-28 12:44:47,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15685291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:47, skipping insertion in model container 59.03/34.30 [2019-03-28 12:44:47,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.03/34.30 [2019-03-28 12:44:47,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:45" (2/5) ... 59.03/34.30 [2019-03-28 12:44:47,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15685291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:47, skipping insertion in model container 59.03/34.30 [2019-03-28 12:44:47,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.03/34.30 [2019-03-28 12:44:47,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:45" (3/5) ... 59.03/34.30 [2019-03-28 12:44:47,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15685291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:47, skipping insertion in model container 59.03/34.30 [2019-03-28 12:44:47,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.03/34.30 [2019-03-28 12:44:47,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:46" (4/5) ... 59.03/34.30 [2019-03-28 12:44:47,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15685291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:47, skipping insertion in model container 59.03/34.30 [2019-03-28 12:44:47,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 59.03/34.30 [2019-03-28 12:44:47,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:47" (5/5) ... 59.03/34.30 [2019-03-28 12:44:47,770 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 59.03/34.30 [2019-03-28 12:44:47,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation 59.03/34.30 [2019-03-28 12:44:47,801 INFO L374 BuchiCegarLoop]: Interprodecural is true 59.03/34.30 [2019-03-28 12:44:47,801 INFO L375 BuchiCegarLoop]: Hoare is true 59.03/34.30 [2019-03-28 12:44:47,801 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 59.03/34.30 [2019-03-28 12:44:47,801 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 59.03/34.30 [2019-03-28 12:44:47,801 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 59.03/34.30 [2019-03-28 12:44:47,801 INFO L379 BuchiCegarLoop]: Difference is false 59.03/34.30 [2019-03-28 12:44:47,802 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 59.03/34.30 [2019-03-28 12:44:47,802 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 59.03/34.30 [2019-03-28 12:44:47,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. 59.03/34.30 [2019-03-28 12:44:47,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 59.03/34.30 [2019-03-28 12:44:47,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.03/34.30 [2019-03-28 12:44:47,814 INFO L119 BuchiIsEmpty]: Starting construction of run 59.03/34.30 [2019-03-28 12:44:47,819 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,819 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,819 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 59.03/34.30 [2019-03-28 12:44:47,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. 59.03/34.30 [2019-03-28 12:44:47,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 59.03/34.30 [2019-03-28 12:44:47,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.03/34.30 [2019-03-28 12:44:47,823 INFO L119 BuchiIsEmpty]: Starting construction of run 59.03/34.30 [2019-03-28 12:44:47,824 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,824 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:44:47,830 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [138] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 11#L-1true [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 41#L9true [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 38#L9-1true [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 12#L10true [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 30#L11true [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 5#L11-5true [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 50#L12true [212] L12-->L13-2: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 65#L13-2true 59.03/34.30 [2019-03-28 12:44:47,831 INFO L796 eck$LassoCheckResult]: Loop: 65#L13-2true [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 68#L13true [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 18#L15true [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 32#L15-1true [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 51#L16-4true [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 34#L16-1true [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 54#L16-2true [234] L16-2-->L16-5: Formula: (> |v_ULTIMATE.start_gcd_#t~mem10_4| |v_ULTIMATE.start_gcd_#t~mem9_4|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_4|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_4|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_3|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 48#L16-5true [168] L16-5-->L19: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_17) (= 1 (select |v_#valid_39| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (= |v_ULTIMATE.start_gcd_#t~mem13_2| (select (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y_ref~0.base_24) v_ULTIMATE.start_gcd_~y_ref~0.offset_17))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13] 23#L19true [344] L19-->L20: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_22) (= (select |v_#valid_64| v_ULTIMATE.start_gcd_~x_ref~0.base_29) 1) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_22 4) (select |v_#length_54| v_ULTIMATE.start_gcd_~x_ref~0.base_29)) (= (store |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29 (store (select |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29) v_ULTIMATE.start_gcd_~x_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem13_6|)) |v_#memory_int_40|)) InVars {ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_41|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13, #memory_int] 43#L20true [159] L20-->L20-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_gcd_~r~0.base_15) 1) (= |v_ULTIMATE.start_gcd_#t~mem14_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_gcd_~r~0.base_15) v_ULTIMATE.start_gcd_~r~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_gcd_~r~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_11)) InVars {#memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} OutVars{ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_2|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14] 40#L20-1true [346] L20-1-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_22) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_22 4) (select |v_#length_56| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (= (store |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31 (store (select |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31) v_ULTIMATE.start_gcd_~y_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem14_6|)) |v_#memory_int_44|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_gcd_~y_ref~0.base_31))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_45|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_5|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_44|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14, #memory_int] 65#L13-2true 59.03/34.30 [2019-03-28 12:44:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1191654748, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:44:47,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:44:47,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:44:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1492953194, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:44:47,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:44:47,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:44:47,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash 899979539, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:44:47,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:44:47,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:44:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:44:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:48,440 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 59.03/34.30 [2019-03-28 12:44:48,611 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 83 59.03/34.30 [2019-03-28 12:44:48,625 INFO L216 LassoAnalysis]: Preferences: 59.03/34.30 [2019-03-28 12:44:48,626 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 59.03/34.30 [2019-03-28 12:44:48,626 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 59.03/34.30 [2019-03-28 12:44:48,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 59.03/34.30 [2019-03-28 12:44:48,627 INFO L127 ssoRankerPreferences]: Use exernal solver: false 59.03/34.30 [2019-03-28 12:44:48,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 59.03/34.30 [2019-03-28 12:44:48,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 59.03/34.30 [2019-03-28 12:44:48,627 INFO L130 ssoRankerPreferences]: Path of dumped script: 59.03/34.30 [2019-03-28 12:44:48,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 59.03/34.30 [2019-03-28 12:44:48,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 59.03/34.30 [2019-03-28 12:44:48,628 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 59.03/34.30 [2019-03-28 12:44:48,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:48,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:48,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:48,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:48,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:48,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,034 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 59.03/34.30 [2019-03-28 12:44:49,146 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 59.03/34.30 [2019-03-28 12:44:49,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:44:49,607 INFO L300 LassoAnalysis]: Preprocessing complete. 59.03/34.30 [2019-03-28 12:44:49,614 INFO L497 LassoAnalysis]: Using template 'affine'. 59.03/34.30 [2019-03-28 12:44:49,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:44:49,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:44:49,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:44:49,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:44:49,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:44:49,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:44:49,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:44:49,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:44:49,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:44:49,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:44:49,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:44:49,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:44:49,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:44:49,723 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 59.03/34.30 [2019-03-28 12:44:49,737 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 59.03/34.30 [2019-03-28 12:44:49,737 INFO L444 ModelExtractionUtils]: 28 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. 59.03/34.30 [2019-03-28 12:44:49,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 59.03/34.30 [2019-03-28 12:44:49,741 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 59.03/34.30 [2019-03-28 12:44:49,742 INFO L518 LassoAnalysis]: Proved termination. 59.03/34.30 [2019-03-28 12:44:49,742 INFO L520 LassoAnalysis]: Termination argument consisting of: 59.03/34.30 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_1 59.03/34.30 Supporting invariants [] 59.03/34.30 [2019-03-28 12:44:49,833 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 59.03/34.30 [2019-03-28 12:44:49,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.03/34.30 [2019-03-28 12:44:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:44:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:49,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:44:49,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:44:49,943 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 59.03/34.30 [2019-03-28 12:44:49,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:49,952 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:49,952 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:49,953 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 59.03/34.30 [2019-03-28 12:44:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:49,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:44:49,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:44:50,038 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:50,039 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 1 case distinctions, treesize of input 26 treesize of output 45 59.03/34.30 [2019-03-28 12:44:50,043 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:50,079 INFO L497 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size 59.03/34.30 [2019-03-28 12:44:50,080 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:50,080 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 59.03/34.30 [2019-03-28 12:44:50,233 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:50,234 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 69 59.03/34.30 [2019-03-28 12:44:50,239 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:50,286 INFO L497 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size 59.03/34.30 [2019-03-28 12:44:50,287 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:50,287 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:53 59.03/34.30 [2019-03-28 12:44:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.30 [2019-03-28 12:44:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:51,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:44:51,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:44:51,128 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:51,129 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 1 case distinctions, treesize of input 19 treesize of output 42 59.03/34.30 [2019-03-28 12:44:51,130 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,156 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 59.03/34.30 [2019-03-28 12:44:51,157 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,157 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 59.03/34.30 [2019-03-28 12:44:51,376 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:51,377 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 66 59.03/34.30 [2019-03-28 12:44:51,381 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,418 INFO L497 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size 59.03/34.30 [2019-03-28 12:44:51,419 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,419 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:43 59.03/34.30 [2019-03-28 12:44:51,555 INFO L189 IndexEqualityManager]: detected not equals via solver 59.03/34.30 [2019-03-28 12:44:51,557 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 59.03/34.30 [2019-03-28 12:44:51,558 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,583 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:44:51,583 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 59.03/34.30 [2019-03-28 12:44:51,590 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,656 INFO L497 ElimStorePlain]: treesize reduction 37, result has 67.0 percent of original size 59.03/34.30 [2019-03-28 12:44:51,657 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 59.03/34.30 [2019-03-28 12:44:51,658 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:68 59.03/34.30 [2019-03-28 12:44:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:44:52,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:44:52,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:44:52,302 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size 59.03/34.30 [2019-03-28 12:44:52,303 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 59.03/34.30 [2019-03-28 12:44:52,303 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:52,321 INFO L497 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size 59.03/34.30 [2019-03-28 12:44:52,322 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:52,322 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 59.03/34.30 [2019-03-28 12:44:52,490 INFO L340 Elim1Store]: treesize reduction 24, result has 72.4 percent of original size 59.03/34.30 [2019-03-28 12:44:52,491 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 81 59.03/34.30 [2019-03-28 12:44:52,495 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:52,543 INFO L497 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size 59.03/34.30 [2019-03-28 12:44:52,543 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:44:52,544 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:65 59.03/34.30 [2019-03-28 12:44:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:53,858 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:44:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:53,870 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:44:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:53,883 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:44:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:53,900 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:44:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:44:53,914 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:44:53,914 INFO L98 LoopCannibalizer]: 26 predicates before loop cannibalization 46 predicates after loop cannibalization 59.03/34.30 [2019-03-28 12:44:53,921 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 46 loop predicates 59.03/34.30 [2019-03-28 12:44:53,921 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 69 states. Second operand 11 states. 59.03/34.30 [2019-03-28 12:45:01,220 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 27 59.03/34.30 [2019-03-28 12:45:03,873 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 69 states.. Second operand 11 states. Result 207 states and 352 transitions. Complement of second has 36 states. 59.03/34.30 [2019-03-28 12:45:03,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 2 stem states 16 non-accepting loop states 2 accepting loop states 59.03/34.30 [2019-03-28 12:45:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 59.03/34.30 [2019-03-28 12:45:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 238 transitions. 59.03/34.30 [2019-03-28 12:45:03,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 8 letters. Loop has 11 letters. 59.03/34.30 [2019-03-28 12:45:03,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:03,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 19 letters. Loop has 11 letters. 59.03/34.30 [2019-03-28 12:45:03,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:03,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 238 transitions. Stem has 8 letters. Loop has 22 letters. 59.03/34.30 [2019-03-28 12:45:03,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:03,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 352 transitions. 59.03/34.30 [2019-03-28 12:45:03,902 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 59.03/34.30 [2019-03-28 12:45:03,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 68 states and 82 transitions. 59.03/34.30 [2019-03-28 12:45:03,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 59.03/34.30 [2019-03-28 12:45:03,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 59.03/34.30 [2019-03-28 12:45:03,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. 59.03/34.30 [2019-03-28 12:45:03,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 59.03/34.30 [2019-03-28 12:45:03,906 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. 59.03/34.30 [2019-03-28 12:45:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. 59.03/34.30 [2019-03-28 12:45:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. 59.03/34.30 [2019-03-28 12:45:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. 59.03/34.30 [2019-03-28 12:45:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. 59.03/34.30 [2019-03-28 12:45:03,911 INFO L729 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. 59.03/34.30 [2019-03-28 12:45:03,911 INFO L609 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. 59.03/34.30 [2019-03-28 12:45:03,911 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 59.03/34.30 [2019-03-28 12:45:03,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. 59.03/34.30 [2019-03-28 12:45:03,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 59.03/34.30 [2019-03-28 12:45:03,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.03/34.30 [2019-03-28 12:45:03,913 INFO L119 BuchiIsEmpty]: Starting construction of run 59.03/34.30 [2019-03-28 12:45:03,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:45:03,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:45:03,914 INFO L794 eck$LassoCheckResult]: Stem: 688#ULTIMATE.startENTRY [138] 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] 666#L-1 [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 663#L9 [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 656#L9-1 [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 657#L10 [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 668#L11 [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 654#L11-5 [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 655#L12 [171] L12-->L12-1: Formula: (< |v_ULTIMATE.start_gcd_#t~mem5_4| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_4|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 673#L12-1 [165] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_19| v_ULTIMATE.start_gcd_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_gcd_~y_ref~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem6_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y_ref~0.base_9) v_ULTIMATE.start_gcd_~y_ref~0.offset_7))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_7, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 667#L12-2 [338] L12-2-->L13-2: Formula: (and (= (select |v_#valid_54| v_ULTIMATE.start_gcd_~y_ref~0.base_30) 1) (= (store |v_#memory_int_33| v_ULTIMATE.start_gcd_~y_ref~0.base_30 (store (select |v_#memory_int_33| v_ULTIMATE.start_gcd_~y_ref~0.base_30) v_ULTIMATE.start_gcd_~y_ref~0.offset_21 (- |v_ULTIMATE.start_gcd_#t~mem6_6|))) |v_#memory_int_32|) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_21) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_21 4) (select |v_#length_48| v_ULTIMATE.start_gcd_~y_ref~0.base_30))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_21, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_33|, #length=|v_#length_48|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_30} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_21, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_32|, #length=|v_#length_48|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6, #memory_int] 659#L13-2 59.03/34.30 [2019-03-28 12:45:03,915 INFO L796 eck$LassoCheckResult]: Loop: 659#L13-2 [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 699#L13 [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 697#L15 [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 695#L15-1 [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 694#L16-4 [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 693#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 691#L16-2 [234] L16-2-->L16-5: Formula: (> |v_ULTIMATE.start_gcd_#t~mem10_4| |v_ULTIMATE.start_gcd_#t~mem9_4|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_4|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_4|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_3|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 669#L16-5 [168] L16-5-->L19: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_17) (= 1 (select |v_#valid_39| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (= |v_ULTIMATE.start_gcd_#t~mem13_2| (select (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y_ref~0.base_24) v_ULTIMATE.start_gcd_~y_ref~0.offset_17))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13] 670#L19 [344] L19-->L20: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_22) (= (select |v_#valid_64| v_ULTIMATE.start_gcd_~x_ref~0.base_29) 1) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_22 4) (select |v_#length_54| v_ULTIMATE.start_gcd_~x_ref~0.base_29)) (= (store |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29 (store (select |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29) v_ULTIMATE.start_gcd_~x_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem13_6|)) |v_#memory_int_40|)) InVars {ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_41|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13, #memory_int] 664#L20 [159] L20-->L20-1: Formula: (and (= (select |v_#valid_43| v_ULTIMATE.start_gcd_~r~0.base_15) 1) (= |v_ULTIMATE.start_gcd_#t~mem14_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_gcd_~r~0.base_15) v_ULTIMATE.start_gcd_~r~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_gcd_~r~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_11)) InVars {#memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} OutVars{ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_2|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14] 658#L20-1 [346] L20-1-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_22) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_22 4) (select |v_#length_56| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (= (store |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31 (store (select |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31) v_ULTIMATE.start_gcd_~y_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem14_6|)) |v_#memory_int_44|) (= 1 (select |v_#valid_66| v_ULTIMATE.start_gcd_~y_ref~0.base_31))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_45|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_5|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_44|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14, #memory_int] 659#L13-2 59.03/34.30 [2019-03-28 12:45:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1576021256, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:45:03,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1492953194, now seen corresponding path program 2 times 59.03/34.30 [2019-03-28 12:45:03,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:03,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1560244177, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:45:03,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:03,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:03,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:04,580 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 59.03/34.30 [2019-03-28 12:45:04,731 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 59.03/34.30 [2019-03-28 12:45:04,735 INFO L216 LassoAnalysis]: Preferences: 59.03/34.30 [2019-03-28 12:45:04,735 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 59.03/34.30 [2019-03-28 12:45:04,735 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 59.03/34.30 [2019-03-28 12:45:04,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 59.03/34.30 [2019-03-28 12:45:04,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false 59.03/34.30 [2019-03-28 12:45:04,736 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 59.03/34.30 [2019-03-28 12:45:04,736 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 59.03/34.30 [2019-03-28 12:45:04,736 INFO L130 ssoRankerPreferences]: Path of dumped script: 59.03/34.30 [2019-03-28 12:45:04,736 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 59.03/34.30 [2019-03-28 12:45:04,736 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 59.03/34.30 [2019-03-28 12:45:04,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 59.03/34.30 [2019-03-28 12:45:04,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:04,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,116 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 59.03/34.30 [2019-03-28 12:45:05,235 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 59.03/34.30 [2019-03-28 12:45:05,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:05,684 INFO L300 LassoAnalysis]: Preprocessing complete. 59.03/34.30 [2019-03-28 12:45:05,684 INFO L497 LassoAnalysis]: Using template 'affine'. 59.03/34.30 [2019-03-28 12:45:05,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:05,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:05,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:05,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:05,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:05,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:05,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:05,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:05,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:05,788 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 59.03/34.30 [2019-03-28 12:45:05,807 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 59.03/34.30 [2019-03-28 12:45:05,807 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. 59.03/34.30 [2019-03-28 12:45:05,807 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 59.03/34.30 [2019-03-28 12:45:05,808 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 59.03/34.30 [2019-03-28 12:45:05,809 INFO L518 LassoAnalysis]: Proved termination. 59.03/34.30 [2019-03-28 12:45:05,809 INFO L520 LassoAnalysis]: Termination argument consisting of: 59.03/34.30 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_2 59.03/34.30 Supporting invariants [] 59.03/34.30 [2019-03-28 12:45:05,898 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed 59.03/34.30 [2019-03-28 12:45:05,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.03/34.30 [2019-03-28 12:45:05,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:05,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:05,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:05,949 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 59.03/34.30 [2019-03-28 12:45:05,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:05,957 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:05,958 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:05,958 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 59.03/34.30 [2019-03-28 12:45:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:05,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:05,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:06,026 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:06,026 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 1 case distinctions, treesize of input 26 treesize of output 45 59.03/34.30 [2019-03-28 12:45:06,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:06,061 INFO L497 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size 59.03/34.30 [2019-03-28 12:45:06,062 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:06,063 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 59.03/34.30 [2019-03-28 12:45:06,210 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:06,211 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 69 59.03/34.30 [2019-03-28 12:45:06,214 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:06,270 INFO L497 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size 59.03/34.30 [2019-03-28 12:45:06,271 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:06,287 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:53 59.03/34.30 [2019-03-28 12:45:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.30 [2019-03-28 12:45:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:06,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:06,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:07,016 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:07,017 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 1 case distinctions, treesize of input 19 treesize of output 42 59.03/34.30 [2019-03-28 12:45:07,018 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,044 INFO L497 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size 59.03/34.30 [2019-03-28 12:45:07,045 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,045 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 59.03/34.30 [2019-03-28 12:45:07,261 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:07,262 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 66 59.03/34.30 [2019-03-28 12:45:07,265 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,305 INFO L497 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size 59.03/34.30 [2019-03-28 12:45:07,306 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,306 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:43 59.03/34.30 [2019-03-28 12:45:07,441 INFO L189 IndexEqualityManager]: detected not equals via solver 59.03/34.30 [2019-03-28 12:45:07,443 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 59.03/34.30 [2019-03-28 12:45:07,444 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,466 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:07,466 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 69 59.03/34.30 [2019-03-28 12:45:07,471 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,537 INFO L497 ElimStorePlain]: treesize reduction 37, result has 67.0 percent of original size 59.03/34.30 [2019-03-28 12:45:07,539 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. 59.03/34.30 [2019-03-28 12:45:07,539 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:68 59.03/34.30 [2019-03-28 12:45:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:07,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:07,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:08,125 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size 59.03/34.30 [2019-03-28 12:45:08,125 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 59.03/34.30 [2019-03-28 12:45:08,126 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:08,171 INFO L497 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size 59.03/34.30 [2019-03-28 12:45:08,171 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:08,171 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 59.03/34.30 [2019-03-28 12:45:08,344 INFO L340 Elim1Store]: treesize reduction 24, result has 72.4 percent of original size 59.03/34.30 [2019-03-28 12:45:08,345 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 81 59.03/34.30 [2019-03-28 12:45:08,348 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:08,396 INFO L497 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size 59.03/34.30 [2019-03-28 12:45:08,397 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:08,397 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:65 59.03/34.30 [2019-03-28 12:45:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:09,756 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:09,767 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:09,778 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:09,788 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:09,800 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:09,800 INFO L98 LoopCannibalizer]: 26 predicates before loop cannibalization 48 predicates after loop cannibalization 59.03/34.30 [2019-03-28 12:45:09,801 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 48 loop predicates 59.03/34.30 [2019-03-28 12:45:09,801 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 50 states and 63 transitions. cyclomatic complexity: 16 Second operand 11 states. 59.03/34.30 [2019-03-28 12:45:12,560 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 50 states and 63 transitions. cyclomatic complexity: 16. Second operand 11 states. Result 82 states and 99 transitions. Complement of second has 32 states. 59.03/34.30 [2019-03-28 12:45:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 2 stem states 14 non-accepting loop states 2 accepting loop states 59.03/34.30 [2019-03-28 12:45:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 59.03/34.30 [2019-03-28 12:45:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. 59.03/34.30 [2019-03-28 12:45:12,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 10 letters. Loop has 11 letters. 59.03/34.30 [2019-03-28 12:45:12,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 21 letters. Loop has 11 letters. 59.03/34.30 [2019-03-28 12:45:12,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:12,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 63 transitions. Stem has 10 letters. Loop has 22 letters. 59.03/34.30 [2019-03-28 12:45:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:12,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 99 transitions. 59.03/34.30 [2019-03-28 12:45:12,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 59.03/34.30 [2019-03-28 12:45:12,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 78 states and 94 transitions. 59.03/34.30 [2019-03-28 12:45:12,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 59.03/34.30 [2019-03-28 12:45:12,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 59.03/34.30 [2019-03-28 12:45:12,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 94 transitions. 59.03/34.30 [2019-03-28 12:45:12,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 59.03/34.30 [2019-03-28 12:45:12,574 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 94 transitions. 59.03/34.30 [2019-03-28 12:45:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 94 transitions. 59.03/34.30 [2019-03-28 12:45:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 36. 59.03/34.30 [2019-03-28 12:45:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 59.03/34.30 [2019-03-28 12:45:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. 59.03/34.30 [2019-03-28 12:45:12,576 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. 59.03/34.30 [2019-03-28 12:45:12,577 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. 59.03/34.30 [2019-03-28 12:45:12,577 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 59.03/34.30 [2019-03-28 12:45:12,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. 59.03/34.30 [2019-03-28 12:45:12,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 59.03/34.30 [2019-03-28 12:45:12,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 59.03/34.30 [2019-03-28 12:45:12,578 INFO L119 BuchiIsEmpty]: Starting construction of run 59.03/34.30 [2019-03-28 12:45:12,578 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:45:12,578 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 59.03/34.30 [2019-03-28 12:45:12,579 INFO L794 eck$LassoCheckResult]: Stem: 1188#ULTIMATE.startENTRY [138] 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] 1168#L-1 [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_ULTIMATE.start_gcd_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_gcd_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_gcd_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (> |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 0) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 1165#L9 [156] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3)))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1161#L9-1 [150] L9-1-->L10: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1162#L10 [121] L10-->L11: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 1171#L11 [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 1159#L11-5 [113] L11-5-->L12: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 1160#L12 [212] L12-->L13-2: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 1170#L13-2 [192] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 1190#L13 [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 1181#L15 [126] L15-->L15-1: Formula: (and (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 1182#L15-1 [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18) 1) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 1175#L16-4 59.03/34.30 [2019-03-28 12:45:12,580 INFO L796 eck$LassoCheckResult]: Loop: 1175#L16-4 [174] L16-4-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 1155#L16-1 [146] L16-1-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13) (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 1156#L16-2 [178] L16-2-->L17: Formula: (<= |v_ULTIMATE.start_gcd_#t~mem10_6| |v_ULTIMATE.start_gcd_#t~mem9_6|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_6|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_6|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_5|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 1177#L17 [185] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_7) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_7 4) (select |v_#length_31| v_ULTIMATE.start_gcd_~r~0.base_9)) (= |v_ULTIMATE.start_gcd_#t~mem11_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_gcd_~r~0.base_9) v_ULTIMATE.start_gcd_~r~0.offset_7)) (= (select |v_#valid_33| v_ULTIMATE.start_gcd_~r~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_9, #valid=|v_#valid_33|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_7} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_9, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem11] 1185#L17-1 [182] L17-1-->L17-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_15) (= |v_ULTIMATE.start_gcd_#t~mem12_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_gcd_~y_ref~0.base_21) v_ULTIMATE.start_gcd_~y_ref~0.offset_15)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_15 4) (select |v_#length_33| v_ULTIMATE.start_gcd_~y_ref~0.base_21)) (= (select |v_#valid_35| v_ULTIMATE.start_gcd_~y_ref~0.base_21) 1)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_15, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_21, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_15, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_21, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem12] 1179#L17-2 [345] L17-2-->L16-4: Formula: (and (= |v_#memory_int_42| (store |v_#memory_int_43| v_ULTIMATE.start_gcd_~r~0.base_19 (store (select |v_#memory_int_43| v_ULTIMATE.start_gcd_~r~0.base_19) v_ULTIMATE.start_gcd_~r~0.offset_14 (+ |v_ULTIMATE.start_gcd_#t~mem11_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem12_6|))))) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_14 4) (select |v_#length_55| v_ULTIMATE.start_gcd_~r~0.base_19)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_14) (= 1 (select |v_#valid_65| v_ULTIMATE.start_gcd_~r~0.base_19))) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_19, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_43|, #length=|v_#length_55|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_6|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_14} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_19, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_42|, #length=|v_#length_55|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_5|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_14} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~mem12] 1175#L16-4 59.03/34.30 [2019-03-28 12:45:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:12,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1528491970, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:45:12,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:12,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:12,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1714329295, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:45:12,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 165922124, now seen corresponding path program 1 times 59.03/34.30 [2019-03-28 12:45:12,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 59.03/34.30 [2019-03-28 12:45:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 59.03/34.30 [2019-03-28 12:45:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 59.03/34.30 [2019-03-28 12:45:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:13,083 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 59.03/34.30 [2019-03-28 12:45:13,222 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 84 59.03/34.30 [2019-03-28 12:45:13,225 INFO L216 LassoAnalysis]: Preferences: 59.03/34.30 [2019-03-28 12:45:13,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 59.03/34.30 [2019-03-28 12:45:13,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 59.03/34.30 [2019-03-28 12:45:13,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 59.03/34.30 [2019-03-28 12:45:13,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false 59.03/34.30 [2019-03-28 12:45:13,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 59.03/34.30 [2019-03-28 12:45:13,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 59.03/34.30 [2019-03-28 12:45:13,226 INFO L130 ssoRankerPreferences]: Path of dumped script: 59.03/34.30 [2019-03-28 12:45:13,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 59.03/34.30 [2019-03-28 12:45:13,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 59.03/34.30 [2019-03-28 12:45:13,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 59.03/34.30 [2019-03-28 12:45:13,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,499 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 59.03/34.30 [2019-03-28 12:45:13,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 59.03/34.30 [2019-03-28 12:45:13,933 INFO L300 LassoAnalysis]: Preprocessing complete. 59.03/34.30 [2019-03-28 12:45:13,933 INFO L497 LassoAnalysis]: Using template 'affine'. 59.03/34.30 [2019-03-28 12:45:13,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 59.03/34.30 [2019-03-28 12:45:13,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,971 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,990 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:13,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:13,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:13,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:13,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:13,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:13,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:13,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:13,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:14,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 59.03/34.30 [2019-03-28 12:45:14,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 59.03/34.30 Termination analysis: LINEAR_WITH_GUESSES 59.03/34.30 Number of strict supporting invariants: 0 59.03/34.30 Number of non-strict supporting invariants: 1 59.03/34.30 Consider only non-deceasing supporting invariants: true 59.03/34.30 Simplify termination arguments: true 59.03/34.30 Simplify supporting invariants: trueOverapproximate stem: false 59.03/34.30 [2019-03-28 12:45:14,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. 59.03/34.30 [2019-03-28 12:45:14,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 59.03/34.30 [2019-03-28 12:45:14,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 59.03/34.30 [2019-03-28 12:45:14,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 59.03/34.30 [2019-03-28 12:45:14,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 59.03/34.30 [2019-03-28 12:45:14,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 59.03/34.30 [2019-03-28 12:45:14,014 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 59.03/34.30 [2019-03-28 12:45:14,021 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 59.03/34.30 [2019-03-28 12:45:14,022 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 0 variables to zero. 59.03/34.30 [2019-03-28 12:45:14,022 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 59.03/34.30 [2019-03-28 12:45:14,023 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 59.03/34.30 [2019-03-28 12:45:14,024 INFO L518 LassoAnalysis]: Proved termination. 59.03/34.30 [2019-03-28 12:45:14,024 INFO L520 LassoAnalysis]: Termination argument consisting of: 59.03/34.30 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3) = 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~r~0.base) ULTIMATE.start_gcd_~r~0.offset)_3 - 2*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 + 1 59.03/34.30 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_gcd_~y_ref~0.base) ULTIMATE.start_gcd_~y_ref~0.offset)_3 - 1 >= 0] 59.03/34.30 [2019-03-28 12:45:14,106 INFO L297 tatePredicateManager]: 18 out of 21 supporting invariants were superfluous and have been removed 59.03/34.30 [2019-03-28 12:45:14,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.03/34.30 [2019-03-28 12:45:14,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 59.03/34.30 [2019-03-28 12:45:14,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 59.03/34.30 [2019-03-28 12:45:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:14,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:14,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:14,162 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 59.03/34.30 [2019-03-28 12:45:14,163 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:14,169 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:14,169 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:14,169 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 59.03/34.30 [2019-03-28 12:45:14,210 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 59.03/34.30 [2019-03-28 12:45:14,211 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:14,217 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 59.03/34.30 [2019-03-28 12:45:14,217 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 59.03/34.30 [2019-03-28 12:45:14,217 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 59.03/34.30 [2019-03-28 12:45:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 59.03/34.30 [2019-03-28 12:45:14,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core 59.03/34.30 [2019-03-28 12:45:14,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... 59.03/34.30 [2019-03-28 12:45:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 59.03/34.30 [2019-03-28 12:45:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:14,508 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:14,515 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 59.03/34.30 [2019-03-28 12:45:14,522 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 59.03/34.30 [2019-03-28 12:45:14,523 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization 59.03/34.30 [2019-03-28 12:45:14,523 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates 59.03/34.30 [2019-03-28 12:45:14,523 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states and 48 transitions. cyclomatic complexity: 14 Second operand 10 states. 59.03/34.30 [2019-03-28 12:45:14,922 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states and 48 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 117 states and 135 transitions. Complement of second has 49 states. 59.03/34.30 [2019-03-28 12:45:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 4 stem states 12 non-accepting loop states 1 accepting loop states 59.03/34.30 [2019-03-28 12:45:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 59.03/34.30 [2019-03-28 12:45:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. 59.03/34.30 [2019-03-28 12:45:14,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 12 letters. Loop has 6 letters. 59.03/34.30 [2019-03-28 12:45:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 18 letters. Loop has 6 letters. 59.03/34.30 [2019-03-28 12:45:14,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:14,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 61 transitions. Stem has 12 letters. Loop has 12 letters. 59.03/34.30 [2019-03-28 12:45:14,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. 59.03/34.30 [2019-03-28 12:45:14,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 135 transitions. 59.03/34.30 [2019-03-28 12:45:14,933 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 59.03/34.30 [2019-03-28 12:45:14,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 59.03/34.30 [2019-03-28 12:45:14,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 59.03/34.30 [2019-03-28 12:45:14,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 59.03/34.30 [2019-03-28 12:45:14,933 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,934 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,934 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,934 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 59.03/34.30 [2019-03-28 12:45:14,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 59.03/34.30 [2019-03-28 12:45:14,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 59.03/34.30 [2019-03-28 12:45:14,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 59.03/34.30 [2019-03-28 12:45:14,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:45:14 BasicIcfg 59.03/34.30 [2019-03-28 12:45:14,941 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 59.03/34.30 [2019-03-28 12:45:14,941 INFO L168 Benchmark]: Toolchain (without parser) took 29914.44 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 423.6 MB). Free memory was 558.5 MB in the beginning and 871.8 MB in the end (delta: -313.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,942 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.91 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 558.5 MB in the beginning and 627.3 MB in the end (delta: -68.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 662.2 MB. Free memory was 627.3 MB in the beginning and 624.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,943 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 ms. Allocated memory is still 662.2 MB. Free memory was 624.2 MB in the beginning and 622.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,944 INFO L168 Benchmark]: RCFGBuilder took 456.36 ms. Allocated memory is still 662.2 MB. Free memory was 622.9 MB in the beginning and 589.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,944 INFO L168 Benchmark]: BlockEncodingV2 took 164.97 ms. Allocated memory is still 662.2 MB. Free memory was 589.9 MB in the beginning and 575.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,944 INFO L168 Benchmark]: TraceAbstraction took 1738.68 ms. Allocated memory is still 662.2 MB. Free memory was 573.7 MB in the beginning and 368.9 MB in the end (delta: 204.8 MB). Peak memory consumption was 204.8 MB. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,945 INFO L168 Benchmark]: BuchiAutomizer took 27179.00 ms. Allocated memory was 662.2 MB in the beginning and 1.1 GB in the end (delta: 411.0 MB). Free memory was 368.9 MB in the beginning and 871.8 MB in the end (delta: -502.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 59.03/34.30 [2019-03-28 12:45:14,948 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 59.03/34.30 --- Results --- 59.03/34.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 59.03/34.30 - StatisticsResult: Initial Icfg 59.03/34.30 80 locations, 85 edges 59.03/34.30 - StatisticsResult: Encoded RCFG 59.03/34.30 69 locations, 121 edges 59.03/34.30 * Results from de.uni_freiburg.informatik.ultimate.core: 59.03/34.30 - StatisticsResult: Toolchain Benchmarks 59.03/34.30 Benchmark results are: 59.03/34.30 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 59.03/34.30 * CACSL2BoogieTranslator took 301.91 ms. Allocated memory was 649.6 MB in the beginning and 662.2 MB in the end (delta: 12.6 MB). Free memory was 558.5 MB in the beginning and 627.3 MB in the end (delta: -68.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 50.3 GB. 59.03/34.30 * Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 662.2 MB. Free memory was 627.3 MB in the beginning and 624.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 59.03/34.30 * Boogie Preprocessor took 25.81 ms. Allocated memory is still 662.2 MB. Free memory was 624.2 MB in the beginning and 622.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 59.03/34.30 * RCFGBuilder took 456.36 ms. Allocated memory is still 662.2 MB. Free memory was 622.9 MB in the beginning and 589.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 50.3 GB. 59.03/34.30 * BlockEncodingV2 took 164.97 ms. Allocated memory is still 662.2 MB. Free memory was 589.9 MB in the beginning and 575.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 59.03/34.30 * TraceAbstraction took 1738.68 ms. Allocated memory is still 662.2 MB. Free memory was 573.7 MB in the beginning and 368.9 MB in the end (delta: 204.8 MB). Peak memory consumption was 204.8 MB. Max. memory is 50.3 GB. 59.03/34.30 * BuchiAutomizer took 27179.00 ms. Allocated memory was 662.2 MB in the beginning and 1.1 GB in the end (delta: 411.0 MB). Free memory was 368.9 MB in the beginning and 871.8 MB in the end (delta: -502.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 59.03/34.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #length 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #memory_int 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #memory_int 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #memory_int 59.03/34.30 - GenericResult: Unfinished Backtranslation 59.03/34.30 unknown boogie variable #memory_int 59.03/34.30 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 11]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 10]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 10]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 9]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 9]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 16]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 15]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 22]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 22]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 20]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 13]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 13]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 19]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 19]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 17]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 12]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 19]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - PositiveResult [Line: 19]: pointer dereference always succeeds 59.03/34.30 For all program executions holds that pointer dereference always succeeds at this location 59.03/34.30 - AllSpecificationsHoldResult: All specifications hold 59.03/34.30 42 specifications checked. All of them hold 59.03/34.30 - InvariantResult [Line: 16]: Loop Invariant 59.03/34.30 [2019-03-28 12:45:14,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:45:14,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:45:14,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:45:14,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:45:14,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 [2019-03-28 12:45:14,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 59.03/34.30 Derived loop invariant: (((((((0 == r && 4 == unknown-#length-unknown[r]) && \valid[x_ref] == 1) && x_ref == 0) && y_ref == 0) && \valid[r] == 1) && \valid[y_ref] == 1) && unknown-#length-unknown[x_ref] == 4) && unknown-#length-unknown[y_ref] == 4 59.03/34.30 - StatisticsResult: Ultimate Automizer benchmark data 59.03/34.30 CFG has 1 procedures, 69 locations, 42 error locations. SAFE Result, 1.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 416 SDslu, 5 SDs, 0 SdLazy, 455 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 2046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 59.03/34.30 - StatisticsResult: Constructed decomposition of program 59.03/34.30 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 20 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 18 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[r][r] + -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 1 and consists of 17 locations. 59.03/34.30 - StatisticsResult: Timing statistics 59.03/34.30 BüchiAutomizer plugin needed 27.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 8.0s. Büchi inclusion checks took 13.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 60 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 50 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 1939 SDslu, 108 SDs, 0 SdLazy, 3991 SolverSat, 389 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital386 mio100 ax100 hnf100 lsp97 ukn48 mio100 lsp36 div100 bol100 ite100 ukn100 eq179 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 11 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 59.03/34.30 - TerminationAnalysisResult: Termination proven 59.03/34.30 Buchi Automizer proved that your program is terminating 59.03/34.30 RESULT: Ultimate proved your program to be correct! 59.03/34.30 !SESSION 2019-03-28 12:44:41.641 ----------------------------------------------- 59.03/34.30 eclipse.buildId=unknown 59.03/34.30 java.version=1.8.0_181 59.03/34.30 java.vendor=Oracle Corporation 59.03/34.30 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 59.03/34.30 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 59.03/34.30 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 59.03/34.30 59.03/34.30 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:45:15.185 59.03/34.30 !MESSAGE The workspace will exit with unsaved changes in this session. 59.03/34.30 Received shutdown request... 59.03/34.30 Ultimate: 59.03/34.30 GTK+ Version Check 59.03/34.30 EOF