NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:30:42,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:30:42,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:30:42,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:30:42,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:30:42,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:30:42,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:30:42,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:30:42,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:30:42,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:30:42,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:30:42,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:30:42,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:30:42,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:30:42,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:30:42,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:30:42,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:30:42,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:30:42,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:30:42,095 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:30:42,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:30:42,097 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:30:42,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:30:42,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:30:42,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:30:42,101 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:30:42,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:30:42,102 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:30:42,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:30:42,103 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:30:42,103 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:30:42,104 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:30:42,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:30:42,105 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:30:42,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:30:42,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:30:42,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:30:42,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:30:42,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:30:42,108 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 09:30:42,122 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:30:42,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:30:42,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:30:42,124 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:30:42,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:30:42,124 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:42,124 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:30:42,124 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:30:42,124 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:30:42,125 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:30:42,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:30:42,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:30:42,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:30:42,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:30:42,126 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:30:42,126 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:30:42,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:30:42,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:30:42,127 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:30:42,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:42,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:30:42,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:30:42,127 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:30:42,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:30:42,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:30:42,166 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:30:42,170 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:30:42,171 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:30:42,172 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:30:42,172 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:30:42,235 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/49bce27b929247c79318519ab60445b9/FLAG5c88537f6 [2020-06-22 09:30:42,579 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:30:42,580 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 09:30:42,580 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:30:42,587 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/49bce27b929247c79318519ab60445b9/FLAG5c88537f6 [2020-06-22 09:30:42,982 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/49bce27b929247c79318519ab60445b9 [2020-06-22 09:30:42,994 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:30:42,996 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:30:42,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:42,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:30:43,002 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:30:43,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:42" (1/1) ... [2020-06-22 09:30:43,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53956db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:42" (1/1) ... [2020-06-22 09:30:43,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:30:43,035 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:30:43,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,290 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:30:43,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,326 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:30:43,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43 WrapperNode [2020-06-22 09:30:43,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:43,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:30:43,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:30:43,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:30:43,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:30:43,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:30:43,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:30:43,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:30:43,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:43,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:30:43,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:30:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:30:43,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:30:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:30:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:30:44,094 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:30:44,094 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2020-06-22 09:30:44,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44 BoogieIcfgContainer [2020-06-22 09:30:44,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:30:44,097 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:30:44,097 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:30:44,099 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:30:44,100 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (1/1) ... [2020-06-22 09:30:44,126 INFO L313 BlockEncoder]: Initial Icfg 187 locations, 222 edges [2020-06-22 09:30:44,127 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:30:44,128 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:30:44,129 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:30:44,129 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:44,131 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:30:44,132 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:30:44,132 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:30:44,179 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:30:44,246 INFO L200 BlockEncoder]: SBE split 125 edges [2020-06-22 09:30:44,252 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 09:30:44,255 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:44,300 INFO L100 BaseMinimizeStates]: Removed 28 edges and 14 locations by large block encoding [2020-06-22 09:30:44,303 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:30:44,305 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:30:44,305 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:44,308 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 09:30:44,309 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:30:44,310 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:30:44,310 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:44,311 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:30:44,311 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:30:44,312 INFO L313 BlockEncoder]: Encoded RCFG 171 locations, 340 edges [2020-06-22 09:30:44,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44 BasicIcfg [2020-06-22 09:30:44,313 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:30:44,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:30:44,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:30:44,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:30:44,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:30:42" (1/4) ... [2020-06-22 09:30:44,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7f74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/4) ... [2020-06-22 09:30:44,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7f74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (3/4) ... [2020-06-22 09:30:44,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec7f74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44" (4/4) ... [2020-06-22 09:30:44,322 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:44,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:30:44,340 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 90 error locations. [2020-06-22 09:30:44,357 INFO L257 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2020-06-22 09:30:44,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:44,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:30:44,387 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:30:44,388 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:44,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:44,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:44,388 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:30:44,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:44,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:30:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-06-22 09:30:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:30:44,412 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:30:44,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash 534873, now seen corresponding path program 1 times [2020-06-22 09:30:44,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:44,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:44,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,613 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 3 states. [2020-06-22 09:30:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,380 INFO L93 Difference]: Finished difference Result 289 states and 576 transitions. [2020-06-22 09:30:45,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:30:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,414 INFO L225 Difference]: With dead ends: 289 [2020-06-22 09:30:45,414 INFO L226 Difference]: Without dead ends: 283 [2020-06-22 09:30:45,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-06-22 09:30:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 175. [2020-06-22 09:30:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-06-22 09:30:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 366 transitions. [2020-06-22 09:30:45,474 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 366 transitions. Word has length 3 [2020-06-22 09:30:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,476 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 366 transitions. [2020-06-22 09:30:45,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 366 transitions. [2020-06-22 09:30:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 09:30:45,476 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 09:30:45,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash 534875, now seen corresponding path program 1 times [2020-06-22 09:30:45,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:45,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:45,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:45,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,513 INFO L87 Difference]: Start difference. First operand 175 states and 366 transitions. Second operand 3 states. [2020-06-22 09:30:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,841 INFO L93 Difference]: Finished difference Result 175 states and 366 transitions. [2020-06-22 09:30:45,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:45,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 09:30:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,843 INFO L225 Difference]: With dead ends: 175 [2020-06-22 09:30:45,844 INFO L226 Difference]: Without dead ends: 169 [2020-06-22 09:30:45,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-06-22 09:30:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2020-06-22 09:30:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-06-22 09:30:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 350 transitions. [2020-06-22 09:30:45,869 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 350 transitions. Word has length 3 [2020-06-22 09:30:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,869 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 350 transitions. [2020-06-22 09:30:45,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 350 transitions. [2020-06-22 09:30:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:30:45,870 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090295, now seen corresponding path program 1 times [2020-06-22 09:30:45,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:45,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:45,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,906 INFO L87 Difference]: Start difference. First operand 169 states and 350 transitions. Second operand 3 states. [2020-06-22 09:30:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,204 INFO L93 Difference]: Finished difference Result 169 states and 350 transitions. [2020-06-22 09:30:46,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:46,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 09:30:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,207 INFO L225 Difference]: With dead ends: 169 [2020-06-22 09:30:46,207 INFO L226 Difference]: Without dead ends: 133 [2020-06-22 09:30:46,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-06-22 09:30:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-06-22 09:30:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-06-22 09:30:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 278 transitions. [2020-06-22 09:30:46,216 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 278 transitions. Word has length 9 [2020-06-22 09:30:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,217 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 278 transitions. [2020-06-22 09:30:46,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 278 transitions. [2020-06-22 09:30:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:30:46,218 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,218 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090293, now seen corresponding path program 1 times [2020-06-22 09:30:46,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:46,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:46,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:46,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,249 INFO L87 Difference]: Start difference. First operand 133 states and 278 transitions. Second operand 3 states. [2020-06-22 09:30:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,517 INFO L93 Difference]: Finished difference Result 180 states and 295 transitions. [2020-06-22 09:30:46,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:46,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 09:30:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,519 INFO L225 Difference]: With dead ends: 180 [2020-06-22 09:30:46,519 INFO L226 Difference]: Without dead ends: 144 [2020-06-22 09:30:46,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-06-22 09:30:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2020-06-22 09:30:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-06-22 09:30:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 242 transitions. [2020-06-22 09:30:46,529 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 242 transitions. Word has length 9 [2020-06-22 09:30:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,529 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 242 transitions. [2020-06-22 09:30:46,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 242 transitions. [2020-06-22 09:30:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 09:30:46,530 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090292, now seen corresponding path program 1 times [2020-06-22 09:30:46,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:46,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:46,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:46,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,566 INFO L87 Difference]: Start difference. First operand 133 states and 242 transitions. Second operand 3 states. [2020-06-22 09:30:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,849 INFO L93 Difference]: Finished difference Result 144 states and 259 transitions. [2020-06-22 09:30:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:46,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 09:30:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,851 INFO L225 Difference]: With dead ends: 144 [2020-06-22 09:30:46,851 INFO L226 Difference]: Without dead ends: 108 [2020-06-22 09:30:46,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-06-22 09:30:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2020-06-22 09:30:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-06-22 09:30:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 206 transitions. [2020-06-22 09:30:46,858 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 206 transitions. Word has length 9 [2020-06-22 09:30:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,858 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 206 transitions. [2020-06-22 09:30:46,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 206 transitions. [2020-06-22 09:30:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:30:46,860 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1534824764, now seen corresponding path program 1 times [2020-06-22 09:30:46,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:46,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:46,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:46,890 INFO L87 Difference]: Start difference. First operand 97 states and 206 transitions. Second operand 3 states. [2020-06-22 09:30:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,187 INFO L93 Difference]: Finished difference Result 149 states and 302 transitions. [2020-06-22 09:30:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:47,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 09:30:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,192 INFO L225 Difference]: With dead ends: 149 [2020-06-22 09:30:47,192 INFO L226 Difference]: Without dead ends: 146 [2020-06-22 09:30:47,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-06-22 09:30:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2020-06-22 09:30:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-06-22 09:30:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 204 transitions. [2020-06-22 09:30:47,198 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 204 transitions. Word has length 10 [2020-06-22 09:30:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,199 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 204 transitions. [2020-06-22 09:30:47,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 204 transitions. [2020-06-22 09:30:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 09:30:47,200 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,200 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1534824762, now seen corresponding path program 1 times [2020-06-22 09:30:47,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:47,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:47,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:47,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:47,234 INFO L87 Difference]: Start difference. First operand 97 states and 204 transitions. Second operand 3 states. [2020-06-22 09:30:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,389 INFO L93 Difference]: Finished difference Result 97 states and 204 transitions. [2020-06-22 09:30:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:47,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 09:30:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,391 INFO L225 Difference]: With dead ends: 97 [2020-06-22 09:30:47,391 INFO L226 Difference]: Without dead ends: 87 [2020-06-22 09:30:47,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-06-22 09:30:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-06-22 09:30:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-06-22 09:30:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. [2020-06-22 09:30:47,396 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 10 [2020-06-22 09:30:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,396 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. [2020-06-22 09:30:47,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. [2020-06-22 09:30:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:30:47,398 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash 125627263, now seen corresponding path program 1 times [2020-06-22 09:30:47,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:47,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:47,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:30:47,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:47,470 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand 5 states. [2020-06-22 09:30:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,852 INFO L93 Difference]: Finished difference Result 171 states and 355 transitions. [2020-06-22 09:30:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:47,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-06-22 09:30:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,854 INFO L225 Difference]: With dead ends: 171 [2020-06-22 09:30:47,854 INFO L226 Difference]: Without dead ends: 166 [2020-06-22 09:30:47,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-06-22 09:30:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 84. [2020-06-22 09:30:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-06-22 09:30:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 174 transitions. [2020-06-22 09:30:47,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 174 transitions. Word has length 15 [2020-06-22 09:30:47,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,860 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 174 transitions. [2020-06-22 09:30:47,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 174 transitions. [2020-06-22 09:30:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:30:47,861 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 125636846, now seen corresponding path program 1 times [2020-06-22 09:30:47,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:47,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:47,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:47,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:47,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:47,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:47,927 INFO L87 Difference]: Start difference. First operand 84 states and 174 transitions. Second operand 6 states. [2020-06-22 09:30:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,330 INFO L93 Difference]: Finished difference Result 164 states and 343 transitions. [2020-06-22 09:30:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:48,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-06-22 09:30:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,331 INFO L225 Difference]: With dead ends: 164 [2020-06-22 09:30:48,331 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:30:48,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:30:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:30:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:30:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:30:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:30:48,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-06-22 09:30:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,334 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:48,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:30:48,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:30:48,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:30:48,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:30:48,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:30:48,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:30:48,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr80REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr76REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr88REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr84REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,638 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr56REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr52REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,639 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr64REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr60REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr72REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point L12-6(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,640 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr68REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr83REQUIRES_VIOLATION(line 66) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 33) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr79REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 29 33) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 29 33) no Hoare annotation was computed. [2020-06-22 09:30:48,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr87REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,642 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L30-4(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L30-6(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr59REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 34) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 34) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 34) no Hoare annotation was computed. [2020-06-22 09:30:48,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr55REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 34) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr67REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr63REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr75REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr71REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,644 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr82REQUIRES_VIOLATION(line 66) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr78REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,645 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 27) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr86REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 27) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 19) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L7(lines 7 35) no Hoare annotation was computed. [2020-06-22 09:30:48,646 INFO L448 ceAbstractionStarter]: For program point L7-1(lines 7 35) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point L7-2(lines 7 35) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point L7-3(lines 7 35) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,647 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L444 ceAbstractionStarter]: At program point L32-3(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,648 INFO L448 ceAbstractionStarter]: For program point L32-4(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L444 ceAbstractionStarter]: At program point L32-5(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L32-6(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr58REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L444 ceAbstractionStarter]: At program point L32-7(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr54REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,649 INFO L448 ceAbstractionStarter]: For program point L24-4(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L24-6(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr66REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr62REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L16-6(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2020-06-22 09:30:48,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr74REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 20) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 20) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L8-2(lines 8 20) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L8-3(lines 8 20) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr70REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,651 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr81REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr77REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr89REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr85REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,652 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 13) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 13) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 9 13) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L9-3(lines 9 13) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,653 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L26-4(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr57REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L26-6(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr53REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr65REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L18-6(line 18) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 38 70) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr61REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:30:48,655 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr73REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L448 ceAbstractionStarter]: For program point L10-6(line 10) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr69REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 09:30:48,656 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:30:48,666 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,675 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,676 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,677 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,680 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,681 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,682 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,684 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:48,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:48 BasicIcfg [2020-06-22 09:30:48,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:30:48,687 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:30:48,687 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:30:48,691 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:30:48,692 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:30:42" (1/5) ... [2020-06-22 09:30:48,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47970f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/5) ... [2020-06-22 09:30:48,693 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47970f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (3/5) ... [2020-06-22 09:30:48,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47970f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44" (4/5) ... [2020-06-22 09:30:48,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47970f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:48, skipping insertion in model container [2020-06-22 09:30:48,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:48,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:48" (5/5) ... [2020-06-22 09:30:48,696 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:48,717 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:48,717 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:30:48,718 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:30:48,718 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:48,718 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:48,718 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:48,718 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:30:48,718 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:48,718 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:30:48,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states. [2020-06-22 09:30:48,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:30:48,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,738 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,738 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:48,738 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:30:48,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states. [2020-06-22 09:30:48,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:30:48,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:48,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:48,745 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,746 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:48,751 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRYtrue [502] 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] 19#L-1true [711] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 119#L41true [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 112#L41-1true [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 21#L43-1true [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 104#L47-1true [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 79#L50-1true [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 61#L53-1true [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 71#L56-1true [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 123#L66-2true [2020-06-22 09:30:48,752 INFO L796 eck$LassoCheckResult]: Loop: 123#L66-2true [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 74#L67true [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 73#L67-1true [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 68#L67-2true [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 123#L66-2true [2020-06-22 09:30:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash -778614779, now seen corresponding path program 1 times [2020-06-22 09:30:48,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 1 times [2020-06-22 09:30:48,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash 650057734, now seen corresponding path program 1 times [2020-06-22 09:30:48,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:49,059 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2020-06-22 09:30:49,123 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:49,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:49,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:49,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:49,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:49,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:49,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:49,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:49,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:30:49,126 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:49,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:49,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:49,662 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:49,668 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:49,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:49,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:49,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:49,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:49,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:49,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:49,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:49,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:49,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:49,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:49,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:49,771 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:49,781 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:30:49,782 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:30:49,784 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:49,786 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 09:30:49,786 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:49,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_1 - 1 >= 0] [2020-06-22 09:30:49,816 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed [2020-06-22 09:30:49,823 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 09:30:49,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:49,934 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 09:30:49,935 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:49,945 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:49,946 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:49,946 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-06-22 09:30:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:30:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:50,196 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:50,203 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:50,203 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 09:30:50,207 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 7 loop predicates [2020-06-22 09:30:50,208 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 171 states. Second operand 7 states. [2020-06-22 09:30:53,958 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 171 states.. Second operand 7 states. Result 1550 states and 3049 transitions. Complement of second has 113 states. [2020-06-22 09:30:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 9 stem states 24 non-accepting loop states 4 accepting loop states [2020-06-22 09:30:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 09:30:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2741 transitions. [2020-06-22 09:30:53,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 09:30:53,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:53,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 09:30:53,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:53,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 09:30:53,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:53,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1550 states and 3049 transitions. [2020-06-22 09:30:54,023 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2020-06-22 09:30:54,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1550 states to 649 states and 1251 transitions. [2020-06-22 09:30:54,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 [2020-06-22 09:30:54,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 649 [2020-06-22 09:30:54,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 649 states and 1251 transitions. [2020-06-22 09:30:54,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:54,039 INFO L706 BuchiCegarLoop]: Abstraction has 649 states and 1251 transitions. [2020-06-22 09:30:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states and 1251 transitions. [2020-06-22 09:30:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 108. [2020-06-22 09:30:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-06-22 09:30:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 230 transitions. [2020-06-22 09:30:54,050 INFO L729 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. [2020-06-22 09:30:54,050 INFO L609 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. [2020-06-22 09:30:54,050 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:30:54,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 230 transitions. [2020-06-22 09:30:54,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:30:54,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:54,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:54,053 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:54,053 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:54,053 INFO L794 eck$LassoCheckResult]: Stem: 2089#ULTIMATE.startENTRY [502] 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] 2058#L-1 [710] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 2059#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 2081#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 2062#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 2061#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 2067#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 2103#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 2104#L56-1 [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 2085#L66-2 [2020-06-22 09:30:54,054 INFO L796 eck$LassoCheckResult]: Loop: 2085#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 2088#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 2110#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 2107#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 2085#L66-2 [2020-06-22 09:30:54,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1773542182, now seen corresponding path program 1 times [2020-06-22 09:30:54,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:54,070 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 2 times [2020-06-22 09:30:54,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:54,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:54,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 520975015, now seen corresponding path program 1 times [2020-06-22 09:30:54,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:54,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,318 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-06-22 09:30:54,376 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:54,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:54,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:54,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:54,377 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:54,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:54,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:54,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:54,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 09:30:54,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:54,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:54,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,576 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-06-22 09:30:54,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:54,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:54,989 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:54,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:54,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:54,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:54,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:54,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:55,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:55,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:55,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:55,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:55,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:55,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:55,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:55,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:55,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:55,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:55,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:55,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:55,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:55,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:55,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:55,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:55,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:55,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:55,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:55,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:55,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:55,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:55,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:55,021 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:30:55,021 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:30:55,022 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:55,023 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 09:30:55,023 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:55,023 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_2 - 1 >= 0] [2020-06-22 09:30:55,051 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed [2020-06-22 09:30:55,058 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:55,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 09:30:55,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:55,124 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 09:30:55,124 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:55,134 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:55,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:55,135 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2020-06-22 09:30:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:55,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:30:55,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,420 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,429 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:55,430 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 09:30:55,430 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 7 loop predicates [2020-06-22 09:30:55,430 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123 Second operand 7 states. [2020-06-22 09:30:57,400 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 686 states and 1295 transitions. Complement of second has 90 states. [2020-06-22 09:30:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 9 stem states 20 non-accepting loop states 4 accepting loop states [2020-06-22 09:30:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 09:30:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1247 transitions. [2020-06-22 09:30:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 09:30:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:57,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 09:30:57,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:57,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 09:30:57,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:57,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 1295 transitions. [2020-06-22 09:30:57,429 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2020-06-22 09:30:57,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 644 states and 1245 transitions. [2020-06-22 09:30:57,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2020-06-22 09:30:57,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 644 [2020-06-22 09:30:57,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 1245 transitions. [2020-06-22 09:30:57,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:57,436 INFO L706 BuchiCegarLoop]: Abstraction has 644 states and 1245 transitions. [2020-06-22 09:30:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 1245 transitions. [2020-06-22 09:30:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 108. [2020-06-22 09:30:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-06-22 09:30:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 230 transitions. [2020-06-22 09:30:57,442 INFO L729 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. [2020-06-22 09:30:57,442 INFO L609 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. [2020-06-22 09:30:57,442 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:30:57,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 230 transitions. [2020-06-22 09:30:57,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:30:57,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:57,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:57,444 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:57,444 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:57,445 INFO L794 eck$LassoCheckResult]: Stem: 3160#ULTIMATE.startENTRY [502] 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] 3129#L-1 [709] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 3130#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3151#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 3133#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 3132#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 3136#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 3174#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 3175#L56-1 [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 3156#L66-2 [2020-06-22 09:30:57,445 INFO L796 eck$LassoCheckResult]: Loop: 3156#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 3161#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 3182#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 3179#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 3156#L66-2 [2020-06-22 09:30:57,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 30731847, now seen corresponding path program 1 times [2020-06-22 09:30:57,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 3 times [2020-06-22 09:30:57,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:57,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:57,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 391892296, now seen corresponding path program 1 times [2020-06-22 09:30:57,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:57,670 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2020-06-22 09:30:57,716 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:57,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:57,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:57,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:57,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:57,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:57,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:57,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:57,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 09:30:57,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:57,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:57,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:57,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:30:58,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:58,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:58,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:58,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:58,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:58,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:58,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 09:30:58,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:58,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:58,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:58,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:58,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:58,222 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:58,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:58,234 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:30:58,234 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:30:58,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:58,236 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-06-22 09:30:58,236 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:58,236 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_3 - 1 >= 0] [2020-06-22 09:30:58,263 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed [2020-06-22 09:30:58,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:58,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 09:30:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:58,341 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 [2020-06-22 09:30:58,342 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:58,347 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:58,347 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:58,347 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-06-22 09:30:58,364 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 09:30:58,364 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:58,370 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:58,371 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:58,371 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:30:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:58,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 09:30:58,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:58,578 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:58,584 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:58,584 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-22 09:30:58,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates [2020-06-22 09:30:58,584 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123 Second operand 7 states. [2020-06-22 09:30:59,290 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 202 states and 400 transitions. Complement of second has 25 states. [2020-06-22 09:30:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 3 stem states 10 non-accepting loop states 2 accepting loop states [2020-06-22 09:30:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 09:30:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 323 transitions. [2020-06-22 09:30:59,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 09:30:59,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:59,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 09:30:59,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:59,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 09:30:59,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:59,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 400 transitions. [2020-06-22 09:30:59,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-06-22 09:30:59,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 187 states and 382 transitions. [2020-06-22 09:30:59,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2020-06-22 09:30:59,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2020-06-22 09:30:59,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 382 transitions. [2020-06-22 09:30:59,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:59,309 INFO L706 BuchiCegarLoop]: Abstraction has 187 states and 382 transitions. [2020-06-22 09:30:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 382 transitions. [2020-06-22 09:30:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2020-06-22 09:30:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-06-22 09:30:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-06-22 09:30:59,312 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-06-22 09:30:59,312 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-06-22 09:30:59,312 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:30:59,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 226 transitions. [2020-06-22 09:30:59,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 09:30:59,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:59,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:59,314 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:59,314 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:59,315 INFO L794 eck$LassoCheckResult]: Stem: 3640#ULTIMATE.startENTRY [502] 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] 3609#L-1 [711] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 3610#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3630#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 3611#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 3608#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 3614#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 3654#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 3655#L56-1 [765] L56-1-->L63: Formula: (< |v_ULTIMATE.start_main_#t~nondet21_3| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 3657#L63 [532] L63-->L63-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_10) (= (select (select |v_#memory_int_74| v_ULTIMATE.start_main_~d~0.base_13) v_ULTIMATE.start_main_~d~0.offset_10) |v_ULTIMATE.start_main_#t~mem22_2|) (= 1 (select |v_#valid_100| v_ULTIMATE.start_main_~d~0.base_13)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_10 4) (select |v_#length_90| v_ULTIMATE.start_main_~d~0.base_13))) InVars {#memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_13, #length=|v_#length_90|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_10, #valid=|v_#valid_100|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_10, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_13, #length=|v_#length_90|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22] 3635#L63-1 [971] L63-1-->L66-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_17) (= (store |v_#memory_int_86| v_ULTIMATE.start_main_~d~0.base_23 (store (select |v_#memory_int_86| v_ULTIMATE.start_main_~d~0.base_23) v_ULTIMATE.start_main_~d~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem22_6| (- 1)))) |v_#memory_int_85|) (= 1 (select |v_#valid_120| v_ULTIMATE.start_main_~d~0.base_23)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_17 4) (select |v_#length_104| v_ULTIMATE.start_main_~d~0.base_23))) InVars {ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_17, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_23, #length=|v_#length_104|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_17, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_23, #length=|v_#length_104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, #memory_int] 3636#L66-2 [2020-06-22 09:30:59,315 INFO L796 eck$LassoCheckResult]: Loop: 3636#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 3639#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 3662#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 3660#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 3636#L66-2 [2020-06-22 09:30:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -924177742, now seen corresponding path program 1 times [2020-06-22 09:30:59,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 4 times [2020-06-22 09:30:59,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:59,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:59,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1621697485, now seen corresponding path program 1 times [2020-06-22 09:30:59,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:59,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:59,588 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-06-22 09:30:59,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:59 BasicIcfg [2020-06-22 09:30:59,665 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:30:59,666 INFO L168 Benchmark]: Toolchain (without parser) took 16670.56 ms. Allocated memory was 514.9 MB in the beginning and 789.1 MB in the end (delta: 274.2 MB). Free memory was 439.6 MB in the beginning and 646.5 MB in the end (delta: -207.0 MB). Peak memory consumption was 67.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,666 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:59,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.58 ms. Allocated memory was 514.9 MB in the beginning and 568.9 MB in the end (delta: 54.0 MB). Free memory was 439.0 MB in the beginning and 536.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.99 ms. Allocated memory is still 568.9 MB. Free memory was 536.0 MB in the beginning and 533.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,668 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 568.9 MB. Free memory was 533.1 MB in the beginning and 531.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,669 INFO L168 Benchmark]: RCFGBuilder took 689.96 ms. Allocated memory is still 568.9 MB. Free memory was 531.0 MB in the beginning and 476.6 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,669 INFO L168 Benchmark]: BlockEncodingV2 took 216.74 ms. Allocated memory is still 568.9 MB. Free memory was 476.6 MB in the beginning and 447.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,670 INFO L168 Benchmark]: TraceAbstraction took 4372.58 ms. Allocated memory was 568.9 MB in the beginning and 638.6 MB in the end (delta: 69.7 MB). Free memory was 447.5 MB in the beginning and 468.9 MB in the end (delta: -21.4 MB). Peak memory consumption was 48.3 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:59,670 INFO L168 Benchmark]: BuchiAutomizer took 10977.75 ms. Allocated memory was 638.6 MB in the beginning and 789.1 MB in the end (delta: 150.5 MB). Free memory was 468.9 MB in the beginning and 646.5 MB in the end (delta: -177.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:59,675 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 187 locations, 222 edges - StatisticsResult: Encoded RCFG 171 locations, 340 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 330.58 ms. Allocated memory was 514.9 MB in the beginning and 568.9 MB in the end (delta: 54.0 MB). Free memory was 439.0 MB in the beginning and 536.0 MB in the end (delta: -97.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 46.99 ms. Allocated memory is still 568.9 MB. Free memory was 536.0 MB in the beginning and 533.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 568.9 MB. Free memory was 533.1 MB in the beginning and 531.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 689.96 ms. Allocated memory is still 568.9 MB. Free memory was 531.0 MB in the beginning and 476.6 MB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 216.74 ms. Allocated memory is still 568.9 MB. Free memory was 476.6 MB in the beginning and 447.5 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4372.58 ms. Allocated memory was 568.9 MB in the beginning and 638.6 MB in the end (delta: 69.7 MB). Free memory was 447.5 MB in the beginning and 468.9 MB in the end (delta: -21.4 MB). Peak memory consumption was 48.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 10977.75 ms. Allocated memory was 638.6 MB in the beginning and 789.1 MB in the end (delta: 150.5 MB). Free memory was 468.9 MB in the beginning and 646.5 MB in the end (delta: -177.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 66]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 63]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 66]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 67]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 90 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 09:30:59,691 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,692 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 09:30:59,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,694 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,695 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 09:30:59,696 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 - InvariantResult [Line: 7]: Loop Invariant [2020-06-22 09:30:59,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:59,700 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 171 locations, 90 error locations. SAFE Result, 4.2s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 2270 SDslu, 482 SDs, 0 SdLazy, 2340 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=1, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 261 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 184 HoareAnnotationTreeSize, 4 FomulaSimplifications, 698 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 220 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 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 - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 37 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 33 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 15 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 3.2s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1158 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 108 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 271 SDtfs, 9389 SDslu, 2022 SDs, 0 SdLazy, 3988 SolverSat, 774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax100 hnf100 lsp95 ukn79 mio100 lsp42 div100 bol100 ite100 ukn100 eq185 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 66]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=7894} State at position 1 is {NULL=0, \result=0, NULL=7894, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dc4e2cf=-1, d=0, d=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18504d67=0, x=7893, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6dc4e2cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@755366bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ff22603=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43ace6e5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@890d4cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9b4b6c5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@518f5e29=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@264b5a02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@205bfe51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d28a596=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@264b5a02=7893, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bcd6ed6=0, NULL=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@383ab29c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19c96761=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@43b890fd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4f845276=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4acd362b=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 38]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L39] int* d = alloca(sizeof(int)); [L40] int* x = alloca(sizeof(int)); [L41] *d = 1 [L43] COND FALSE !(__VERIFIER_nondet_int()) [L47] COND FALSE !(__VERIFIER_nondet_int()) [L50] COND FALSE !(__VERIFIER_nondet_int()) [L53] COND FALSE !(__VERIFIER_nondet_int()) [L56] COND FALSE !(__VERIFIER_nondet_int()) [L62] COND TRUE __VERIFIER_nondet_int() [L63] EXPR \read(*d) [L63] *d = *d - 1 Loop: [L66] EXPR \read(*x) [L66] COND TRUE *x > 0 [L67] EXPR \read(*x) [L67] EXPR \read(*d) [L67] *x = *x - *d End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 09:30:39.751 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:30:59.936 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check