52.15/20.09 NO 52.15/20.09 52.15/20.09 Ultimate: Cannot open display: 52.15/20.09 This is Ultimate 0.1.24-8dc7c08-m 52.15/20.09 [2019-03-28 12:14:46,486 INFO L170 SettingsManager]: Resetting all preferences to default values... 52.15/20.09 [2019-03-28 12:14:46,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 52.15/20.09 [2019-03-28 12:14:46,499 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 52.15/20.09 [2019-03-28 12:14:46,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 52.15/20.09 [2019-03-28 12:14:46,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 52.15/20.09 [2019-03-28 12:14:46,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 52.15/20.09 [2019-03-28 12:14:46,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 52.15/20.09 [2019-03-28 12:14:46,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 52.15/20.09 [2019-03-28 12:14:46,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 52.15/20.09 [2019-03-28 12:14:46,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 52.15/20.09 [2019-03-28 12:14:46,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 52.15/20.09 [2019-03-28 12:14:46,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 52.15/20.09 [2019-03-28 12:14:46,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 52.15/20.09 [2019-03-28 12:14:46,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 52.15/20.09 [2019-03-28 12:14:46,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 52.15/20.09 [2019-03-28 12:14:46,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 52.15/20.09 [2019-03-28 12:14:46,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 52.15/20.09 [2019-03-28 12:14:46,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 52.15/20.09 [2019-03-28 12:14:46,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 52.15/20.09 [2019-03-28 12:14:46,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 52.15/20.09 [2019-03-28 12:14:46,522 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 52.15/20.09 [2019-03-28 12:14:46,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 52.15/20.09 [2019-03-28 12:14:46,523 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 52.15/20.09 [2019-03-28 12:14:46,524 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 52.15/20.09 [2019-03-28 12:14:46,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 52.15/20.09 [2019-03-28 12:14:46,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 52.15/20.09 [2019-03-28 12:14:46,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 52.15/20.09 [2019-03-28 12:14:46,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 52.15/20.09 [2019-03-28 12:14:46,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 52.15/20.09 [2019-03-28 12:14:46,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 52.15/20.09 [2019-03-28 12:14:46,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 52.15/20.09 [2019-03-28 12:14:46,529 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 52.15/20.09 [2019-03-28 12:14:46,544 INFO L110 SettingsManager]: Loading preferences was successful 52.15/20.09 [2019-03-28 12:14:46,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 52.15/20.09 [2019-03-28 12:14:46,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 52.15/20.09 [2019-03-28 12:14:46,545 INFO L133 SettingsManager]: * Rewrite not-equals=true 52.15/20.09 [2019-03-28 12:14:46,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 52.15/20.09 [2019-03-28 12:14:46,546 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 52.15/20.09 [2019-03-28 12:14:46,546 INFO L133 SettingsManager]: * Use SBE=true 52.15/20.09 [2019-03-28 12:14:46,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 52.15/20.09 [2019-03-28 12:14:46,546 INFO L133 SettingsManager]: * Use old map elimination=false 52.15/20.09 [2019-03-28 12:14:46,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 52.15/20.09 [2019-03-28 12:14:46,546 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 52.15/20.09 [2019-03-28 12:14:46,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 52.15/20.09 [2019-03-28 12:14:46,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 52.15/20.09 [2019-03-28 12:14:46,547 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 52.15/20.09 [2019-03-28 12:14:46,547 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:46,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 52.15/20.09 [2019-03-28 12:14:46,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 52.15/20.09 [2019-03-28 12:14:46,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE 52.15/20.09 [2019-03-28 12:14:46,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 52.15/20.09 [2019-03-28 12:14:46,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 52.15/20.09 [2019-03-28 12:14:46,548 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 52.15/20.09 [2019-03-28 12:14:46,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 52.15/20.09 [2019-03-28 12:14:46,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 52.15/20.09 [2019-03-28 12:14:46,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 52.15/20.09 [2019-03-28 12:14:46,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 52.15/20.09 [2019-03-28 12:14:46,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 52.15/20.09 [2019-03-28 12:14:46,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 52.15/20.09 [2019-03-28 12:14:46,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 52.15/20.09 [2019-03-28 12:14:46,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 52.15/20.09 [2019-03-28 12:14:46,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 52.15/20.09 [2019-03-28 12:14:46,588 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 52.15/20.09 [2019-03-28 12:14:46,591 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 52.15/20.09 [2019-03-28 12:14:46,593 INFO L271 PluginConnector]: Initializing CDTParser... 52.15/20.09 [2019-03-28 12:14:46,593 INFO L276 PluginConnector]: CDTParser initialized 52.15/20.09 [2019-03-28 12:14:46,594 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 52.15/20.09 [2019-03-28 12:14:46,664 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/3cb9ba6b7c2446a594e1e00c3fbadc4a/FLAGae6760f20 52.15/20.09 [2019-03-28 12:14:47,041 INFO L307 CDTParser]: Found 1 translation units. 52.15/20.09 [2019-03-28 12:14:47,042 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 52.15/20.09 [2019-03-28 12:14:47,056 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/3cb9ba6b7c2446a594e1e00c3fbadc4a/FLAGae6760f20 52.15/20.09 [2019-03-28 12:14:47,395 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/3cb9ba6b7c2446a594e1e00c3fbadc4a 52.15/20.09 [2019-03-28 12:14:47,406 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 52.15/20.09 [2019-03-28 12:14:47,408 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 52.15/20.09 [2019-03-28 12:14:47,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 52.15/20.09 [2019-03-28 12:14:47,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 52.15/20.09 [2019-03-28 12:14:47,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 52.15/20.09 [2019-03-28 12:14:47,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:47,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb4c2ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:47,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:47,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 52.15/20.09 [2019-03-28 12:14:47,472 INFO L176 MainTranslator]: Built tables and reachable declarations 52.15/20.09 [2019-03-28 12:14:47,801 INFO L206 PostProcessor]: Analyzing one entry point: main 52.15/20.09 [2019-03-28 12:14:47,808 INFO L191 MainTranslator]: Completed pre-run 52.15/20.09 [2019-03-28 12:14:47,892 INFO L206 PostProcessor]: Analyzing one entry point: main 52.15/20.09 [2019-03-28 12:14:47,912 INFO L195 MainTranslator]: Completed translation 52.15/20.09 [2019-03-28 12:14:47,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47 WrapperNode 52.15/20.09 [2019-03-28 12:14:47,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 52.15/20.09 [2019-03-28 12:14:47,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 52.15/20.09 [2019-03-28 12:14:47,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 52.15/20.09 [2019-03-28 12:14:47,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 52.15/20.09 [2019-03-28 12:14:47,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:47,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:47,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 52.15/20.09 [2019-03-28 12:14:47,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 52.15/20.09 [2019-03-28 12:14:47,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 52.15/20.09 [2019-03-28 12:14:47,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized 52.15/20.09 [2019-03-28 12:14:47,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 [2019-03-28 12:14:48,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 52.15/20.09 [2019-03-28 12:14:48,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 52.15/20.09 [2019-03-28 12:14:48,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... 52.15/20.09 [2019-03-28 12:14:48,042 INFO L276 PluginConnector]: RCFGBuilder initialized 52.15/20.09 [2019-03-28 12:14:48,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (1/1) ... 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 52.15/20.09 [2019-03-28 12:14:48,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 52.15/20.09 [2019-03-28 12:14:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 52.15/20.09 [2019-03-28 12:14:49,021 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 52.15/20.09 [2019-03-28 12:14:49,022 INFO L286 CfgBuilder]: Removed 39 assue(true) statements. 52.15/20.09 [2019-03-28 12:14:49,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:49 BoogieIcfgContainer 52.15/20.09 [2019-03-28 12:14:49,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 52.15/20.09 [2019-03-28 12:14:49,024 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 52.15/20.09 [2019-03-28 12:14:49,024 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 52.15/20.09 [2019-03-28 12:14:49,027 INFO L276 PluginConnector]: BlockEncodingV2 initialized 52.15/20.09 [2019-03-28 12:14:49,027 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:49" (1/1) ... 52.15/20.09 [2019-03-28 12:14:49,057 INFO L313 BlockEncoder]: Initial Icfg 265 locations, 487 edges 52.15/20.09 [2019-03-28 12:14:49,059 INFO L258 BlockEncoder]: Using Remove infeasible edges 52.15/20.09 [2019-03-28 12:14:49,060 INFO L263 BlockEncoder]: Using Maximize final states 52.15/20.09 [2019-03-28 12:14:49,061 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 52.15/20.09 [2019-03-28 12:14:49,061 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 52.15/20.09 [2019-03-28 12:14:49,063 INFO L296 BlockEncoder]: Using Remove sink states 52.15/20.09 [2019-03-28 12:14:49,064 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 52.15/20.09 [2019-03-28 12:14:49,065 INFO L179 BlockEncoder]: Using Rewrite not-equals 52.15/20.09 [2019-03-28 12:14:49,133 INFO L185 BlockEncoder]: Using Use SBE 52.15/20.09 [2019-03-28 12:14:49,200 INFO L200 BlockEncoder]: SBE split 195 edges 52.15/20.09 [2019-03-28 12:14:49,208 INFO L70 emoveInfeasibleEdges]: Removed 31 edges and 0 locations because of local infeasibility 52.15/20.09 [2019-03-28 12:14:49,213 INFO L71 MaximizeFinalStates]: 0 new accepting states 52.15/20.09 [2019-03-28 12:14:49,304 INFO L100 BaseMinimizeStates]: Removed 54 edges and 27 locations by large block encoding 52.15/20.09 [2019-03-28 12:14:49,307 INFO L70 RemoveSinkStates]: Removed 11 edges and 7 locations by removing sink states 52.15/20.09 [2019-03-28 12:14:49,310 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 52.15/20.09 [2019-03-28 12:14:49,310 INFO L71 MaximizeFinalStates]: 0 new accepting states 52.15/20.09 [2019-03-28 12:14:49,317 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding 52.15/20.09 [2019-03-28 12:14:49,318 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 52.15/20.09 [2019-03-28 12:14:49,320 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 52.15/20.09 [2019-03-28 12:14:49,321 INFO L71 MaximizeFinalStates]: 0 new accepting states 52.15/20.09 [2019-03-28 12:14:49,321 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 52.15/20.09 [2019-03-28 12:14:49,322 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 52.15/20.09 [2019-03-28 12:14:49,323 INFO L313 BlockEncoder]: Encoded RCFG 228 locations, 610 edges 52.15/20.09 [2019-03-28 12:14:49,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:49 BasicIcfg 52.15/20.09 [2019-03-28 12:14:49,324 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 52.15/20.09 [2019-03-28 12:14:49,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 52.15/20.09 [2019-03-28 12:14:49,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... 52.15/20.09 [2019-03-28 12:14:49,329 INFO L276 PluginConnector]: TraceAbstraction initialized 52.15/20.09 [2019-03-28 12:14:49,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:14:47" (1/4) ... 52.15/20.09 [2019-03-28 12:14:49,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5c5df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (2/4) ... 52.15/20.09 [2019-03-28 12:14:49,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5c5df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:49" (3/4) ... 52.15/20.09 [2019-03-28 12:14:49,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5c5df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:49" (4/4) ... 52.15/20.09 [2019-03-28 12:14:49,334 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 52.15/20.09 [2019-03-28 12:14:49,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 52.15/20.09 [2019-03-28 12:14:49,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 52.15/20.09 [2019-03-28 12:14:49,370 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 52.15/20.09 [2019-03-28 12:14:49,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation 52.15/20.09 [2019-03-28 12:14:49,404 INFO L382 AbstractCegarLoop]: Interprodecural is true 52.15/20.09 [2019-03-28 12:14:49,404 INFO L383 AbstractCegarLoop]: Hoare is true 52.15/20.09 [2019-03-28 12:14:49,404 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 52.15/20.09 [2019-03-28 12:14:49,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 52.15/20.09 [2019-03-28 12:14:49,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 52.15/20.09 [2019-03-28 12:14:49,404 INFO L387 AbstractCegarLoop]: Difference is false 52.15/20.09 [2019-03-28 12:14:49,405 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 52.15/20.09 [2019-03-28 12:14:49,405 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 52.15/20.09 [2019-03-28 12:14:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. 52.15/20.09 [2019-03-28 12:14:49,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 52.15/20.09 [2019-03-28 12:14:49,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 228 states. 52.15/20.09 [2019-03-28 12:14:49,596 INFO L451 ceAbstractionStarter]: At program point L894(lines 868 895) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,596 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 271) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,596 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 783) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,596 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 799) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,597 INFO L451 ceAbstractionStarter]: At program point L168-2(lines 168 196) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,597 INFO L451 ceAbstractionStarter]: At program point L135-2(lines 135 163) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,597 INFO L448 ceAbstractionStarter]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,597 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 767) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,597 INFO L448 ceAbstractionStarter]: For program point L697(lines 697 701) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,598 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 717) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,598 INFO L448 ceAbstractionStarter]: For program point L1110(lines 1109 1150) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,598 INFO L451 ceAbstractionStarter]: At program point L1292(lines 1285 1302) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,598 INFO L451 ceAbstractionStarter]: At program point L235(lines 228 254) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,599 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 751) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,599 INFO L448 ceAbstractionStarter]: For program point L169(lines 168 196) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,599 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 685) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,599 INFO L448 ceAbstractionStarter]: For program point L136(lines 135 163) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,599 INFO L451 ceAbstractionStarter]: At program point L615(lines 608 625) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,599 INFO L451 ceAbstractionStarter]: At program point L962(lines 955 972) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,599 INFO L451 ceAbstractionStarter]: At program point L1276(lines 1269 1304) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,600 INFO L451 ceAbstractionStarter]: At program point L219(lines 212 256) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,600 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 669) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,600 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,600 INFO L448 ceAbstractionStarter]: For program point L1293(lines 1245 1334) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,600 INFO L451 ceAbstractionStarter]: At program point L1260(lines 1253 1306) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,600 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1231) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,600 INFO L451 ceAbstractionStarter]: At program point L104(lines 104 116) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,601 INFO L448 ceAbstractionStarter]: For program point L616(lines 608 625) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,601 INFO L451 ceAbstractionStarter]: At program point L1062(lines 1055 1072) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,601 INFO L448 ceAbstractionStarter]: For program point L963(lines 955 972) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,601 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,601 INFO L451 ceAbstractionStarter]: At program point L1211(lines 1204 1221) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,601 INFO L451 ceAbstractionStarter]: At program point L121(lines 91 833) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,602 INFO L451 ceAbstractionStarter]: At program point L1046(lines 1039 1074) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,602 INFO L451 ceAbstractionStarter]: At program point L435(lines 428 445) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,602 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,602 INFO L448 ceAbstractionStarter]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,602 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 241) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,602 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 257) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,602 INFO L451 ceAbstractionStarter]: At program point L1195(lines 1188 1223) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,603 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1166) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,603 INFO L448 ceAbstractionStarter]: For program point L617(lines 617 621) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,603 INFO L448 ceAbstractionStarter]: For program point L1162-2(lines 1160 1339) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,603 INFO L448 ceAbstractionStarter]: For program point L1063(lines 866 1096) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,604 INFO L451 ceAbstractionStarter]: At program point L1030(lines 1023 1076) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,604 INFO L451 ceAbstractionStarter]: At program point L518-2(lines 518 546) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,604 INFO L448 ceAbstractionStarter]: For program point L964(lines 964 968) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,604 INFO L451 ceAbstractionStarter]: At program point L485-2(lines 485 513) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,604 INFO L451 ceAbstractionStarter]: At program point L419(lines 412 447) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,604 INFO L451 ceAbstractionStarter]: At program point L353(lines 346 363) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,604 INFO L448 ceAbstractionStarter]: For program point L1278(lines 1278 1282) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,605 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 225) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,605 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1160 1339) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,605 INFO L451 ceAbstractionStarter]: At program point L1179(lines 1172 1225) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,605 INFO L451 ceAbstractionStarter]: At program point L981(lines 981 988) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,605 INFO L448 ceAbstractionStarter]: For program point L436(lines 124 470) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,606 INFO L451 ceAbstractionStarter]: At program point L403(lines 396 449) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,606 INFO L451 ceAbstractionStarter]: At program point L337(lines 330 365) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,606 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,606 INFO L448 ceAbstractionStarter]: For program point L1328-1(lines 1160 1339) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,606 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1266) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,606 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,606 INFO L451 ceAbstractionStarter]: At program point L585(lines 578 604) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,607 INFO L448 ceAbstractionStarter]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,607 INFO L448 ceAbstractionStarter]: For program point L519(lines 518 546) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,607 INFO L448 ceAbstractionStarter]: For program point L486(lines 485 513) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,607 INFO L451 ceAbstractionStarter]: At program point L932(lines 925 951) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,607 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,607 INFO L448 ceAbstractionStarter]: For program point L354(lines 124 470) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,608 INFO L451 ceAbstractionStarter]: At program point L387-1(lines 387 393) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,608 INFO L451 ceAbstractionStarter]: At program point L866-1(lines 850 1101) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,608 INFO L451 ceAbstractionStarter]: At program point L321(lines 314 367) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,608 INFO L448 ceAbstractionStarter]: For program point L1213(lines 1213 1217) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,608 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,608 INFO L448 ceAbstractionStarter]: For program point L1114-1(lines 1109 1150) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,608 INFO L451 ceAbstractionStarter]: At program point L569(lines 562 606) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,609 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,609 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 441) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,609 INFO L451 ceAbstractionStarter]: At program point L916(lines 909 953) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1201) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,610 INFO L451 ceAbstractionStarter]: At program point L107(lines 107 115) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 1036) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 805) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,610 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1185) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,611 INFO L451 ceAbstractionStarter]: At program point L124-2(lines 124 470) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,611 INFO L451 ceAbstractionStarter]: At program point L1016(lines 990 1017) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,611 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,611 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 863) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,611 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 343) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,611 INFO L451 ceAbstractionStarter]: At program point L785(lines 778 795) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,611 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 723) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 591) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 607) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L448 ceAbstractionStarter]: For program point L934(lines 934 938) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 954) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,612 INFO L451 ceAbstractionStarter]: At program point L1314(lines 1307 1324) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,612 INFO L451 ceAbstractionStarter]: At program point L769(lines 762 797) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,613 INFO L451 ceAbstractionStarter]: At program point L703(lines 696 713) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,613 INFO L451 ceAbstractionStarter]: At program point L125(lines 124 470) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,613 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 120) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,613 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 575) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,613 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 922) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,613 INFO L451 ceAbstractionStarter]: At program point L307(lines 277 308) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,613 INFO L448 ceAbstractionStarter]: For program point L786(lines 475 827) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,613 INFO L451 ceAbstractionStarter]: At program point L753(lines 746 799) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,614 INFO L451 ceAbstractionStarter]: At program point L687(lines 680 715) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 559) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L902(lines 902 906) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L869-1(lines 866 1096) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1245 1334) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 743) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,614 INFO L448 ceAbstractionStarter]: For program point L704(lines 475 827) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,615 INFO L451 ceAbstractionStarter]: At program point L737-1(lines 737 743) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,615 INFO L451 ceAbstractionStarter]: At program point L671(lines 664 717) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,615 INFO L451 ceAbstractionStarter]: At program point L1084(lines 1077 1094) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,616 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,616 INFO L451 ceAbstractionStarter]: At program point L1233(lines 1226 1243) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,616 INFO L448 ceAbstractionStarter]: For program point L1167-1(lines 1160 1339) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,616 INFO L451 ceAbstractionStarter]: At program point L110(lines 110 114) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,616 INFO L451 ceAbstractionStarter]: At program point L457(lines 450 467) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,616 INFO L448 ceAbstractionStarter]: For program point L870(lines 869 893) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,616 INFO L448 ceAbstractionStarter]: For program point L1316(lines 1316 1320) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,616 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 263) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,617 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 775) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,617 INFO L448 ceAbstractionStarter]: For program point L705(lines 705 709) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,617 INFO L451 ceAbstractionStarter]: At program point L1151(lines 1103 1156) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,617 INFO L448 ceAbstractionStarter]: For program point L1085(lines 1077 1094) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,617 INFO L451 ceAbstractionStarter]: At program point L375(lines 368 385) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,617 INFO L451 ceAbstractionStarter]: At program point L854(lines 854 862) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,617 INFO L451 ceAbstractionStarter]: At program point L243(lines 236 253) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,618 INFO L448 ceAbstractionStarter]: For program point L755(lines 755 759) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,618 INFO L448 ceAbstractionStarter]: For program point L689(lines 689 693) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,618 INFO L451 ceAbstractionStarter]: At program point L1135(lines 1109 1150) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,618 INFO L448 ceAbstractionStarter]: For program point L458(lines 450 467) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,618 INFO L451 ceAbstractionStarter]: At program point L1284(lines 1277 1303) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,618 INFO L451 ceAbstractionStarter]: At program point L227(lines 220 255) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,618 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 677) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,619 INFO L451 ceAbstractionStarter]: At program point L95(lines 95 119) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,619 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1090) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,619 INFO L451 ceAbstractionStarter]: At program point L475-2(lines 475 827) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,619 INFO L448 ceAbstractionStarter]: For program point L376(lines 368 385) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,619 INFO L451 ceAbstractionStarter]: At program point L1268(lines 1261 1305) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,619 INFO L448 ceAbstractionStarter]: For program point L244(lines 124 470) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,619 INFO L448 ceAbstractionStarter]: For program point L1235(lines 1235 1239) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,620 INFO L451 ceAbstractionStarter]: At program point L211(lines 204 257) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,620 INFO L451 ceAbstractionStarter]: At program point L657(lines 627 658) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,620 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 463) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,620 INFO L451 ceAbstractionStarter]: At program point L1120(lines 1109 1150) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,621 INFO L451 ceAbstractionStarter]: At program point L1054(lines 1047 1073) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,621 INFO L448 ceAbstractionStarter]: For program point L476(lines 475 827) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,621 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,621 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 249) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,621 INFO L451 ceAbstractionStarter]: At program point L278-2(lines 278 306) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,621 INFO L451 ceAbstractionStarter]: At program point L1203(lines 1196 1222) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,621 INFO L451 ceAbstractionStarter]: At program point L1038(lines 1031 1075) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,622 INFO L451 ceAbstractionStarter]: At program point L427(lines 420 446) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,622 INFO L451 ceAbstractionStarter]: At program point L807(lines 800 817) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,622 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1290) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,622 INFO L448 ceAbstractionStarter]: For program point L1253(lines 1253 1306) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,622 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 233) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,622 INFO L451 ceAbstractionStarter]: At program point L1187(lines 1180 1224) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,622 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 613) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,623 INFO L448 ceAbstractionStarter]: For program point L956(lines 956 960) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,623 INFO L451 ceAbstractionStarter]: At program point L411(lines 404 448) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,623 INFO L451 ceAbstractionStarter]: At program point L857(lines 857 861) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,623 INFO L451 ceAbstractionStarter]: At program point L345(lines 338 364) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,623 INFO L448 ceAbstractionStarter]: For program point L279(lines 278 306) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,623 INFO L448 ceAbstractionStarter]: For program point L1270(lines 1270 1274) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,624 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 217) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,624 INFO L451 ceAbstractionStarter]: At program point L725(lines 718 735) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,624 INFO L451 ceAbstractionStarter]: At program point L593(lines 586 603) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,624 INFO L451 ceAbstractionStarter]: At program point L940(lines 933 950) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,624 INFO L451 ceAbstractionStarter]: At program point L329(lines 322 366) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,624 INFO L451 ceAbstractionStarter]: At program point L808(lines 800 817) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,624 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,625 INFO L451 ceAbstractionStarter]: At program point L197(lines 167 198) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,625 INFO L451 ceAbstractionStarter]: At program point L164(lines 134 165) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,625 INFO L451 ceAbstractionStarter]: At program point L98(lines 98 118) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,625 INFO L451 ceAbstractionStarter]: At program point L577(lines 570 605) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,625 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,625 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1076) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,626 INFO L451 ceAbstractionStarter]: At program point L924(lines 917 952) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,626 INFO L448 ceAbstractionStarter]: For program point L726(lines 718 735) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,626 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1209) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,626 INFO L448 ceAbstractionStarter]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,626 INFO L448 ceAbstractionStarter]: For program point L594(lines 475 827) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L451 ceAbstractionStarter]: At program point L561(lines 554 607) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1044) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L941(lines 866 1096) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L451 ceAbstractionStarter]: At program point L908(lines 901 954) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 449) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 813) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,627 INFO L448 ceAbstractionStarter]: For program point L1189(lines 1189 1193) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1028) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 866 1096) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 367) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L727(lines 727 731) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,628 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1177) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,629 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 599) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,629 INFO L451 ceAbstractionStarter]: At program point L628-2(lines 628 656) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,629 INFO L451 ceAbstractionStarter]: At program point L975(lines 975 989) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,629 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 946) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,629 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,629 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 335) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,629 INFO L451 ceAbstractionStarter]: At program point L265(lines 258 275) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,630 INFO L451 ceAbstractionStarter]: At program point L777(lines 770 796) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,630 INFO L448 ceAbstractionStarter]: For program point L1124(lines 1124 1131) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,630 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 583) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,630 INFO L448 ceAbstractionStarter]: For program point L992(lines 991 1015) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,630 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 930) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,630 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,630 INFO L451 ceAbstractionStarter]: At program point L761(lines 754 798) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,631 INFO L451 ceAbstractionStarter]: At program point L695(lines 688 714) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,631 INFO L448 ceAbstractionStarter]: For program point L629(lines 628 656) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,631 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 567) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,631 INFO L448 ceAbstractionStarter]: For program point L910(lines 910 914) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,632 INFO L448 ceAbstractionStarter]: For program point L266(lines 258 275) no Hoare annotation was computed. 52.15/20.09 [2019-03-28 12:14:49,632 INFO L451 ceAbstractionStarter]: At program point L679(lines 672 716) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,632 INFO L451 ceAbstractionStarter]: At program point L101(lines 101 117) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,632 INFO L451 ceAbstractionStarter]: At program point L547(lines 517 548) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,632 INFO L451 ceAbstractionStarter]: At program point L514(lines 484 515) the Hoare annotation is: true 52.15/20.09 [2019-03-28 12:14:49,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:49 BasicIcfg 52.15/20.09 [2019-03-28 12:14:49,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 52.15/20.09 [2019-03-28 12:14:49,645 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 52.15/20.09 [2019-03-28 12:14:49,645 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 52.15/20.09 [2019-03-28 12:14:49,648 INFO L276 PluginConnector]: BuchiAutomizer initialized 52.15/20.09 [2019-03-28 12:14:49,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 52.15/20.09 [2019-03-28 12:14:49,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:14:47" (1/5) ... 52.15/20.09 [2019-03-28 12:14:49,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26cb86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 52.15/20.09 [2019-03-28 12:14:49,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:14:47" (2/5) ... 52.15/20.09 [2019-03-28 12:14:49,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26cb86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 52.15/20.09 [2019-03-28 12:14:49,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:14:49" (3/5) ... 52.15/20.09 [2019-03-28 12:14:49,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26cb86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 52.15/20.09 [2019-03-28 12:14:49,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:14:49" (4/5) ... 52.15/20.09 [2019-03-28 12:14:49,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26cb86cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:14:49, skipping insertion in model container 52.15/20.09 [2019-03-28 12:14:49,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 52.15/20.09 [2019-03-28 12:14:49,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:14:49" (5/5) ... 52.15/20.09 [2019-03-28 12:14:49,654 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 52.15/20.09 [2019-03-28 12:14:49,679 INFO L133 ementStrategyFactory]: Using default assertion order modulation 52.15/20.09 [2019-03-28 12:14:49,679 INFO L374 BuchiCegarLoop]: Interprodecural is true 52.15/20.09 [2019-03-28 12:14:49,680 INFO L375 BuchiCegarLoop]: Hoare is true 52.15/20.09 [2019-03-28 12:14:49,680 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 52.15/20.09 [2019-03-28 12:14:49,680 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 52.15/20.09 [2019-03-28 12:14:49,680 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 52.15/20.09 [2019-03-28 12:14:49,680 INFO L379 BuchiCegarLoop]: Difference is false 52.15/20.09 [2019-03-28 12:14:49,680 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 52.15/20.09 [2019-03-28 12:14:49,680 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 52.15/20.09 [2019-03-28 12:14:49,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states. 52.15/20.09 [2019-03-28 12:14:49,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 209 52.15/20.09 [2019-03-28 12:14:49,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:14:49,718 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:14:49,726 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:49,727 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:49,727 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 52.15/20.09 [2019-03-28 12:14:49,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states. 52.15/20.09 [2019-03-28 12:14:49,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 209 52.15/20.09 [2019-03-28 12:14:49,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:14:49,736 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:14:49,737 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:49,737 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:49,743 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 74#L1162true [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 184#L1162-2true [2103] L1162-2-->L1167-1: Formula: (and (> v_~s_run_i~0_4 1) (= v_~s_run_st~0_4 2)) InVars {~s_run_i~0=v_~s_run_i~0_4} OutVars{~s_run_st~0=v_~s_run_st~0_4, ~s_run_i~0=v_~s_run_i~0_4} AuxVars[] AssignedVars[~s_run_st~0] 86#L1167-1true [1588] L1167-1-->L1173: Formula: (= v_~m_run_pc~0_4 1) InVars {~m_run_pc~0=v_~m_run_pc~0_4} OutVars{~m_run_pc~0=v_~m_run_pc~0_4} AuxVars[] AssignedVars[] 72#L1173true [1560] L1173-->L1212: Formula: (and (= v_~m_run_st~0_5 0) (= 1 v_~c_m_ev~0_6)) InVars {~c_m_ev~0=v_~c_m_ev~0_6} OutVars{~c_m_ev~0=v_~c_m_ev~0_6, ~m_run_st~0=v_~m_run_st~0_5} AuxVars[] AssignedVars[~m_run_st~0] 167#L1212true [2111] L1212-->L1233: Formula: (> v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 92#L1233true [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 155#L1328-1true 52.15/20.09 [2019-03-28 12:14:49,744 INFO L796 eck$LassoCheckResult]: Loop: 155#L1328-1true [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 170#L1135true [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54#L1110true [2136] L1110-->L1114: Formula: (> v_~m_run_st~0_17 0) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 230#L1114true [2142] L1114-->L1151: Formula: (> 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 73#L1151true [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 64#L1253true [1542] L1253-->L1254: Formula: (= v_~m_run_pc~0_60 1) InVars {~m_run_pc~0=v_~m_run_pc~0_60} OutVars{~m_run_pc~0=v_~m_run_pc~0_60} AuxVars[] AssignedVars[] 18#L1254true [1449] L1254-->L1293: Formula: (and (= v_~m_run_st~0_31 0) (= 1 v_~c_m_ev~0_18)) InVars {~c_m_ev~0=v_~c_m_ev~0_18} OutVars{~c_m_ev~0=v_~c_m_ev~0_18, ~m_run_st~0=v_~m_run_st~0_31} AuxVars[] AssignedVars[~m_run_st~0] 113#L1293true [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 35#L1314true [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 112#L1315true [1642] L1315-->L1328-1: Formula: (= v_~m_run_st~0_42 0) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 155#L1328-1true 52.15/20.09 [2019-03-28 12:14:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -787419167, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:49,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:49,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:49,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.09 [2019-03-28 12:14:49,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 52.15/20.09 [2019-03-28 12:14:49,869 INFO L799 eck$LassoCheckResult]: stem already infeasible 52.15/20.09 [2019-03-28 12:14:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1184906646, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:49,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:49,964 INFO L216 LassoAnalysis]: Preferences: 52.15/20.09 [2019-03-28 12:14:49,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 52.15/20.09 [2019-03-28 12:14:49,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 52.15/20.09 [2019-03-28 12:14:49,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 52.15/20.09 [2019-03-28 12:14:49,966 INFO L127 ssoRankerPreferences]: Use exernal solver: true 52.15/20.09 [2019-03-28 12:14:49,967 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:49,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 52.15/20.09 [2019-03-28 12:14:49,967 INFO L130 ssoRankerPreferences]: Path of dumped script: 52.15/20.09 [2019-03-28 12:14:49,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 52.15/20.09 [2019-03-28 12:14:49,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 52.15/20.09 [2019-03-28 12:14:49,967 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 52.15/20.09 [2019-03-28 12:14:49,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:49,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,096 INFO L300 LassoAnalysis]: Preprocessing complete. 52.15/20.09 [2019-03-28 12:14:50,097 INFO L412 LassoAnalysis]: Checking for nontermination... 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,105 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,121 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,175 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,203 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,203 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_st~0=-1} Honda state: {~s_run_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,219 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,220 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=3} Honda state: {~s_run_pc~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,253 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,301 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,322 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~m_run_pc~0=1} Honda state: {~m_run_pc~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,353 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,357 INFO L445 LassoAnalysis]: Proved nontermination for one component. 52.15/20.09 [2019-03-28 12:14:50,357 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,386 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:50,427 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:50,459 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 52.15/20.09 [2019-03-28 12:14:50,462 INFO L216 LassoAnalysis]: Preferences: 52.15/20.09 [2019-03-28 12:14:50,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 52.15/20.09 [2019-03-28 12:14:50,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 52.15/20.09 [2019-03-28 12:14:50,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 52.15/20.09 [2019-03-28 12:14:50,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false 52.15/20.09 [2019-03-28 12:14:50,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:50,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 52.15/20.09 [2019-03-28 12:14:50,463 INFO L130 ssoRankerPreferences]: Path of dumped script: 52.15/20.09 [2019-03-28 12:14:50,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 52.15/20.09 [2019-03-28 12:14:50,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 52.15/20.09 [2019-03-28 12:14:50,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 52.15/20.09 [2019-03-28 12:14:50,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:50,560 INFO L300 LassoAnalysis]: Preprocessing complete. 52.15/20.09 [2019-03-28 12:14:50,566 INFO L497 LassoAnalysis]: Using template 'affine'. 52.15/20.09 [2019-03-28 12:14:50,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 52.15/20.09 [2019-03-28 12:14:50,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:50,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:50,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:50,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:50,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:50,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:50,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:50,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:50,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 52.15/20.09 [2019-03-28 12:14:50,616 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 52.15/20.09 [2019-03-28 12:14:50,616 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 52.15/20.09 [2019-03-28 12:14:50,618 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 52.15/20.09 [2019-03-28 12:14:50,618 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 52.15/20.09 [2019-03-28 12:14:50,619 INFO L518 LassoAnalysis]: Proved termination. 52.15/20.09 [2019-03-28 12:14:50,619 INFO L520 LassoAnalysis]: Termination argument consisting of: 52.15/20.09 Ranking function f(~m_run_st~0) = 1*~m_run_st~0 52.15/20.09 Supporting invariants [] 52.15/20.09 [2019-03-28 12:14:50,620 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 52.15/20.09 [2019-03-28 12:14:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:50,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:50,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:50,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:50,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:50,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:50,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:50,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:50,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:50,813 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 52.15/20.09 [2019-03-28 12:14:50,819 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 52.15/20.09 [2019-03-28 12:14:50,820 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 228 states. Second operand 5 states. 52.15/20.09 [2019-03-28 12:14:53,689 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 228 states.. Second operand 5 states. Result 1573 states and 4177 transitions. Complement of second has 14 states. 52.15/20.09 [2019-03-28 12:14:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states 52.15/20.09 [2019-03-28 12:14:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 52.15/20.09 [2019-03-28 12:14:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2670 transitions. 52.15/20.09 [2019-03-28 12:14:53,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 7 letters. Loop has 10 letters. 52.15/20.09 [2019-03-28 12:14:53,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:53,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 17 letters. Loop has 10 letters. 52.15/20.09 [2019-03-28 12:14:53,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:53,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 7 letters. Loop has 20 letters. 52.15/20.09 [2019-03-28 12:14:53,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:53,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1573 states and 4177 transitions. 52.15/20.09 [2019-03-28 12:14:53,757 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 763 52.15/20.09 [2019-03-28 12:14:53,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1573 states to 882 states and 2315 transitions. 52.15/20.09 [2019-03-28 12:14:53,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 784 52.15/20.09 [2019-03-28 12:14:53,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 808 52.15/20.09 [2019-03-28 12:14:53,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 2315 transitions. 52.15/20.09 [2019-03-28 12:14:53,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:14:53,782 INFO L706 BuchiCegarLoop]: Abstraction has 882 states and 2315 transitions. 52.15/20.09 [2019-03-28 12:14:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 2315 transitions. 52.15/20.09 [2019-03-28 12:14:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 786. 52.15/20.09 [2019-03-28 12:14:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. 52.15/20.09 [2019-03-28 12:14:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2064 transitions. 52.15/20.09 [2019-03-28 12:14:53,860 INFO L729 BuchiCegarLoop]: Abstraction has 786 states and 2064 transitions. 52.15/20.09 [2019-03-28 12:14:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.09 [2019-03-28 12:14:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.09 [2019-03-28 12:14:53,865 INFO L87 Difference]: Start difference. First operand 786 states and 2064 transitions. Second operand 3 states. 52.15/20.09 [2019-03-28 12:14:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.09 [2019-03-28 12:14:54,317 INFO L93 Difference]: Finished difference Result 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.09 [2019-03-28 12:14:54,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,344 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 690 52.15/20.09 [2019-03-28 12:14:54,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 52.15/20.09 [2019-03-28 12:14:54,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 52.15/20.09 [2019-03-28 12:14:54,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:14:54,353 INFO L706 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. 52.15/20.09 [2019-03-28 12:14:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. 52.15/20.09 [2019-03-28 12:14:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,373 INFO L729 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,373 INFO L609 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,373 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 52.15/20.09 [2019-03-28 12:14:54,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:54,380 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 690 52.15/20.09 [2019-03-28 12:14:54,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:14:54,380 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:14:54,381 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:54,381 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:54,382 INFO L794 eck$LassoCheckResult]: Stem: 3750#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 3713#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 3714#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 3741#L1167-1 [1588] L1167-1-->L1173: Formula: (= v_~m_run_pc~0_4 1) InVars {~m_run_pc~0=v_~m_run_pc~0_4} OutVars{~m_run_pc~0=v_~m_run_pc~0_4} AuxVars[] AssignedVars[] 3708#L1173 [1560] L1173-->L1212: Formula: (and (= v_~m_run_st~0_5 0) (= 1 v_~c_m_ev~0_6)) InVars {~c_m_ev~0=v_~c_m_ev~0_6} OutVars{~c_m_ev~0=v_~c_m_ev~0_6, ~m_run_st~0=v_~m_run_st~0_5} AuxVars[] AssignedVars[~m_run_st~0] 3709#L1212 [2111] L1212-->L1233: Formula: (> v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 3751#L1233 [2118] L1233-->L1328-1: Formula: (> v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 3752#L1328-1 52.15/20.09 [2019-03-28 12:14:54,382 INFO L796 eck$LassoCheckResult]: Loop: 3752#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 3731#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3845#L1110 [2136] L1110-->L1114: Formula: (> v_~m_run_st~0_17 0) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 3986#L1114 [2142] L1114-->L1151: Formula: (> 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 3711#L1151 [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 3703#L1253 [1542] L1253-->L1254: Formula: (= v_~m_run_pc~0_60 1) InVars {~m_run_pc~0=v_~m_run_pc~0_60} OutVars{~m_run_pc~0=v_~m_run_pc~0_60} AuxVars[] AssignedVars[] 3576#L1254 [1449] L1254-->L1293: Formula: (and (= v_~m_run_st~0_31 0) (= 1 v_~c_m_ev~0_18)) InVars {~c_m_ev~0=v_~c_m_ev~0_18} OutVars{~c_m_ev~0=v_~c_m_ev~0_18, ~m_run_st~0=v_~m_run_st~0_31} AuxVars[] AssignedVars[~m_run_st~0] 3578#L1293 [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 3794#L1314 [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 4004#L1315 [1642] L1315-->L1328-1: Formula: (= v_~m_run_st~0_42 0) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 3752#L1328-1 52.15/20.09 [2019-03-28 12:14:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1068169552, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:54,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:54,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:54,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.09 [2019-03-28 12:14:54,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 52.15/20.09 [2019-03-28 12:14:54,411 INFO L799 eck$LassoCheckResult]: stem already infeasible 52.15/20.09 [2019-03-28 12:14:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1184906646, now seen corresponding path program 2 times 52.15/20.09 [2019-03-28 12:14:54,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:54,512 INFO L216 LassoAnalysis]: Preferences: 52.15/20.09 [2019-03-28 12:14:54,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 52.15/20.09 [2019-03-28 12:14:54,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 52.15/20.09 [2019-03-28 12:14:54,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 52.15/20.09 [2019-03-28 12:14:54,513 INFO L127 ssoRankerPreferences]: Use exernal solver: true 52.15/20.09 [2019-03-28 12:14:54,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:54,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 52.15/20.09 [2019-03-28 12:14:54,513 INFO L130 ssoRankerPreferences]: Path of dumped script: 52.15/20.09 [2019-03-28 12:14:54,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 52.15/20.09 [2019-03-28 12:14:54,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 52.15/20.09 [2019-03-28 12:14:54,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 52.15/20.09 [2019-03-28 12:14:54,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,607 INFO L300 LassoAnalysis]: Preprocessing complete. 52.15/20.09 [2019-03-28 12:14:54,607 INFO L412 LassoAnalysis]: Checking for nontermination... 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:54,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:54,612 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 52.15/20.09 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 52.15/20.09 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:54,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 52.15/20.09 [2019-03-28 12:14:54,646 INFO L163 nArgumentSynthesizer]: Using integer mode. 52.15/20.09 [2019-03-28 12:14:54,678 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 52.15/20.09 [2019-03-28 12:14:54,680 INFO L216 LassoAnalysis]: Preferences: 52.15/20.09 [2019-03-28 12:14:54,681 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 52.15/20.09 [2019-03-28 12:14:54,681 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 52.15/20.09 [2019-03-28 12:14:54,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 52.15/20.09 [2019-03-28 12:14:54,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false 52.15/20.09 [2019-03-28 12:14:54,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 52.15/20.09 [2019-03-28 12:14:54,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 52.15/20.09 [2019-03-28 12:14:54,681 INFO L130 ssoRankerPreferences]: Path of dumped script: 52.15/20.09 [2019-03-28 12:14:54,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 52.15/20.09 [2019-03-28 12:14:54,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 52.15/20.09 [2019-03-28 12:14:54,682 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 52.15/20.09 [2019-03-28 12:14: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 52.15/20.09 [2019-03-28 12:14:54,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 52.15/20.09 [2019-03-28 12:14:54,789 INFO L300 LassoAnalysis]: Preprocessing complete. 52.15/20.09 [2019-03-28 12:14:54,790 INFO L497 LassoAnalysis]: Using template 'affine'. 52.15/20.09 [2019-03-28 12:14:54,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 52.15/20.09 Termination analysis: LINEAR_WITH_GUESSES 52.15/20.09 Number of strict supporting invariants: 0 52.15/20.09 Number of non-strict supporting invariants: 1 52.15/20.09 Consider only non-deceasing supporting invariants: true 52.15/20.09 Simplify termination arguments: true 52.15/20.09 Simplify supporting invariants: trueOverapproximate stem: false 52.15/20.09 [2019-03-28 12:14:54,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. 52.15/20.09 [2019-03-28 12:14:54,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 52.15/20.09 [2019-03-28 12:14:54,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 52.15/20.09 [2019-03-28 12:14:54,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 52.15/20.09 [2019-03-28 12:14:54,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 52.15/20.09 [2019-03-28 12:14:54,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 52.15/20.09 [2019-03-28 12:14:54,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 52.15/20.09 [2019-03-28 12:14:54,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 52.15/20.09 [2019-03-28 12:14:54,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 52.15/20.09 [2019-03-28 12:14:54,798 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 52.15/20.09 [2019-03-28 12:14:54,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 52.15/20.09 [2019-03-28 12:14:54,799 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 52.15/20.09 [2019-03-28 12:14:54,799 INFO L518 LassoAnalysis]: Proved termination. 52.15/20.09 [2019-03-28 12:14:54,799 INFO L520 LassoAnalysis]: Termination argument consisting of: 52.15/20.09 Ranking function f(~m_run_st~0) = 1*~m_run_st~0 52.15/20.09 Supporting invariants [] 52.15/20.09 [2019-03-28 12:14:54,800 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 52.15/20.09 [2019-03-28 12:14:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:54,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:54,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:54,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:54,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:54,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:54,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:54,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 52.15/20.09 [2019-03-28 12:14:54,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 52.15/20.09 [2019-03-28 12:14:54,939 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization 52.15/20.09 [2019-03-28 12:14:54,940 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 52.15/20.09 [2019-03-28 12:14:54,940 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 786 states and 2063 transitions. cyclomatic complexity: 1281 Second operand 5 states. 52.15/20.09 [2019-03-28 12:14:57,864 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 786 states and 2063 transitions. cyclomatic complexity: 1281. Second operand 5 states. Result 2131 states and 5630 transitions. Complement of second has 14 states. 52.15/20.09 [2019-03-28 12:14:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states 52.15/20.09 [2019-03-28 12:14:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 52.15/20.09 [2019-03-28 12:14:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2669 transitions. 52.15/20.09 [2019-03-28 12:14:57,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 7 letters. Loop has 10 letters. 52.15/20.09 [2019-03-28 12:14:57,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:57,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 17 letters. Loop has 10 letters. 52.15/20.09 [2019-03-28 12:14:57,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:57,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 7 letters. Loop has 20 letters. 52.15/20.09 [2019-03-28 12:14:57,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. 52.15/20.09 [2019-03-28 12:14:57,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2131 states and 5630 transitions. 52.15/20.09 [2019-03-28 12:14:57,903 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1244 52.15/20.09 [2019-03-28 12:14:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2131 states to 1440 states and 3768 transitions. 52.15/20.09 [2019-03-28 12:14:57,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1268 52.15/20.09 [2019-03-28 12:14:57,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1292 52.15/20.09 [2019-03-28 12:14:57,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1440 states and 3768 transitions. 52.15/20.09 [2019-03-28 12:14:57,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:14:57,917 INFO L706 BuchiCegarLoop]: Abstraction has 1440 states and 3768 transitions. 52.15/20.09 [2019-03-28 12:14:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states and 3768 transitions. 52.15/20.09 [2019-03-28 12:14:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 786. 52.15/20.09 [2019-03-28 12:14:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. 52.15/20.09 [2019-03-28 12:14:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:57,937 INFO L729 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. 52.15/20.09 [2019-03-28 12:14:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.09 [2019-03-28 12:14:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.09 [2019-03-28 12:14:57,937 INFO L87 Difference]: Start difference. First operand 786 states and 2063 transitions. Second operand 3 states. 52.15/20.09 [2019-03-28 12:14:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.09 [2019-03-28 12:14:58,881 INFO L93 Difference]: Finished difference Result 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.09 [2019-03-28 12:14:58,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1128 52.15/20.09 [2019-03-28 12:14:58,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1200 states to 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 52.15/20.09 [2019-03-28 12:14:58,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1144 52.15/20.09 [2019-03-28 12:14:58,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:14:58,920 INFO L706 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. 52.15/20.09 [2019-03-28 12:14:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. 52.15/20.09 [2019-03-28 12:14:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,944 INFO L729 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,945 INFO L609 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,945 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 52.15/20.09 [2019-03-28 12:14:58,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1200 states and 2672 transitions. 52.15/20.09 [2019-03-28 12:14:58,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1128 52.15/20.09 [2019-03-28 12:14:58,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:14:58,952 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:14:58,953 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:58,953 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:58,953 INFO L794 eck$LassoCheckResult]: Stem: 8787#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 8746#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 8747#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 8778#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 8779#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 8704#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 8705#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 8743#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 8791#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 8792#L1212 [1759] L1212-->L1227: Formula: (= v_~s_run_pc~0_5 2) InVars {~s_run_pc~0=v_~s_run_pc~0_5} OutVars{~s_run_pc~0=v_~s_run_pc~0_5} AuxVars[] AssignedVars[] 8833#L1227 [1652] L1227-->L1328-1: Formula: (and (= v_~s_run_st~0_6 0) (= 1 v_~c_write_req_ev~0_5)) InVars {~c_write_req_ev~0=v_~c_write_req_ev~0_5} OutVars{~s_run_st~0=v_~s_run_st~0_6, ~c_write_req_ev~0=v_~c_write_req_ev~0_5} AuxVars[] AssignedVars[~s_run_st~0] 8834#L1328-1 52.15/20.09 [2019-03-28 12:14:58,953 INFO L796 eck$LassoCheckResult]: Loop: 8834#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 9525#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 9519#L1110 [2136] L1110-->L1114: Formula: (> v_~m_run_st~0_17 0) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 9520#L1114 [2142] L1114-->L1151: Formula: (> 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 9521#L1151 [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 9573#L1253 [2138] L1253-->L1260: Formula: (< v_~m_run_pc~0_63 1) InVars {~m_run_pc~0=v_~m_run_pc~0_63} OutVars{~m_run_pc~0=v_~m_run_pc~0_63} AuxVars[] AssignedVars[] 9055#L1260 [2146] L1260-->L1268: Formula: (< v_~m_run_pc~0_67 2) InVars {~m_run_pc~0=v_~m_run_pc~0_67} OutVars{~m_run_pc~0=v_~m_run_pc~0_67} AuxVars[] AssignedVars[] 9567#L1268 [2157] L1268-->L1276: Formula: (< v_~m_run_pc~0_71 3) InVars {~m_run_pc~0=v_~m_run_pc~0_71} OutVars{~m_run_pc~0=v_~m_run_pc~0_71} AuxVars[] AssignedVars[] 9564#L1276 [2169] L1276-->L1284: Formula: (< v_~m_run_pc~0_74 4) InVars {~m_run_pc~0=v_~m_run_pc~0_74} OutVars{~m_run_pc~0=v_~m_run_pc~0_74} AuxVars[] AssignedVars[] 9560#L1284 [2180] L1284-->L1292: Formula: (< v_~m_run_pc~0_76 5) InVars {~m_run_pc~0=v_~m_run_pc~0_76} OutVars{~m_run_pc~0=v_~m_run_pc~0_76} AuxVars[] AssignedVars[] 9557#L1292 [2191] L1292-->L1293: Formula: (< v_~m_run_pc~0_78 6) InVars {~m_run_pc~0=v_~m_run_pc~0_78} OutVars{~m_run_pc~0=v_~m_run_pc~0_78} AuxVars[] AssignedVars[] 9550#L1293 [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 9545#L1314 [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 9537#L1315 [1642] L1315-->L1328-1: Formula: (= v_~m_run_st~0_42 0) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 8834#L1328-1 52.15/20.09 [2019-03-28 12:14:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:58,954 INFO L82 PathProgramCache]: Analyzing trace with hash -894501109, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:58,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:58,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:58,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:58,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.09 [2019-03-28 12:14:58,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 52.15/20.09 [2019-03-28 12:14:58,986 INFO L799 eck$LassoCheckResult]: stem already infeasible 52.15/20.09 [2019-03-28 12:14:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:58,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1869973382, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:58,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:58,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:58,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.09 [2019-03-28 12:14:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 52.15/20.09 [2019-03-28 12:14:59,004 INFO L811 eck$LassoCheckResult]: loop already infeasible 52.15/20.09 [2019-03-28 12:14:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.09 [2019-03-28 12:14:59,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.09 [2019-03-28 12:14:59,005 INFO L87 Difference]: Start difference. First operand 1200 states and 2672 transitions. cyclomatic complexity: 1476 Second operand 3 states. 52.15/20.09 [2019-03-28 12:14:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.09 [2019-03-28 12:14:59,848 INFO L93 Difference]: Finished difference Result 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.09 [2019-03-28 12:14:59,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1450 52.15/20.09 [2019-03-28 12:14:59,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1568 states to 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1464 52.15/20.09 [2019-03-28 12:14:59,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1464 52.15/20.09 [2019-03-28 12:14:59,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:14:59,889 INFO L706 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. 52.15/20.09 [2019-03-28 12:14:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. 52.15/20.09 [2019-03-28 12:14:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,918 INFO L729 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,918 INFO L609 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,918 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 52.15/20.09 [2019-03-28 12:14:59,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1568 states and 3198 transitions. 52.15/20.09 [2019-03-28 12:14:59,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1450 52.15/20.09 [2019-03-28 12:14:59,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:14:59,926 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:14:59,927 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:59,927 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:14:59,927 INFO L794 eck$LassoCheckResult]: Stem: 11567#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 11526#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 11527#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 11557#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 11558#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 11471#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 11472#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 11523#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 11571#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 11572#L1212 [2110] L1212-->L1233: Formula: (< v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 11569#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 11570#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 11771#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12891#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 12734#L1114-1 52.15/20.09 [2019-03-28 12:14:59,928 INFO L796 eck$LassoCheckResult]: Loop: 12734#L1114-1 [2140] L1114-1-->L1120: Formula: (< v_~m_run_st~0_76 0) InVars {~m_run_st~0=v_~m_run_st~0_76} OutVars{~m_run_st~0=v_~m_run_st~0_76} AuxVars[] AssignedVars[] 11668#L1120 [2150] L1120-->L1135: Formula: (< 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 11666#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 11690#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 12734#L1114-1 52.15/20.09 [2019-03-28 12:14:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:59,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1764915356, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:59,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:59,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:14:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:14:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash 66798771, now seen corresponding path program 1 times 52.15/20.09 [2019-03-28 12:14:59,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:14:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:14:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:14:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.09 [2019-03-28 12:14:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.09 [2019-03-28 12:14:59,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.09 [2019-03-28 12:14:59,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 52.15/20.09 [2019-03-28 12:14:59,962 INFO L811 eck$LassoCheckResult]: loop already infeasible 52.15/20.09 [2019-03-28 12:14:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.09 [2019-03-28 12:14:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.09 [2019-03-28 12:14:59,963 INFO L87 Difference]: Start difference. First operand 1568 states and 3198 transitions. cyclomatic complexity: 1633 Second operand 3 states. 52.15/20.09 [2019-03-28 12:15:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.09 [2019-03-28 12:15:00,523 INFO L93 Difference]: Finished difference Result 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.09 [2019-03-28 12:15:00,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,551 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 52.15/20.09 [2019-03-28 12:15:00,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1752 states to 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1648 52.15/20.09 [2019-03-28 12:15:00,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1648 52.15/20.09 [2019-03-28 12:15:00,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.09 [2019-03-28 12:15:00,564 INFO L706 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. 52.15/20.09 [2019-03-28 12:15:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. 52.15/20.09 [2019-03-28 12:15:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,597 INFO L729 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,597 INFO L609 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,597 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 52.15/20.09 [2019-03-28 12:15:00,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1752 states and 3578 transitions. 52.15/20.09 [2019-03-28 12:15:00,605 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 52.15/20.09 [2019-03-28 12:15:00,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.09 [2019-03-28 12:15:00,605 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.09 [2019-03-28 12:15:00,606 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:15:00,606 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 52.15/20.09 [2019-03-28 12:15:00,606 INFO L794 eck$LassoCheckResult]: Stem: 14896#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 14857#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 14858#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 14886#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 14887#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 14802#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 14803#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 14854#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 14900#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 14901#L1212 [2110] L1212-->L1233: Formula: (< v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 14898#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 14899#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 15141#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16084#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 15979#L1114-1 52.15/20.09 [2019-03-28 12:15:00,607 INFO L796 eck$LassoCheckResult]: Loop: 15979#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_~m_run_st~0_18 0) (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 15131#L1124 [1739] L1124-->L1120: Formula: (= v_ULTIMATE.start_eval_~tmp~0_5 0) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 15926#L1120 [2150] L1120-->L1135: Formula: (< 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 16097#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 15989#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 15979#L1114-1 52.15/20.09 [2019-03-28 12:15:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:15:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1764915356, now seen corresponding path program 2 times 52.15/20.09 [2019-03-28 12:15:00,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.09 [2019-03-28 12:15:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.09 [2019-03-28 12:15:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:15:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:15:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.09 [2019-03-28 12:15:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:15:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.09 [2019-03-28 12:15:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.09 [2019-03-28 12:15:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1811389522, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:00,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash 343292623, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:00,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.10 [2019-03-28 12:15:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.10 [2019-03-28 12:15:00,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.10 [2019-03-28 12:15:00,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 52.15/20.10 [2019-03-28 12:15:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.10 [2019-03-28 12:15:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.10 [2019-03-28 12:15:00,682 INFO L87 Difference]: Start difference. First operand 1752 states and 3578 transitions. cyclomatic complexity: 1830 Second operand 3 states. 52.15/20.10 [2019-03-28 12:15:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.10 [2019-03-28 12:15:01,419 INFO L93 Difference]: Finished difference Result 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.10 [2019-03-28 12:15:01,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3164 52.15/20.10 [2019-03-28 12:15:01,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3405 states to 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3213 52.15/20.10 [2019-03-28 12:15:01,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3213 52.15/20.10 [2019-03-28 12:15:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.10 [2019-03-28 12:15:01,497 INFO L706 BuchiCegarLoop]: Abstraction has 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states and 6916 transitions. 52.15/20.10 [2019-03-28 12:15:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 2805. 52.15/20.10 [2019-03-28 12:15:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. 52.15/20.10 [2019-03-28 12:15:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 5748 transitions. 52.15/20.10 [2019-03-28 12:15:01,559 INFO L729 BuchiCegarLoop]: Abstraction has 2805 states and 5748 transitions. 52.15/20.10 [2019-03-28 12:15:01,559 INFO L609 BuchiCegarLoop]: Abstraction has 2805 states and 5748 transitions. 52.15/20.10 [2019-03-28 12:15:01,559 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 52.15/20.10 [2019-03-28 12:15:01,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2805 states and 5748 transitions. 52.15/20.10 [2019-03-28 12:15:01,570 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2642 52.15/20.10 [2019-03-28 12:15:01,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.10 [2019-03-28 12:15:01,571 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.10 [2019-03-28 12:15:01,571 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:01,571 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:01,572 INFO L794 eck$LassoCheckResult]: Stem: 20063#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 20021#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 20022#L1162-2 [2102] L1162-2-->L1167-1: Formula: (and (< v_~s_run_i~0_4 1) (= v_~s_run_st~0_4 2)) InVars {~s_run_i~0=v_~s_run_i~0_4} OutVars{~s_run_st~0=v_~s_run_st~0_4, ~s_run_i~0=v_~s_run_i~0_4} AuxVars[] AssignedVars[~s_run_st~0] 20218#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 20325#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 20324#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 20016#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 20017#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 20067#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 20068#L1212 [2110] L1212-->L1233: Formula: (< v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 20065#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 20066#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 20334#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 21991#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 21891#L1114-1 52.15/20.10 [2019-03-28 12:15:01,573 INFO L796 eck$LassoCheckResult]: Loop: 21891#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_~m_run_st~0_18 0) (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 20176#L1124 [1739] L1124-->L1120: Formula: (= v_ULTIMATE.start_eval_~tmp~0_5 0) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 20177#L1120 [2150] L1120-->L1135: Formula: (< 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 21992#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 21893#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 21891#L1114-1 52.15/20.10 [2019-03-28 12:15:01,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1307557163, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:01,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:01,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:01,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.10 [2019-03-28 12:15:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.10 [2019-03-28 12:15:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.10 [2019-03-28 12:15:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 52.15/20.10 [2019-03-28 12:15:01,633 INFO L799 eck$LassoCheckResult]: stem already infeasible 52.15/20.10 [2019-03-28 12:15:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1811389522, now seen corresponding path program 2 times 52.15/20.10 [2019-03-28 12:15:01,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.10 [2019-03-28 12:15:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.10 [2019-03-28 12:15:01,663 INFO L87 Difference]: Start difference. First operand 2805 states and 5748 transitions. cyclomatic complexity: 2947 Second operand 3 states. 52.15/20.10 [2019-03-28 12:15:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.10 [2019-03-28 12:15:01,981 INFO L93 Difference]: Finished difference Result 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.10 [2019-03-28 12:15:01,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2642 52.15/20.10 [2019-03-28 12:15:02,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2781 states to 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2661 52.15/20.10 [2019-03-28 12:15:02,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2661 52.15/20.10 [2019-03-28 12:15:02,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.10 [2019-03-28 12:15:02,032 INFO L706 BuchiCegarLoop]: Abstraction has 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. 52.15/20.10 [2019-03-28 12:15:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. 52.15/20.10 [2019-03-28 12:15:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,076 INFO L729 BuchiCegarLoop]: Abstraction has 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,076 INFO L609 BuchiCegarLoop]: Abstraction has 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,076 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 52.15/20.10 [2019-03-28 12:15:02,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2781 states and 5716 transitions. 52.15/20.10 [2019-03-28 12:15:02,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2642 52.15/20.10 [2019-03-28 12:15:02,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.10 [2019-03-28 12:15:02,085 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.10 [2019-03-28 12:15:02,085 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:02,085 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:02,086 INFO L794 eck$LassoCheckResult]: Stem: 25657#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 25613#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 25614#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 25644#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 25645#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 25558#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 25559#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 25609#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 25660#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 25661#L1212 [2110] L1212-->L1233: Formula: (< v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 25658#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 25659#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 25890#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28128#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 27797#L1114-1 52.15/20.10 [2019-03-28 12:15:02,086 INFO L796 eck$LassoCheckResult]: Loop: 27797#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_~m_run_st~0_18 0) (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 25755#L1124 [1739] L1124-->L1120: Formula: (= v_ULTIMATE.start_eval_~tmp~0_5 0) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 25756#L1120 [2151] L1120-->L1135: Formula: (> 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 27073#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28201#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 27797#L1114-1 52.15/20.10 [2019-03-28 12:15:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1764915356, now seen corresponding path program 3 times 52.15/20.10 [2019-03-28 12:15:02,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1811390483, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:02,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash 343293584, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:02,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 52.15/20.10 [2019-03-28 12:15:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 52.15/20.10 [2019-03-28 12:15:02,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 52.15/20.10 [2019-03-28 12:15:02,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 52.15/20.10 [2019-03-28 12:15:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 52.15/20.10 [2019-03-28 12:15:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 52.15/20.10 [2019-03-28 12:15:02,152 INFO L87 Difference]: Start difference. First operand 2781 states and 5716 transitions. cyclomatic complexity: 2939 Second operand 3 states. 52.15/20.10 [2019-03-28 12:15:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 52.15/20.10 [2019-03-28 12:15:02,511 INFO L93 Difference]: Finished difference Result 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 52.15/20.10 [2019-03-28 12:15:02,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,538 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2535 52.15/20.10 [2019-03-28 12:15:02,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2662 states to 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2563 52.15/20.10 [2019-03-28 12:15:02,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2563 52.15/20.10 [2019-03-28 12:15:02,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 52.15/20.10 [2019-03-28 12:15:02,563 INFO L706 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. 52.15/20.10 [2019-03-28 12:15:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. 52.15/20.10 [2019-03-28 12:15:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,602 INFO L729 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,602 INFO L609 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,602 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 52.15/20.10 [2019-03-28 12:15:02,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2662 states and 5412 transitions. 52.15/20.10 [2019-03-28 12:15:02,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2535 52.15/20.10 [2019-03-28 12:15:02,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 52.15/20.10 [2019-03-28 12:15:02,610 INFO L119 BuchiIsEmpty]: Starting construction of run 52.15/20.10 [2019-03-28 12:15:02,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:02,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 52.15/20.10 [2019-03-28 12:15:02,611 INFO L794 eck$LassoCheckResult]: Stem: 31107#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 0 v_~d_t~0_14) (= 0 v_~s_run_st~0_33) (= v_~s_run_i~0_5 1) (= v_~req_t_d___0~0_6 0) (= v_~rsp_tt_d~0_8 0) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_tt_type~0_8) (= 0 v_~m_run_pc~0_143) (= v_~c_req_type~0_5 0) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_t_type~0_8) (= v_~c_empty_req~0_12 1) (= v_~s_memory0~0_4 0) (= 0 v_~rsp_t_status___0~0_6) (= v_~c_write_req_ev~0_27 2) (= 1 v_~m_run_i~0_5) (= v_~s_run_pc~0_51 0) (= v_~rsp_t_type___0~0_6 0) (= v_~c_req_d~0_5 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_t_type~0_8) (= v_~req_t_a~0_8 0) (= v_~c_read_req_ev~0_45 2) (= 0 v_~c_rsp_d~0_5) (= v_~c_req_a~0_5 0) (= 0 v_~rsp_t_d~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~a_t~0_14) (= v_~req_t_a___0~0_6 0) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_status~0_8) (= v_~m_run_st~0_77 0) (= 0 v_~req_t_type___0~0_6) (= 0 v_~rsp_tt_status~0_8) (= v_~c_empty_rsp~0_12 1) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~rsp_t_d___0~0_6) (= v_~req_tt_type~0_8 0) (= v_~req_t_d~0_8 0) (= 0 v_~c_rsp_type~0_5) (= v_~c_read_rsp_ev~0_27 2) (= 0 v_~req_tt_d~0_8)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 31063#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 31064#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_3 0) (= v_~s_run_i~0_3 1)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 31095#L1167-1 [2104] L1167-1-->L1179: Formula: (< v_~m_run_pc~0_6 1) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 31096#L1179 [2109] L1179-->L1187: Formula: (< v_~m_run_pc~0_10 2) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 31011#L1187 [2115] L1187-->L1195: Formula: (< v_~m_run_pc~0_14 3) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 31012#L1195 [2123] L1195-->L1203: Formula: (< v_~m_run_pc~0_18 4) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 31060#L1203 [2128] L1203-->L1211: Formula: (< v_~m_run_pc~0_22 5) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 31110#L1211 [2132] L1211-->L1212: Formula: (< v_~m_run_pc~0_26 6) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 31111#L1212 [2110] L1212-->L1233: Formula: (< v_~s_run_pc~0_7 2) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 31108#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 31109#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 31319#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 33520#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 33254#L1114-1 52.15/20.10 [2019-03-28 12:15:02,611 INFO L796 eck$LassoCheckResult]: Loop: 33254#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_~m_run_st~0_18 0) (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 31204#L1124 [1739] L1124-->L1120: Formula: (= v_ULTIMATE.start_eval_~tmp~0_5 0) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 31205#L1120 [1864] L1120-->L1139: Formula: (and (= v_ULTIMATE.start_eval_~tmp___0~0_4 |v_ULTIMATE.start_eval_#t~nondet2_3|) (= 0 v_~s_run_st~0_31)) InVars {~s_run_st~0=v_~s_run_st~0_31, ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_3|} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_2|, ~s_run_st~0=v_~s_run_st~0_31, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_eval_~tmp___0~0] 32746#L1139 [1627] L1139-->L1135: Formula: (= v_ULTIMATE.start_eval_~tmp___0~0_3 0) InVars {ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_3} OutVars{ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_3} AuxVars[] AssignedVars[] 33115#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 33521#L1110 [1521] L1110-->L1114-1: Formula: (= v_~m_run_st~0_16 0) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 33254#L1114-1 52.15/20.10 [2019-03-28 12:15:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1764915356, now seen corresponding path program 4 times 52.15/20.10 [2019-03-28 12:15:02,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 309852855, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:02,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 52.15/20.10 [2019-03-28 12:15:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2043489242, now seen corresponding path program 1 times 52.15/20.10 [2019-03-28 12:15:02,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 52.15/20.10 [2019-03-28 12:15:02,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 52.15/20.10 [2019-03-28 12:15:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 52.15/20.10 [2019-03-28 12:15:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 52.15/20.10 [2019-03-28 12:15:02,931 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 52.15/20.10 [2019-03-28 12:15:03,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:15:03 BasicIcfg 52.15/20.10 [2019-03-28 12:15:03,060 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 52.15/20.10 [2019-03-28 12:15:03,060 INFO L168 Benchmark]: Toolchain (without parser) took 15653.80 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 358.6 MB). Free memory was 558.2 MB in the beginning and 494.8 MB in the end (delta: 63.4 MB). Peak memory consumption was 422.0 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,061 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.06 ms. Allocated memory was 649.6 MB in the beginning and 676.3 MB in the end (delta: 26.7 MB). Free memory was 558.2 MB in the beginning and 626.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 34.5 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 676.3 MB. Free memory was 626.0 MB in the beginning and 620.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,063 INFO L168 Benchmark]: Boogie Preprocessor took 58.26 ms. Allocated memory is still 676.3 MB. Free memory was 620.6 MB in the beginning and 616.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,063 INFO L168 Benchmark]: RCFGBuilder took 981.46 ms. Allocated memory is still 676.3 MB. Free memory was 616.6 MB in the beginning and 524.5 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,064 INFO L168 Benchmark]: BlockEncodingV2 took 300.23 ms. Allocated memory is still 676.3 MB. Free memory was 524.5 MB in the beginning and 475.9 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,064 INFO L168 Benchmark]: TraceAbstraction took 319.06 ms. Allocated memory is still 676.3 MB. Free memory was 475.9 MB in the beginning and 432.7 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,065 INFO L168 Benchmark]: BuchiAutomizer took 13414.81 ms. Allocated memory was 676.3 MB in the beginning and 1.0 GB in the end (delta: 331.9 MB). Free memory was 432.7 MB in the beginning and 494.8 MB in the end (delta: -62.1 MB). Peak memory consumption was 269.8 MB. Max. memory is 50.3 GB. 52.15/20.10 [2019-03-28 12:15:03,070 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 52.15/20.10 --- Results --- 52.15/20.10 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 52.15/20.10 - StatisticsResult: Initial Icfg 52.15/20.10 265 locations, 487 edges 52.15/20.10 - StatisticsResult: Encoded RCFG 52.15/20.10 228 locations, 610 edges 52.15/20.10 * Results from de.uni_freiburg.informatik.ultimate.core: 52.15/20.10 - StatisticsResult: Toolchain Benchmarks 52.15/20.10 Benchmark results are: 52.15/20.10 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 52.15/20.10 * CACSL2BoogieTranslator took 504.06 ms. Allocated memory was 649.6 MB in the beginning and 676.3 MB in the end (delta: 26.7 MB). Free memory was 558.2 MB in the beginning and 626.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 34.5 MB. Max. memory is 50.3 GB. 52.15/20.10 * Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 676.3 MB. Free memory was 626.0 MB in the beginning and 620.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 52.15/20.10 * Boogie Preprocessor took 58.26 ms. Allocated memory is still 676.3 MB. Free memory was 620.6 MB in the beginning and 616.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 50.3 GB. 52.15/20.10 * RCFGBuilder took 981.46 ms. Allocated memory is still 676.3 MB. Free memory was 616.6 MB in the beginning and 524.5 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 50.3 GB. 52.15/20.10 * BlockEncodingV2 took 300.23 ms. Allocated memory is still 676.3 MB. Free memory was 524.5 MB in the beginning and 475.9 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 50.3 GB. 52.15/20.10 * TraceAbstraction took 319.06 ms. Allocated memory is still 676.3 MB. Free memory was 475.9 MB in the beginning and 432.7 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 50.3 GB. 52.15/20.10 * BuchiAutomizer took 13414.81 ms. Allocated memory was 676.3 MB in the beginning and 1.0 GB in the end (delta: 331.9 MB). Free memory was 432.7 MB in the beginning and 494.8 MB in the end (delta: -62.1 MB). Peak memory consumption was 269.8 MB. Max. memory is 50.3 GB. 52.15/20.10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 52.15/20.10 - AllSpecificationsHoldResult: All specifications hold 52.15/20.10 We were not able to verify any specifiation because the program does not contain any specification. 52.15/20.10 - InvariantResult [Line: 925]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 124]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 475]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 167]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 135]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1031]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 212]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 990]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 168]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 387]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 850]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 314]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 570]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1188]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 420]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1103]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 278]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 322]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 578]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 450]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1196]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 277]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 428]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 800]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 98]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1269]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 746]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 134]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 680]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1277]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 754]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 955]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 688]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 933]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 124]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1039]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 95]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1047]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 396]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 608]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1226]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 330]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 586]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1204]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 220]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 110]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 91]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 857]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 338]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1307]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 901]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1285]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 762]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 104]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 236]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1109]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 981]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 718]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 258]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 696]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 909]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 770]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 868]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 107]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 228]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1077]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 554]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1172]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1055]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 404]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1109]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 518]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 562]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1180]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 101]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 517]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 412]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 485]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 484]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 368]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1253]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 346]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 854]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 204]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 737]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 664]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1261]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 628]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 672]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 800]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 917]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 627]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 778]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 1023]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - InvariantResult [Line: 975]: Loop Invariant 52.15/20.10 Derived loop invariant: 1 52.15/20.10 - StatisticsResult: Ultimate Automizer benchmark data 52.15/20.10 CFG has 1 procedures, 228 locations, 0 error locations. SAFE Result, 0.2s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 95 PreInvPairs, 95 NumberOfFragments, 95 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 95 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 52.15/20.10 - StatisticsResult: Constructed decomposition of program 52.15/20.10 Your program was decomposed into 9 terminating modules (7 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function m_run_st and consists of 9 locations. One nondeterministic module has affine ranking function m_run_st and consists of 9 locations. 7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2662 locations. 52.15/20.10 - StatisticsResult: Timing statistics 52.15/20.10 BüchiAutomizer plugin needed 13.3s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 7.1s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 9. Automata minimization 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1350 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2805 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2829 SDtfs, 6581 SDslu, 7560 SDs, 0 SdLazy, 10700 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN1 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf91 smp100 dnf100 smp100 tf118 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s 52.15/20.10 - TerminationAnalysisResult: Nontermination possible 52.15/20.10 Buchi Automizer proved that your program is nonterminating for some inputs 52.15/20.10 - FixpointNonTerminationResult [Line: 1120]: Nontermination argument in form of an infinite program execution. 52.15/20.10 Nontermination argument in form of an infinite execution 52.15/20.10 State at position 0 is 52.15/20.10 {} 52.15/20.10 State at position 1 is 52.15/20.10 {req_tt_d=0, rsp_t_d___0=0, a_t=0, c_rsp_d=0, c_m_lock=0, \result=0, m_run_st=0, req_tt_a=0, c_write_req_ev=2, s_run_i=1, s_run_st=0, rsp_t_status=0, tmp=0, kernel_st=1, rsp_tt_status=0, c_empty_req=1, req_t_type___0=0, tmp___0=0, c_read_rsp_ev=2, m_run_i=1, rsp_t_status___0=0, c_m_ev=2, c_empty_rsp=1, req_t_d___0=0, req_t_d=0, c_req_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ae28ffb=0, c_read_req_ev=2, req_t_a=0, c_req_a=0, rsp_t_type=0, req_t_a___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4effb7d7=0, c_req_type=0, s_memory0=0, req_t_type=0, d_t=0, req_tt_type=0, rsp_t_d=0, c_write_rsp_ev=2, rsp_t_type___0=0, c_rsp_status=0, m_run_pc=0, s_run_pc=0, rsp_tt_type=0, rsp_tt_d=0, c_rsp_type=0, __retres1=0} 52.15/20.10 - StatisticsResult: NonterminationArgumentStatistics 52.15/20.10 Fixpoint 52.15/20.10 - NonterminatingLassoResult [Line: 1109]: Nonterminating execution 52.15/20.10 Found a nonterminating execution for the following lasso shaped sequence of statements. 52.15/20.10 Stem: 52.15/20.10 [L15] int m_run_st ; 52.15/20.10 [L16] int m_run_i ; 52.15/20.10 [L17] int m_run_pc ; 52.15/20.10 [L18] int s_memory0 ; 52.15/20.10 [L20] int s_run_st ; 52.15/20.10 [L21] int s_run_i ; 52.15/20.10 [L22] int s_run_pc ; 52.15/20.10 [L23] int c_m_lock ; 52.15/20.10 [L24] int c_m_ev ; 52.15/20.10 [L25] int c_req_type ; 52.15/20.10 [L26] int c_req_a ; 52.15/20.10 [L27] int c_req_d ; 52.15/20.10 [L28] int c_rsp_type ; 52.15/20.10 [L29] int c_rsp_status ; 52.15/20.10 [L30] int c_rsp_d ; 52.15/20.10 [L31] int c_empty_req ; 52.15/20.10 [L32] int c_empty_rsp ; 52.15/20.10 [L33] int c_read_req_ev ; 52.15/20.10 [L34] int c_write_req_ev ; 52.15/20.10 [L35] int c_read_rsp_ev ; 52.15/20.10 [L36] int c_write_rsp_ev ; 52.15/20.10 [L37] static int d_t ; 52.15/20.10 [L38] static int a_t ; 52.15/20.10 [L39] static int req_t_type ; 52.15/20.10 [L40] static int req_t_a ; 52.15/20.10 [L41] static int req_t_d ; 52.15/20.10 [L42] static int rsp_t_type ; 52.15/20.10 [L43] static int rsp_t_status ; 52.15/20.10 [L44] static int rsp_t_d ; 52.15/20.10 [L45] static int req_tt_type ; 52.15/20.10 [L46] static int req_tt_a ; 52.15/20.10 [L47] static int req_tt_d ; 52.15/20.10 [L48] static int rsp_tt_type ; 52.15/20.10 [L49] static int rsp_tt_status ; 52.15/20.10 [L50] static int rsp_tt_d ; 52.15/20.10 [L835] static int req_t_type___0 ; 52.15/20.10 [L836] static int req_t_a___0 ; 52.15/20.10 [L837] static int req_t_d___0 ; 52.15/20.10 [L838] static int rsp_t_type___0 ; 52.15/20.10 [L839] static int rsp_t_status___0 ; 52.15/20.10 [L840] static int rsp_t_d___0 ; 52.15/20.10 [L1342] int __retres1 ; 52.15/20.10 [L1346] c_m_lock = 0 52.15/20.10 [L1347] c_m_ev = 2 52.15/20.10 [L1349] m_run_i = 1 52.15/20.10 [L1350] m_run_pc = 0 52.15/20.10 [L1351] s_run_i = 1 52.15/20.10 [L1352] s_run_pc = 0 52.15/20.10 [L1353] c_empty_req = 1 52.15/20.10 [L1354] c_empty_rsp = 1 52.15/20.10 [L1355] c_read_req_ev = 2 52.15/20.10 [L1356] c_write_req_ev = 2 52.15/20.10 [L1357] c_read_rsp_ev = 2 52.15/20.10 [L1358] c_write_rsp_ev = 2 52.15/20.10 [L1359] c_m_lock = 0 52.15/20.10 [L1360] c_m_ev = 2 52.15/20.10 [L1158] int kernel_st ; 52.15/20.10 [L1161] kernel_st = 0 52.15/20.10 [L1162] COND TRUE (int )m_run_i == 1 52.15/20.10 [L1163] m_run_st = 0 52.15/20.10 [L1167] COND TRUE (int )s_run_i == 1 52.15/20.10 [L1168] s_run_st = 0 52.15/20.10 [L1172] COND FALSE !((int )m_run_pc == 1) 52.15/20.10 [L1180] COND FALSE !((int )m_run_pc == 2) 52.15/20.10 [L1188] COND FALSE !((int )m_run_pc == 3) 52.15/20.10 [L1196] COND FALSE !((int )m_run_pc == 4) 52.15/20.10 [L1204] COND FALSE !((int )m_run_pc == 5) 52.15/20.10 [L1212] COND FALSE !((int )m_run_pc == 6) 52.15/20.10 [L1226] COND FALSE !((int )s_run_pc == 2) 52.15/20.10 [L1234] COND FALSE !((int )s_run_pc == 1) 52.15/20.10 [L1245] COND TRUE 1 52.15/20.10 [L1248] kernel_st = 1 52.15/20.10 [L1104] int tmp ; 52.15/20.10 [L1105] int tmp___0 ; 52.15/20.10 [L1109] COND TRUE 1 52.15/20.10 [L1111] COND TRUE (int )m_run_st == 0 52.15/20.10 Loop: 52.15/20.10 [L1120] COND TRUE (int )m_run_st == 0 52.15/20.10 [L1122] tmp = __VERIFIER_nondet_int() 52.15/20.10 [L1124] COND FALSE !(\read(tmp)) 52.15/20.10 [L1135] COND TRUE (int )s_run_st == 0 52.15/20.10 [L1137] tmp___0 = __VERIFIER_nondet_int() 52.15/20.10 [L1139] COND FALSE !(\read(tmp___0)) 52.15/20.10 [L1109] COND TRUE 1 52.15/20.10 [L1111] COND TRUE (int )m_run_st == 0 52.15/20.10 End of lasso representation. 52.15/20.10 RESULT: Ultimate proved your program to be incorrect! 52.15/20.10 !SESSION 2019-03-28 12:14:44.203 ----------------------------------------------- 52.15/20.10 eclipse.buildId=unknown 52.15/20.10 java.version=1.8.0_181 52.15/20.10 java.vendor=Oracle Corporation 52.15/20.10 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 52.15/20.10 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 52.15/20.10 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 52.15/20.10 52.15/20.10 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:15:03.318 52.15/20.10 !MESSAGE The workspace will exit with unsaved changes in this session. 52.15/20.10 Received shutdown request... 52.15/20.10 Ultimate: 52.15/20.10 GTK+ Version Check 52.15/20.10 EOF