38.55/25.97 YES 38.55/25.97 38.55/25.97 Ultimate: Cannot open display: 38.55/25.97 This is Ultimate 0.1.24-8dc7c08-m 38.55/25.97 [2019-03-28 12:46:30,251 INFO L170 SettingsManager]: Resetting all preferences to default values... 38.55/25.97 [2019-03-28 12:46:30,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 38.55/25.97 [2019-03-28 12:46:30,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 38.55/25.97 [2019-03-28 12:46:30,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 38.55/25.97 [2019-03-28 12:46:30,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 38.55/25.97 [2019-03-28 12:46:30,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 38.55/25.97 [2019-03-28 12:46:30,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 38.55/25.97 [2019-03-28 12:46:30,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 38.55/25.97 [2019-03-28 12:46:30,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 38.55/25.97 [2019-03-28 12:46:30,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 38.55/25.97 [2019-03-28 12:46:30,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 38.55/25.97 [2019-03-28 12:46:30,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 38.55/25.97 [2019-03-28 12:46:30,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 38.55/25.97 [2019-03-28 12:46:30,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 38.55/25.97 [2019-03-28 12:46:30,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 38.55/25.97 [2019-03-28 12:46:30,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 38.55/25.97 [2019-03-28 12:46:30,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 38.55/25.97 [2019-03-28 12:46:30,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 38.55/25.97 [2019-03-28 12:46:30,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 38.55/25.97 [2019-03-28 12:46:30,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 38.55/25.97 [2019-03-28 12:46:30,287 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 38.55/25.97 [2019-03-28 12:46:30,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 38.55/25.97 [2019-03-28 12:46:30,288 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 38.55/25.97 [2019-03-28 12:46:30,289 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 38.55/25.97 [2019-03-28 12:46:30,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 38.55/25.97 [2019-03-28 12:46:30,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 38.55/25.97 [2019-03-28 12:46:30,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 38.55/25.97 [2019-03-28 12:46:30,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 38.55/25.97 [2019-03-28 12:46:30,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 38.55/25.97 [2019-03-28 12:46:30,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 38.55/25.97 [2019-03-28 12:46:30,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 38.55/25.97 [2019-03-28 12:46:30,294 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 38.55/25.97 [2019-03-28 12:46:30,309 INFO L110 SettingsManager]: Loading preferences was successful 38.55/25.97 [2019-03-28 12:46:30,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 38.55/25.97 [2019-03-28 12:46:30,310 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 38.55/25.97 [2019-03-28 12:46:30,310 INFO L133 SettingsManager]: * Rewrite not-equals=true 38.55/25.97 [2019-03-28 12:46:30,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 38.55/25.97 [2019-03-28 12:46:30,311 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 38.55/25.97 [2019-03-28 12:46:30,311 INFO L133 SettingsManager]: * Use SBE=true 38.55/25.97 [2019-03-28 12:46:30,311 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 38.55/25.97 [2019-03-28 12:46:30,311 INFO L133 SettingsManager]: * Use old map elimination=false 38.55/25.97 [2019-03-28 12:46:30,311 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 38.55/25.97 [2019-03-28 12:46:30,311 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 38.55/25.97 [2019-03-28 12:46:30,312 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 38.55/25.97 [2019-03-28 12:46:30,312 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 38.55/25.97 [2019-03-28 12:46:30,312 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 38.55/25.97 [2019-03-28 12:46:30,312 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 38.55/25.97 [2019-03-28 12:46:30,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 38.55/25.97 [2019-03-28 12:46:30,312 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 38.55/25.97 [2019-03-28 12:46:30,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE 38.55/25.97 [2019-03-28 12:46:30,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 38.55/25.97 [2019-03-28 12:46:30,313 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 38.55/25.97 [2019-03-28 12:46:30,313 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 38.55/25.97 [2019-03-28 12:46:30,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 38.55/25.97 [2019-03-28 12:46:30,314 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 38.55/25.97 [2019-03-28 12:46:30,314 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 38.55/25.97 [2019-03-28 12:46:30,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 38.55/25.97 [2019-03-28 12:46:30,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 38.55/25.97 [2019-03-28 12:46:30,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 38.55/25.97 [2019-03-28 12:46:30,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 38.55/25.97 [2019-03-28 12:46:30,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 38.55/25.97 [2019-03-28 12:46:30,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 38.55/25.97 [2019-03-28 12:46:30,352 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 38.55/25.97 [2019-03-28 12:46:30,356 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 38.55/25.97 [2019-03-28 12:46:30,358 INFO L271 PluginConnector]: Initializing CDTParser... 38.55/25.97 [2019-03-28 12:46:30,358 INFO L276 PluginConnector]: CDTParser initialized 38.55/25.97 [2019-03-28 12:46:30,359 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 38.55/25.97 [2019-03-28 12:46:30,476 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/58870e442b434229b88fa0b747bb2e86/FLAG9f82b2aa7 38.55/25.97 [2019-03-28 12:46:30,836 INFO L307 CDTParser]: Found 1 translation units. 38.55/25.97 [2019-03-28 12:46:30,836 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 38.55/25.97 [2019-03-28 12:46:30,837 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 38.55/25.97 [2019-03-28 12:46:30,844 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/58870e442b434229b88fa0b747bb2e86/FLAG9f82b2aa7 38.55/25.98 [2019-03-28 12:46:31,238 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/58870e442b434229b88fa0b747bb2e86 38.55/25.98 [2019-03-28 12:46:31,250 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 38.55/25.98 [2019-03-28 12:46:31,251 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 38.55/25.98 [2019-03-28 12:46:31,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 38.55/25.98 [2019-03-28 12:46:31,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 38.55/25.98 [2019-03-28 12:46:31,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 38.55/25.98 [2019-03-28 12:46:31,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c92643e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:31,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 38.55/25.98 [2019-03-28 12:46:31,285 INFO L176 MainTranslator]: Built tables and reachable declarations 38.55/25.98 [2019-03-28 12:46:31,447 INFO L206 PostProcessor]: Analyzing one entry point: main 38.55/25.98 [2019-03-28 12:46:31,459 INFO L191 MainTranslator]: Completed pre-run 38.55/25.98 [2019-03-28 12:46:31,477 INFO L206 PostProcessor]: Analyzing one entry point: main 38.55/25.98 [2019-03-28 12:46:31,548 INFO L195 MainTranslator]: Completed translation 38.55/25.98 [2019-03-28 12:46:31,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31 WrapperNode 38.55/25.98 [2019-03-28 12:46:31,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 38.55/25.98 [2019-03-28 12:46:31,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 38.55/25.98 [2019-03-28 12:46:31,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 38.55/25.98 [2019-03-28 12:46:31,550 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 38.55/25.98 [2019-03-28 12:46:31,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 38.55/25.98 [2019-03-28 12:46:31,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 38.55/25.98 [2019-03-28 12:46:31,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 38.55/25.98 [2019-03-28 12:46:31,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized 38.55/25.98 [2019-03-28 12:46:31,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 38.55/25.98 [2019-03-28 12:46:31,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 38.55/25.98 [2019-03-28 12:46:31,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... 38.55/25.98 [2019-03-28 12:46:31,615 INFO L276 PluginConnector]: RCFGBuilder initialized 38.55/25.98 [2019-03-28 12:46:31,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (1/1) ... 38.55/25.98 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 38.55/25.98 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 38.55/25.98 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 38.55/25.98 [2019-03-28 12:46:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 38.55/25.98 [2019-03-28 12:46:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 38.55/25.98 [2019-03-28 12:46:31,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 38.55/25.98 [2019-03-28 12:46:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 38.55/25.98 [2019-03-28 12:46:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 38.55/25.98 [2019-03-28 12:46:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 38.55/25.98 [2019-03-28 12:46:31,947 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 38.55/25.98 [2019-03-28 12:46:31,947 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 38.55/25.98 [2019-03-28 12:46:31,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:31 BoogieIcfgContainer 38.55/25.98 [2019-03-28 12:46:31,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 38.55/25.98 [2019-03-28 12:46:31,950 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 38.55/25.98 [2019-03-28 12:46:31,950 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 38.55/25.98 [2019-03-28 12:46:31,952 INFO L276 PluginConnector]: BlockEncodingV2 initialized 38.55/25.98 [2019-03-28 12:46:31,953 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:31" (1/1) ... 38.55/25.98 [2019-03-28 12:46:31,970 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges 38.55/25.98 [2019-03-28 12:46:31,972 INFO L258 BlockEncoder]: Using Remove infeasible edges 38.55/25.98 [2019-03-28 12:46:31,973 INFO L263 BlockEncoder]: Using Maximize final states 38.55/25.98 [2019-03-28 12:46:31,974 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 38.55/25.98 [2019-03-28 12:46:31,974 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 38.55/25.98 [2019-03-28 12:46:31,976 INFO L296 BlockEncoder]: Using Remove sink states 38.55/25.98 [2019-03-28 12:46:31,977 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 38.55/25.98 [2019-03-28 12:46:31,977 INFO L179 BlockEncoder]: Using Rewrite not-equals 38.55/25.98 [2019-03-28 12:46:32,004 INFO L185 BlockEncoder]: Using Use SBE 38.55/25.98 [2019-03-28 12:46:32,042 INFO L200 BlockEncoder]: SBE split 21 edges 38.55/25.98 [2019-03-28 12:46:32,047 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 38.55/25.98 [2019-03-28 12:46:32,049 INFO L71 MaximizeFinalStates]: 0 new accepting states 38.55/25.98 [2019-03-28 12:46:32,081 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 38.55/25.98 [2019-03-28 12:46:32,084 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 38.55/25.98 [2019-03-28 12:46:32,085 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 38.55/25.98 [2019-03-28 12:46:32,086 INFO L71 MaximizeFinalStates]: 0 new accepting states 38.55/25.98 [2019-03-28 12:46:32,086 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 38.55/25.98 [2019-03-28 12:46:32,088 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 38.55/25.98 [2019-03-28 12:46:32,089 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges 38.55/25.98 [2019-03-28 12:46:32,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32 BasicIcfg 38.55/25.98 [2019-03-28 12:46:32,089 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 38.55/25.98 [2019-03-28 12:46:32,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 38.55/25.98 [2019-03-28 12:46:32,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... 38.55/25.98 [2019-03-28 12:46:32,094 INFO L276 PluginConnector]: TraceAbstraction initialized 38.55/25.98 [2019-03-28 12:46:32,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:31" (1/4) ... 38.55/25.98 [2019-03-28 12:46:32,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c2b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:32, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:32,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (2/4) ... 38.55/25.98 [2019-03-28 12:46:32,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c2b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:32, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:32,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:31" (3/4) ... 38.55/25.98 [2019-03-28 12:46:32,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c2b583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:32, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:32,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32" (4/4) ... 38.55/25.98 [2019-03-28 12:46:32,098 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 38.55/25.98 [2019-03-28 12:46:32,109 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 38.55/25.98 [2019-03-28 12:46:32,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 38.55/25.98 [2019-03-28 12:46:32,135 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 38.55/25.98 [2019-03-28 12:46:32,164 INFO L133 ementStrategyFactory]: Using default assertion order modulation 38.55/25.98 [2019-03-28 12:46:32,164 INFO L382 AbstractCegarLoop]: Interprodecural is true 38.55/25.98 [2019-03-28 12:46:32,165 INFO L383 AbstractCegarLoop]: Hoare is true 38.55/25.98 [2019-03-28 12:46:32,165 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 38.55/25.98 [2019-03-28 12:46:32,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 38.55/25.98 [2019-03-28 12:46:32,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 38.55/25.98 [2019-03-28 12:46:32,165 INFO L387 AbstractCegarLoop]: Difference is false 38.55/25.98 [2019-03-28 12:46:32,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 38.55/25.98 [2019-03-28 12:46:32,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 38.55/25.98 [2019-03-28 12:46:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. 38.55/25.98 [2019-03-28 12:46:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 38.55/25.98 [2019-03-28 12:46:32,188 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:32,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 38.55/25.98 [2019-03-28 12:46:32,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:32,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 111352, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:32,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:32,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:32,407 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:32,563 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. 38.55/25.98 [2019-03-28 12:46:32,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:32,579 INFO L225 Difference]: With dead ends: 33 38.55/25.98 [2019-03-28 12:46:32,579 INFO L226 Difference]: Without dead ends: 29 38.55/25.98 [2019-03-28 12:46:32,583 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 38.55/25.98 [2019-03-28 12:46:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 38.55/25.98 [2019-03-28 12:46:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 38.55/25.98 [2019-03-28 12:46:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 38.55/25.98 [2019-03-28 12:46:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. 38.55/25.98 [2019-03-28 12:46:32,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:32,625 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 52 transitions. 38.55/25.98 [2019-03-28 12:46:32,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 52 transitions. 38.55/25.98 [2019-03-28 12:46:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 38.55/25.98 [2019-03-28 12:46:32,626 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:32,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 38.55/25.98 [2019-03-28 12:46:32,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:32,627 INFO L82 PathProgramCache]: Analyzing trace with hash 111354, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:32,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:32,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:32,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:32,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:32,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:32,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:32,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:32,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:32,657 INFO L87 Difference]: Start difference. First operand 29 states and 52 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:32,745 INFO L93 Difference]: Finished difference Result 33 states and 52 transitions. 38.55/25.98 [2019-03-28 12:46:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:32,747 INFO L225 Difference]: With dead ends: 33 38.55/25.98 [2019-03-28 12:46:32,747 INFO L226 Difference]: Without dead ends: 29 38.55/25.98 [2019-03-28 12:46:32,748 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 38.55/25.98 [2019-03-28 12:46:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 38.55/25.98 [2019-03-28 12:46:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 38.55/25.98 [2019-03-28 12:46:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 38.55/25.98 [2019-03-28 12:46:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. 38.55/25.98 [2019-03-28 12:46:32,753 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:32,754 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. 38.55/25.98 [2019-03-28 12:46:32,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. 38.55/25.98 [2019-03-28 12:46:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 38.55/25.98 [2019-03-28 12:46:32,754 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:32,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 38.55/25.98 [2019-03-28 12:46:32,755 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash 111355, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:32,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:32,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:32,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:32,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:32,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:32,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:32,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:32,796 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:32,900 INFO L93 Difference]: Finished difference Result 29 states and 48 transitions. 38.55/25.98 [2019-03-28 12:46:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:32,902 INFO L225 Difference]: With dead ends: 29 38.55/25.98 [2019-03-28 12:46:32,902 INFO L226 Difference]: Without dead ends: 25 38.55/25.98 [2019-03-28 12:46:32,903 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 38.55/25.98 [2019-03-28 12:46:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 38.55/25.98 [2019-03-28 12:46:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 38.55/25.98 [2019-03-28 12:46:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 38.55/25.98 [2019-03-28 12:46:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. 38.55/25.98 [2019-03-28 12:46:32,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 3 38.55/25.98 [2019-03-28 12:46:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:32,907 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 44 transitions. 38.55/25.98 [2019-03-28 12:46:32,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 44 transitions. 38.55/25.98 [2019-03-28 12:46:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 38.55/25.98 [2019-03-28 12:46:32,908 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:32,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:32,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 3449963, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:32,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:32,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:32,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:32,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:32,950 INFO L87 Difference]: Start difference. First operand 25 states and 44 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,020 INFO L93 Difference]: Finished difference Result 25 states and 44 transitions. 38.55/25.98 [2019-03-28 12:46:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,022 INFO L225 Difference]: With dead ends: 25 38.55/25.98 [2019-03-28 12:46:33,022 INFO L226 Difference]: Without dead ends: 23 38.55/25.98 [2019-03-28 12:46:33,022 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 38.55/25.98 [2019-03-28 12:46:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 38.55/25.98 [2019-03-28 12:46:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 38.55/25.98 [2019-03-28 12:46:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 38.55/25.98 [2019-03-28 12:46:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. 38.55/25.98 [2019-03-28 12:46:33,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,026 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. 38.55/25.98 [2019-03-28 12:46:33,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. 38.55/25.98 [2019-03-28 12:46:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 38.55/25.98 [2019-03-28 12:46:33,027 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:33,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,028 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash 3449965, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:33,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:33,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:33,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:33,055 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,112 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. 38.55/25.98 [2019-03-28 12:46:33,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,113 INFO L225 Difference]: With dead ends: 25 38.55/25.98 [2019-03-28 12:46:33,113 INFO L226 Difference]: Without dead ends: 23 38.55/25.98 [2019-03-28 12:46:33,114 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 38.55/25.98 [2019-03-28 12:46:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 38.55/25.98 [2019-03-28 12:46:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 38.55/25.98 [2019-03-28 12:46:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 38.55/25.98 [2019-03-28 12:46:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. 38.55/25.98 [2019-03-28 12:46:33,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,118 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. 38.55/25.98 [2019-03-28 12:46:33,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. 38.55/25.98 [2019-03-28 12:46:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 38.55/25.98 [2019-03-28 12:46:33,118 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:33,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 3449966, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:33,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:33,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:33,157 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,263 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. 38.55/25.98 [2019-03-28 12:46:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,264 INFO L225 Difference]: With dead ends: 23 38.55/25.98 [2019-03-28 12:46:33,264 INFO L226 Difference]: Without dead ends: 21 38.55/25.98 [2019-03-28 12:46:33,265 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 38.55/25.98 [2019-03-28 12:46:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 38.55/25.98 [2019-03-28 12:46:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 38.55/25.98 [2019-03-28 12:46:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 38.55/25.98 [2019-03-28 12:46:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. 38.55/25.98 [2019-03-28 12:46:33,268 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 36 transitions. Word has length 4 38.55/25.98 [2019-03-28 12:46:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,268 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 36 transitions. 38.55/25.98 [2019-03-28 12:46:33,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 36 transitions. 38.55/25.98 [2019-03-28 12:46:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.55/25.98 [2019-03-28 12:46:33,270 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:33,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,270 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 106947311, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:33,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:33,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:33,301 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,362 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. 38.55/25.98 [2019-03-28 12:46:33,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,363 INFO L225 Difference]: With dead ends: 21 38.55/25.98 [2019-03-28 12:46:33,363 INFO L226 Difference]: Without dead ends: 17 38.55/25.98 [2019-03-28 12:46:33,364 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 38.55/25.98 [2019-03-28 12:46:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 38.55/25.98 [2019-03-28 12:46:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 38.55/25.98 [2019-03-28 12:46:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 38.55/25.98 [2019-03-28 12:46:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. 38.55/25.98 [2019-03-28 12:46:33,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,367 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. 38.55/25.98 [2019-03-28 12:46:33,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. 38.55/25.98 [2019-03-28 12:46:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.55/25.98 [2019-03-28 12:46:33,368 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:33,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 106947313, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:33,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:33,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:33,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:33,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:33,394 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,431 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. 38.55/25.98 [2019-03-28 12:46:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,433 INFO L225 Difference]: With dead ends: 21 38.55/25.98 [2019-03-28 12:46:33,433 INFO L226 Difference]: Without dead ends: 17 38.55/25.98 [2019-03-28 12:46:33,433 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 38.55/25.98 [2019-03-28 12:46:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 38.55/25.98 [2019-03-28 12:46:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 38.55/25.98 [2019-03-28 12:46:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 38.55/25.98 [2019-03-28 12:46:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. 38.55/25.98 [2019-03-28 12:46:33,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,436 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. 38.55/25.98 [2019-03-28 12:46:33,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. 38.55/25.98 [2019-03-28 12:46:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 38.55/25.98 [2019-03-28 12:46:33,437 INFO L394 BasicCegarLoop]: Found error trace 38.55/25.98 [2019-03-28 12:46:33,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,438 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== 38.55/25.98 [2019-03-28 12:46:33,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash 106947314, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:33,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 38.55/25.98 [2019-03-28 12:46:33,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 38.55/25.98 [2019-03-28 12:46:33,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 38.55/25.98 [2019-03-28 12:46:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 38.55/25.98 [2019-03-28 12:46:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 38.55/25.98 [2019-03-28 12:46:33,471 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 3 states. 38.55/25.98 [2019-03-28 12:46:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 38.55/25.98 [2019-03-28 12:46:33,515 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. 38.55/25.98 [2019-03-28 12:46:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 38.55/25.98 [2019-03-28 12:46:33,516 INFO L225 Difference]: With dead ends: 17 38.55/25.98 [2019-03-28 12:46:33,516 INFO L226 Difference]: Without dead ends: 0 38.55/25.98 [2019-03-28 12:46:33,517 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 38.55/25.98 [2019-03-28 12:46:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 38.55/25.98 [2019-03-28 12:46:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 38.55/25.98 [2019-03-28 12:46:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 38.55/25.98 [2019-03-28 12:46:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:33,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 38.55/25.98 [2019-03-28 12:46:33,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:33,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,555 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,555 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,555 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 12 16) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 38.55/25.98 [2019-03-28 12:46:33,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,556 INFO L448 ceAbstractionStarter]: For program point L13-4(lines 13 16) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,557 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,558 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 38.55/25.98 [2019-03-28 12:46:33,559 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 38.55/25.98 [2019-03-28 12:46:33,568 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,575 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,576 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:33,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:33 BasicIcfg 38.55/25.98 [2019-03-28 12:46:33,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 38.55/25.98 [2019-03-28 12:46:33,579 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 38.55/25.98 [2019-03-28 12:46:33,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 38.55/25.98 [2019-03-28 12:46:33,582 INFO L276 PluginConnector]: BuchiAutomizer initialized 38.55/25.98 [2019-03-28 12:46:33,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.55/25.98 [2019-03-28 12:46:33,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:31" (1/5) ... 38.55/25.98 [2019-03-28 12:46:33,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74a621ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:33, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:33,584 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.55/25.98 [2019-03-28 12:46:33,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:31" (2/5) ... 38.55/25.98 [2019-03-28 12:46:33,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74a621ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:33, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:33,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.55/25.98 [2019-03-28 12:46:33,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:31" (3/5) ... 38.55/25.98 [2019-03-28 12:46:33,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74a621ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:33, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:33,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.55/25.98 [2019-03-28 12:46:33,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:32" (4/5) ... 38.55/25.98 [2019-03-28 12:46:33,586 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74a621ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:33, skipping insertion in model container 38.55/25.98 [2019-03-28 12:46:33,586 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 38.55/25.98 [2019-03-28 12:46:33,586 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:33" (5/5) ... 38.55/25.98 [2019-03-28 12:46:33,587 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 38.55/25.98 [2019-03-28 12:46:33,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation 38.55/25.98 [2019-03-28 12:46:33,609 INFO L374 BuchiCegarLoop]: Interprodecural is true 38.55/25.98 [2019-03-28 12:46:33,609 INFO L375 BuchiCegarLoop]: Hoare is true 38.55/25.98 [2019-03-28 12:46:33,609 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 38.55/25.98 [2019-03-28 12:46:33,609 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 38.55/25.98 [2019-03-28 12:46:33,609 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 38.55/25.98 [2019-03-28 12:46:33,609 INFO L379 BuchiCegarLoop]: Difference is false 38.55/25.98 [2019-03-28 12:46:33,609 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 38.55/25.98 [2019-03-28 12:46:33,610 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 38.55/25.98 [2019-03-28 12:46:33,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 38.55/25.98 [2019-03-28 12:46:33,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 38.55/25.98 [2019-03-28 12:46:33,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 38.55/25.98 [2019-03-28 12:46:33,620 INFO L119 BuchiIsEmpty]: Starting construction of run 38.55/25.98 [2019-03-28 12:46:33,624 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,624 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,625 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 38.55/25.98 [2019-03-28 12:46:33,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. 38.55/25.98 [2019-03-28 12:46:33,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 38.55/25.98 [2019-03-28 12:46:33,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 38.55/25.98 [2019-03-28 12:46:33,627 INFO L119 BuchiIsEmpty]: Starting construction of run 38.55/25.98 [2019-03-28 12:46:33,627 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,627 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 38.55/25.98 [2019-03-28 12:46:33,633 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue [81] 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] 9#L-1true [123] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~ret10=|v_ULTIMATE.start_main_#t~ret10_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret10, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 10#L10true [57] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 23#L10-1true [74] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 28#L11true [82] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 24#L13-3true 38.55/25.98 [2019-03-28 12:46:33,634 INFO L796 eck$LassoCheckResult]: Loop: 24#L13-3true [78] L13-3-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 31#L13true [87] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 30#L13-1true [86] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 16#L14true [66] L14-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 14#L14-1true [165] L14-1-->L15: Formula: (and (= (store |v_#memory_int_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| (- 1)))) |v_#memory_int_17|) (= 1 (select |v_#valid_33| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_26|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 18#L15true [69] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 34#L15-1true [169] L15-1-->L13-3: Formula: (and (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 1))) |v_#memory_int_22|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 24#L13-3true 38.55/25.98 [2019-03-28 12:46:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 107155798, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:33,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash 525939443, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash 626321406, now seen corresponding path program 1 times 38.55/25.98 [2019-03-28 12:46:33,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 38.55/25.98 [2019-03-28 12:46:33,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 38.55/25.98 [2019-03-28 12:46:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 38.55/25.98 [2019-03-28 12:46:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:34,203 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 38.55/25.98 [2019-03-28 12:46:34,334 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 79 38.55/25.98 [2019-03-28 12:46:34,349 INFO L216 LassoAnalysis]: Preferences: 38.55/25.98 [2019-03-28 12:46:34,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 38.55/25.98 [2019-03-28 12:46:34,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 38.55/25.98 [2019-03-28 12:46:34,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 38.55/25.98 [2019-03-28 12:46:34,351 INFO L127 ssoRankerPreferences]: Use exernal solver: false 38.55/25.98 [2019-03-28 12:46:34,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 38.55/25.98 [2019-03-28 12:46:34,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 38.55/25.98 [2019-03-28 12:46:34,351 INFO L130 ssoRankerPreferences]: Path of dumped script: 38.55/25.98 [2019-03-28 12:46:34,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 38.55/25.98 [2019-03-28 12:46:34,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 38.55/25.98 [2019-03-28 12:46:34,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 38.55/25.98 [2019-03-28 12:46:34,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,714 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 38.55/25.98 [2019-03-28 12:46:34,842 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 38.55/25.98 [2019-03-28 12:46:34,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:34,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 38.55/25.98 [2019-03-28 12:46:35,278 INFO L300 LassoAnalysis]: Preprocessing complete. 38.55/25.98 [2019-03-28 12:46:35,283 INFO L497 LassoAnalysis]: Using template 'affine'. 38.55/25.98 [2019-03-28 12:46:35,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.55/25.98 [2019-03-28 12:46:35,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,296 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,296 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 38.55/25.98 [2019-03-28 12:46:35,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 38.55/25.98 [2019-03-28 12:46:35,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 38.55/25.98 Termination analysis: LINEAR_WITH_GUESSES 38.55/25.98 Number of strict supporting invariants: 0 38.55/25.98 Number of non-strict supporting invariants: 1 38.55/25.98 Consider only non-deceasing supporting invariants: true 38.55/25.98 Simplify termination arguments: true 38.55/25.98 Simplify supporting invariants: trueOverapproximate stem: false 38.55/25.98 [2019-03-28 12:46:35,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. 38.55/25.98 [2019-03-28 12:46:35,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 38.55/25.98 [2019-03-28 12:46:35,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 38.55/25.98 [2019-03-28 12:46:35,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 38.55/25.98 [2019-03-28 12:46:35,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 38.55/25.98 [2019-03-28 12:46:35,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 38.55/25.98 [2019-03-28 12:46:35,432 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 38.55/25.98 [2019-03-28 12:46:35,450 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 38.55/25.98 [2019-03-28 12:46:35,451 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 38.55/25.98 [2019-03-28 12:46:35,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 38.55/25.98 [2019-03-28 12:46:35,455 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 38.55/25.98 [2019-03-28 12:46:35,455 INFO L518 LassoAnalysis]: Proved termination. 38.55/25.98 [2019-03-28 12:46:35,456 INFO L520 LassoAnalysis]: Termination argument consisting of: 38.55/25.98 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 38.55/25.98 Supporting invariants [] 38.55/25.98 [2019-03-28 12:46:35,557 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 38.55/25.98 [2019-03-28 12:46:35,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.55/25.98 [2019-03-28 12:46:35,562 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 38.55/25.98 [2019-03-28 12:46:35,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 38.55/25.98 [2019-03-28 12:46:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:35,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core 38.55/25.98 [2019-03-28 12:46:35,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.55/25.98 [2019-03-28 12:46:35,649 INFO L189 IndexEqualityManager]: detected not equals via solver 38.55/25.98 [2019-03-28 12:46:35,665 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 38.55/25.98 [2019-03-28 12:46:35,666 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:35,680 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 38.55/25.98 [2019-03-28 12:46:35,680 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:35,681 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 38.55/25.98 [2019-03-28 12:46:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:35,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 38.55/25.98 [2019-03-28 12:46:35,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.55/25.98 [2019-03-28 12:46:35,840 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 38.55/25.98 [2019-03-28 12:46:35,841 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 47 treesize of output 68 38.55/25.98 [2019-03-28 12:46:35,853 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:35,891 INFO L497 ElimStorePlain]: treesize reduction 37, result has 48.6 percent of original size 38.55/25.98 [2019-03-28 12:46:35,892 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:35,893 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:31 38.55/25.98 [2019-03-28 12:46:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 38.55/25.98 [2019-03-28 12:46:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:36,145 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 38.55/25.98 [2019-03-28 12:46:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:36,156 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 38.55/25.98 [2019-03-28 12:46:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 38.55/25.98 [2019-03-28 12:46:36,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core 38.55/25.98 [2019-03-28 12:46:36,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... 38.55/25.98 [2019-03-28 12:46:36,249 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 38.55/25.98 [2019-03-28 12:46:36,250 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 82 38.55/25.98 [2019-03-28 12:46:36,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:36,320 INFO L497 ElimStorePlain]: treesize reduction 85, result has 38.4 percent of original size 38.55/25.98 [2019-03-28 12:46:36,322 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 38.55/25.98 [2019-03-28 12:46:36,322 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:47 38.55/25.98 [2019-03-28 12:46:45,815 WARN L188 SmtUtils]: Spent 3.69 s on a formula simplification that was a NOOP. DAG size: 31 38.55/25.98 [2019-03-28 12:46:46,822 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) c_oldRank0))) is different from true 38.55/25.98 [2019-03-28 12:46:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 38.55/25.98 [2019-03-28 12:46:46,835 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 38.55/25.98 [2019-03-28 12:46:46,835 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 14 predicates after loop cannibalization 38.55/25.98 [2019-03-28 12:46:46,840 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 14 loop predicates 38.55/25.98 [2019-03-28 12:46:46,841 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states. Second operand 9 states. 38.55/25.98 [2019-03-28 12:46:52,586 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states.. Second operand 9 states. Result 144 states and 245 transitions. Complement of second has 43 states. 38.55/25.98 [2019-03-28 12:46:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 3 stem states 9 non-accepting loop states 2 accepting loop states 38.55/25.98 [2019-03-28 12:46:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 38.55/25.98 [2019-03-28 12:46:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. 38.55/25.98 [2019-03-28 12:46:52,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 7 letters. 38.55/25.98 [2019-03-28 12:46:52,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.55/25.98 [2019-03-28 12:46:52,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 12 letters. Loop has 7 letters. 38.55/25.98 [2019-03-28 12:46:52,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.55/25.98 [2019-03-28 12:46:52,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 165 transitions. Stem has 5 letters. Loop has 14 letters. 38.55/25.98 [2019-03-28 12:46:52,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. 38.55/25.98 [2019-03-28 12:46:52,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 245 transitions. 38.55/25.98 [2019-03-28 12:46:52,607 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 38.55/25.98 [2019-03-28 12:46:52,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 38.55/25.98 [2019-03-28 12:46:52,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 38.55/25.98 [2019-03-28 12:46:52,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 38.55/25.98 [2019-03-28 12:46:52,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 38.55/25.98 [2019-03-28 12:46:52,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 38.55/25.98 [2019-03-28 12:46:52,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 38.55/25.98 [2019-03-28 12:46:52,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:52 BasicIcfg 38.55/25.98 [2019-03-28 12:46:52,616 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 38.55/25.98 [2019-03-28 12:46:52,617 INFO L168 Benchmark]: Toolchain (without parser) took 21366.58 ms. Allocated memory was 649.6 MB in the beginning and 767.6 MB in the end (delta: 118.0 MB). Free memory was 559.8 MB in the beginning and 473.8 MB in the end (delta: 86.0 MB). Peak memory consumption was 203.9 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,618 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.77 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 558.5 MB in the beginning and 645.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 677.9 MB. Free memory was 645.2 MB in the beginning and 642.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,619 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 677.9 MB. Free memory was 642.1 MB in the beginning and 640.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,620 INFO L168 Benchmark]: RCFGBuilder took 334.43 ms. Allocated memory is still 677.9 MB. Free memory was 640.8 MB in the beginning and 617.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,620 INFO L168 Benchmark]: BlockEncodingV2 took 139.61 ms. Allocated memory is still 677.9 MB. Free memory was 615.9 MB in the beginning and 606.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,621 INFO L168 Benchmark]: TraceAbstraction took 1488.08 ms. Allocated memory is still 677.9 MB. Free memory was 606.4 MB in the beginning and 443.5 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,621 INFO L168 Benchmark]: BuchiAutomizer took 19037.27 ms. Allocated memory was 677.9 MB in the beginning and 767.6 MB in the end (delta: 89.7 MB). Free memory was 443.5 MB in the beginning and 473.8 MB in the end (delta: -30.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 50.3 GB. 38.55/25.98 [2019-03-28 12:46:52,626 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 38.55/25.98 --- Results --- 38.55/25.98 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 38.55/25.98 - StatisticsResult: Initial Icfg 38.55/25.98 40 locations, 41 edges 38.55/25.98 - StatisticsResult: Encoded RCFG 38.55/25.98 33 locations, 60 edges 38.55/25.98 * Results from de.uni_freiburg.informatik.ultimate.core: 38.55/25.98 - StatisticsResult: Toolchain Benchmarks 38.55/25.98 Benchmark results are: 38.55/25.98 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 38.55/25.98 * CACSL2BoogieTranslator took 296.77 ms. Allocated memory was 649.6 MB in the beginning and 677.9 MB in the end (delta: 28.3 MB). Free memory was 558.5 MB in the beginning and 645.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 38.55/25.98 * Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 677.9 MB. Free memory was 645.2 MB in the beginning and 642.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 38.55/25.98 * Boogie Preprocessor took 23.85 ms. Allocated memory is still 677.9 MB. Free memory was 642.1 MB in the beginning and 640.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 38.55/25.98 * RCFGBuilder took 334.43 ms. Allocated memory is still 677.9 MB. Free memory was 640.8 MB in the beginning and 617.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 50.3 GB. 38.55/25.98 * BlockEncodingV2 took 139.61 ms. Allocated memory is still 677.9 MB. Free memory was 615.9 MB in the beginning and 606.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 38.55/25.98 * TraceAbstraction took 1488.08 ms. Allocated memory is still 677.9 MB. Free memory was 606.4 MB in the beginning and 443.5 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 50.3 GB. 38.55/25.98 * BuchiAutomizer took 19037.27 ms. Allocated memory was 677.9 MB in the beginning and 767.6 MB in the end (delta: 89.7 MB). Free memory was 443.5 MB in the beginning and 473.8 MB in the end (delta: -30.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 50.3 GB. 38.55/25.98 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #length 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #memory_int 38.55/25.98 - GenericResult: Unfinished Backtranslation 38.55/25.98 unknown boogie variable #memory_int 38.55/25.98 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 38.55/25.98 - PositiveResult [Line: 13]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 15]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 15]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 15]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 12]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 15]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 11]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 12]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 11]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 14]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 14]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 14]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 14]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 10]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 17]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 13]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 17]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 13]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - PositiveResult [Line: 13]: pointer dereference always succeeds 38.55/25.98 For all program executions holds that pointer dereference always succeeds at this location 38.55/25.98 - AllSpecificationsHoldResult: All specifications hold 38.55/25.98 20 specifications checked. All of them hold 38.55/25.98 - InvariantResult [Line: 12]: Loop Invariant 38.55/25.98 [2019-03-28 12:46:52,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:52,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:52,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:52,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:52,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 [2019-03-28 12:46:52,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 38.55/25.98 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 38.55/25.98 - StatisticsResult: Ultimate Automizer benchmark data 38.55/25.98 CFG has 1 procedures, 33 locations, 20 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 240 SDslu, 6 SDs, 0 SdLazy, 297 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 9 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, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 38.55/25.98 - StatisticsResult: Constructed decomposition of program 38.55/25.98 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. 38.55/25.98 - StatisticsResult: Timing statistics 38.55/25.98 BüchiAutomizer plugin needed 19.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 16.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4 SDtfs, 446 SDslu, 44 SDs, 0 SdLazy, 548 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital303 mio100 ax100 hnf100 lsp98 ukn62 mio100 lsp39 div100 bol100 ite100 ukn100 eq182 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 38.55/25.98 - TerminationAnalysisResult: Termination proven 38.55/25.98 Buchi Automizer proved that your program is terminating 38.55/25.98 RESULT: Ultimate proved your program to be correct! 38.55/25.98 !SESSION 2019-03-28 12:46:27.954 ----------------------------------------------- 38.55/25.98 eclipse.buildId=unknown 38.55/25.98 java.version=1.8.0_181 38.55/25.98 java.vendor=Oracle Corporation 38.55/25.98 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 38.55/25.98 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 38.55/25.98 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 38.55/25.98 38.55/25.98 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:52.862 38.55/25.98 !MESSAGE The workspace will exit with unsaved changes in this session. 38.55/25.98 Received shutdown request... 38.55/25.98 Ultimate: 38.55/25.98 GTK+ Version Check 38.55/25.98 EOF