/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 12:15:04,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 12:15:04,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 12:15:04,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 12:15:04,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 12:15:04,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 12:15:04,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 12:15:04,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 12:15:04,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 12:15:04,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 12:15:04,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 12:15:04,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 12:15:04,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 12:15:04,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 12:15:04,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 12:15:04,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 12:15:04,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 12:15:04,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 12:15:04,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 12:15:04,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 12:15:04,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 12:15:04,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 12:15:04,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 12:15:04,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 12:15:04,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 12:15:04,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 12:15:04,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 12:15:04,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 12:15:04,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 12:15:04,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 12:15:04,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 12:15:04,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 12:15:04,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 12:15:04,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 12:15:04,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 12:15:04,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 12:15:04,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 12:15:04,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 12:15:04,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 12:15:04,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 12:15:04,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 12:15:04,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 12:15:04,734 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 12:15:04,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 12:15:04,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 12:15:04,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 12:15:04,738 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 12:15:04,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 12:15:04,739 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 12:15:04,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 12:15:04,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 12:15:04,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 12:15:04,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 12:15:04,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 12:15:04,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 12:15:04,740 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 12:15:04,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 12:15:04,741 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 12:15:04,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 12:15:04,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 12:15:04,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 12:15:04,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 12:15:04,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 12:15:04,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:15:04,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 12:15:04,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 12:15:04,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 12:15:04,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 12:15:04,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:04,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 12:15:04,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 12:15:04,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 12:15:05,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 12:15:05,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 12:15:05,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 12:15:05,056 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 12:15:05,056 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 12:15:05,057 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 12:15:05,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de79a7d79/264fb24837a842118c50e87a422798ee/FLAG2e77a321e [2020-07-21 12:15:05,614 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 12:15:05,614 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-07-21 12:15:05,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de79a7d79/264fb24837a842118c50e87a422798ee/FLAG2e77a321e [2020-07-21 12:15:05,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de79a7d79/264fb24837a842118c50e87a422798ee [2020-07-21 12:15:05,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 12:15:05,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 12:15:05,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 12:15:05,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 12:15:05,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 12:15:05,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:15:05" (1/1) ... [2020-07-21 12:15:05,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e21a57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:05, skipping insertion in model container [2020-07-21 12:15:05,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:15:05" (1/1) ... [2020-07-21 12:15:05,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 12:15:06,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 12:15:06,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:15:06,250 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 12:15:06,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:15:06,397 INFO L208 MainTranslator]: Completed translation [2020-07-21 12:15:06,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06 WrapperNode [2020-07-21 12:15:06,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 12:15:06,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 12:15:06,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 12:15:06,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 12:15:06,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... [2020-07-21 12:15:06,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 12:15:06,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 12:15:06,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 12:15:06,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 12:15:06,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:15:06,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-07-21 12:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 12:15:06,524 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 12:15:06,524 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 12:15:06,524 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 12:15:06,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 12:15:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 12:15:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 12:15:06,525 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-07-21 12:15:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 12:15:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 12:15:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 12:15:06,526 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 12:15:06,527 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 12:15:06,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 12:15:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 12:15:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 12:15:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-07-21 12:15:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-07-21 12:15:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-07-21 12:15:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 12:15:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 12:15:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 12:15:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 12:15:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 12:15:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 12:15:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 12:15:06,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 12:15:07,032 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 12:15:07,033 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 12:15:07,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:15:07 BoogieIcfgContainer [2020-07-21 12:15:07,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 12:15:07,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 12:15:07,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 12:15:07,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 12:15:07,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:15:05" (1/3) ... [2020-07-21 12:15:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62357b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:15:07, skipping insertion in model container [2020-07-21 12:15:07,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:15:06" (2/3) ... [2020-07-21 12:15:07,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62357b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:15:07, skipping insertion in model container [2020-07-21 12:15:07,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:15:07" (3/3) ... [2020-07-21 12:15:07,046 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-07-21 12:15:07,057 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 12:15:07,067 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 12:15:07,081 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 12:15:07,107 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 12:15:07,108 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 12:15:07,108 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 12:15:07,108 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 12:15:07,108 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 12:15:07,108 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 12:15:07,109 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 12:15:07,109 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 12:15:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-07-21 12:15:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:07,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:07,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:07,145 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-07-21 12:15:07,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:07,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [48823645] [2020-07-21 12:15:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:07,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 12:15:07,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:07,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:07,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [48823645] [2020-07-21 12:15:07,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:07,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:07,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728062805] [2020-07-21 12:15:07,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:07,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:07,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:07,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:07,465 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2020-07-21 12:15:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:07,563 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2020-07-21 12:15:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:07,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 12:15:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:07,583 INFO L225 Difference]: With dead ends: 381 [2020-07-21 12:15:07,583 INFO L226 Difference]: Without dead ends: 243 [2020-07-21 12:15:07,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-21 12:15:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2020-07-21 12:15:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-07-21 12:15:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2020-07-21 12:15:07,670 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 77 [2020-07-21 12:15:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:07,671 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2020-07-21 12:15:07,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2020-07-21 12:15:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:07,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:07,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:07,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:07,880 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1330878925, now seen corresponding path program 1 times [2020-07-21 12:15:07,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:07,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801419222] [2020-07-21 12:15:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:08,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:15:08,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:08,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:08,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801419222] [2020-07-21 12:15:08,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:08,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884443081] [2020-07-21 12:15:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:08,070 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 5 states. [2020-07-21 12:15:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:08,522 INFO L93 Difference]: Finished difference Result 565 states and 793 transitions. [2020-07-21 12:15:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:15:08,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 12:15:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:08,528 INFO L225 Difference]: With dead ends: 565 [2020-07-21 12:15:08,528 INFO L226 Difference]: Without dead ends: 346 [2020-07-21 12:15:08,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-21 12:15:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 286. [2020-07-21 12:15:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-21 12:15:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 364 transitions. [2020-07-21 12:15:08,596 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 364 transitions. Word has length 77 [2020-07-21 12:15:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:08,598 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 364 transitions. [2020-07-21 12:15:08,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 364 transitions. [2020-07-21 12:15:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:08,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:08,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:08,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:08,817 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1640766093, now seen corresponding path program 1 times [2020-07-21 12:15:08,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:08,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632876547] [2020-07-21 12:15:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:08,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:15:08,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:08,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:08,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632876547] [2020-07-21 12:15:08,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:08,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:08,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966190631] [2020-07-21 12:15:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:08,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:08,982 INFO L87 Difference]: Start difference. First operand 286 states and 364 transitions. Second operand 5 states. [2020-07-21 12:15:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:09,544 INFO L93 Difference]: Finished difference Result 850 states and 1107 transitions. [2020-07-21 12:15:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:15:09,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 12:15:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:09,549 INFO L225 Difference]: With dead ends: 850 [2020-07-21 12:15:09,549 INFO L226 Difference]: Without dead ends: 583 [2020-07-21 12:15:09,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:15:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2020-07-21 12:15:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 534. [2020-07-21 12:15:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 12:15:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 679 transitions. [2020-07-21 12:15:09,602 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 679 transitions. Word has length 77 [2020-07-21 12:15:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:09,602 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 679 transitions. [2020-07-21 12:15:09,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 679 transitions. [2020-07-21 12:15:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:09,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:09,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:09,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:09,818 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:09,819 INFO L82 PathProgramCache]: Analyzing trace with hash -690298419, now seen corresponding path program 1 times [2020-07-21 12:15:09,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:09,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335378597] [2020-07-21 12:15:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:09,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 12:15:09,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:09,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:09,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335378597] [2020-07-21 12:15:09,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:09,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:09,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455143634] [2020-07-21 12:15:09,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:09,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:09,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:09,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:09,955 INFO L87 Difference]: Start difference. First operand 534 states and 679 transitions. Second operand 5 states. [2020-07-21 12:15:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:10,293 INFO L93 Difference]: Finished difference Result 1049 states and 1351 transitions. [2020-07-21 12:15:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 12:15:10,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 12:15:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:10,298 INFO L225 Difference]: With dead ends: 1049 [2020-07-21 12:15:10,298 INFO L226 Difference]: Without dead ends: 534 [2020-07-21 12:15:10,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-07-21 12:15:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2020-07-21 12:15:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2020-07-21 12:15:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 667 transitions. [2020-07-21 12:15:10,352 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 667 transitions. Word has length 77 [2020-07-21 12:15:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:10,352 INFO L479 AbstractCegarLoop]: Abstraction has 534 states and 667 transitions. [2020-07-21 12:15:10,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 667 transitions. [2020-07-21 12:15:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:10,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:10,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:10,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:10,569 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-07-21 12:15:10,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:10,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565197237] [2020-07-21 12:15:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:10,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 12:15:10,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:10,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:10,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565197237] [2020-07-21 12:15:10,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:10,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 12:15:10,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920563743] [2020-07-21 12:15:10,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 12:15:10,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 12:15:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:15:10,696 INFO L87 Difference]: Start difference. First operand 534 states and 667 transitions. Second operand 5 states. [2020-07-21 12:15:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:11,148 INFO L93 Difference]: Finished difference Result 1198 states and 1580 transitions. [2020-07-21 12:15:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:15:11,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2020-07-21 12:15:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:11,153 INFO L225 Difference]: With dead ends: 1198 [2020-07-21 12:15:11,154 INFO L226 Difference]: Without dead ends: 683 [2020-07-21 12:15:11,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:15:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-07-21 12:15:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 588. [2020-07-21 12:15:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 12:15:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 709 transitions. [2020-07-21 12:15:11,210 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 709 transitions. Word has length 77 [2020-07-21 12:15:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:11,210 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 709 transitions. [2020-07-21 12:15:11,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 12:15:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 709 transitions. [2020-07-21 12:15:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-21 12:15:11,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:11,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:11,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:11,426 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash 899075215, now seen corresponding path program 1 times [2020-07-21 12:15:11,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:11,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184280443] [2020-07-21 12:15:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:11,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 12:15:11,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:15:11,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:11,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184280443] [2020-07-21 12:15:11,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:11,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:11,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536479708] [2020-07-21 12:15:11,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:11,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:11,523 INFO L87 Difference]: Start difference. First operand 588 states and 709 transitions. Second operand 3 states. [2020-07-21 12:15:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:11,597 INFO L93 Difference]: Finished difference Result 1698 states and 2106 transitions. [2020-07-21 12:15:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:11,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-07-21 12:15:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:11,605 INFO L225 Difference]: With dead ends: 1698 [2020-07-21 12:15:11,605 INFO L226 Difference]: Without dead ends: 1130 [2020-07-21 12:15:11,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2020-07-21 12:15:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1126. [2020-07-21 12:15:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2020-07-21 12:15:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1353 transitions. [2020-07-21 12:15:11,693 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1353 transitions. Word has length 77 [2020-07-21 12:15:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:11,694 INFO L479 AbstractCegarLoop]: Abstraction has 1126 states and 1353 transitions. [2020-07-21 12:15:11,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1353 transitions. [2020-07-21 12:15:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-21 12:15:11,697 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:11,697 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:11,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:11,912 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:11,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1699881733, now seen corresponding path program 1 times [2020-07-21 12:15:11,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:11,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [815798232] [2020-07-21 12:15:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:12,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:15:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-07-21 12:15:12,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:12,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [815798232] [2020-07-21 12:15:12,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:12,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:12,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231735043] [2020-07-21 12:15:12,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:12,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:12,061 INFO L87 Difference]: Start difference. First operand 1126 states and 1353 transitions. Second operand 3 states. [2020-07-21 12:15:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:12,173 INFO L93 Difference]: Finished difference Result 3067 states and 3792 transitions. [2020-07-21 12:15:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:12,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-07-21 12:15:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:12,186 INFO L225 Difference]: With dead ends: 3067 [2020-07-21 12:15:12,186 INFO L226 Difference]: Without dead ends: 1962 [2020-07-21 12:15:12,191 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-07-21 12:15:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-07-21 12:15:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-07-21 12:15:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2388 transitions. [2020-07-21 12:15:12,354 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2388 transitions. Word has length 121 [2020-07-21 12:15:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:12,355 INFO L479 AbstractCegarLoop]: Abstraction has 1962 states and 2388 transitions. [2020-07-21 12:15:12,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2388 transitions. [2020-07-21 12:15:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 12:15:12,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:12,363 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:12,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:12,578 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:12,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1985577124, now seen corresponding path program 1 times [2020-07-21 12:15:12,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:12,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77816385] [2020-07-21 12:15:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:12,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:12,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-21 12:15:12,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:12,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77816385] [2020-07-21 12:15:12,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:12,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:12,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256462704] [2020-07-21 12:15:12,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:12,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:12,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:12,747 INFO L87 Difference]: Start difference. First operand 1962 states and 2388 transitions. Second operand 3 states. [2020-07-21 12:15:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:12,844 INFO L93 Difference]: Finished difference Result 3486 states and 4236 transitions. [2020-07-21 12:15:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:12,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 12:15:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:12,855 INFO L225 Difference]: With dead ends: 3486 [2020-07-21 12:15:12,855 INFO L226 Difference]: Without dead ends: 1544 [2020-07-21 12:15:12,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2020-07-21 12:15:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2020-07-21 12:15:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-07-21 12:15:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1872 transitions. [2020-07-21 12:15:12,965 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1872 transitions. Word has length 174 [2020-07-21 12:15:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:12,965 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 1872 transitions. [2020-07-21 12:15:12,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1872 transitions. [2020-07-21 12:15:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-21 12:15:12,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:12,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:13,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:13,188 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash -114161306, now seen corresponding path program 1 times [2020-07-21 12:15:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:13,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692981915] [2020-07-21 12:15:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:13,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:13,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-07-21 12:15:13,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:13,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692981915] [2020-07-21 12:15:13,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:13,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:13,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708290748] [2020-07-21 12:15:13,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:13,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:13,328 INFO L87 Difference]: Start difference. First operand 1544 states and 1872 transitions. Second operand 3 states. [2020-07-21 12:15:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:13,426 INFO L93 Difference]: Finished difference Result 3171 states and 3898 transitions. [2020-07-21 12:15:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:13,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-21 12:15:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:13,437 INFO L225 Difference]: With dead ends: 3171 [2020-07-21 12:15:13,437 INFO L226 Difference]: Without dead ends: 1648 [2020-07-21 12:15:13,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2020-07-21 12:15:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1536. [2020-07-21 12:15:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2020-07-21 12:15:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1840 transitions. [2020-07-21 12:15:13,559 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1840 transitions. Word has length 174 [2020-07-21 12:15:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:13,559 INFO L479 AbstractCegarLoop]: Abstraction has 1536 states and 1840 transitions. [2020-07-21 12:15:13,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1840 transitions. [2020-07-21 12:15:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 12:15:13,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:13,564 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:13,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:13,777 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1512674178, now seen corresponding path program 1 times [2020-07-21 12:15:13,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:13,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [413736391] [2020-07-21 12:15:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:13,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:15:13,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-21 12:15:13,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:13,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [413736391] [2020-07-21 12:15:13,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:13,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:13,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763401260] [2020-07-21 12:15:13,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:13,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:13,979 INFO L87 Difference]: Start difference. First operand 1536 states and 1840 transitions. Second operand 3 states. [2020-07-21 12:15:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:14,158 INFO L93 Difference]: Finished difference Result 4303 states and 5279 transitions. [2020-07-21 12:15:14,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:14,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 12:15:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:14,182 INFO L225 Difference]: With dead ends: 4303 [2020-07-21 12:15:14,182 INFO L226 Difference]: Without dead ends: 2788 [2020-07-21 12:15:14,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2020-07-21 12:15:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2785. [2020-07-21 12:15:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-21 12:15:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3365 transitions. [2020-07-21 12:15:14,383 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3365 transitions. Word has length 175 [2020-07-21 12:15:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:14,383 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3365 transitions. [2020-07-21 12:15:14,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:14,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3365 transitions. [2020-07-21 12:15:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 12:15:14,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:14,389 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:14,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:14,603 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1582450014, now seen corresponding path program 1 times [2020-07-21 12:15:14,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:14,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [596430897] [2020-07-21 12:15:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:14,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:14,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 12:15:14,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:14,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [596430897] [2020-07-21 12:15:14,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:14,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:14,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174789156] [2020-07-21 12:15:14,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:14,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:14,773 INFO L87 Difference]: Start difference. First operand 2785 states and 3365 transitions. Second operand 3 states. [2020-07-21 12:15:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:14,904 INFO L93 Difference]: Finished difference Result 4792 states and 5963 transitions. [2020-07-21 12:15:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 12:15:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:14,922 INFO L225 Difference]: With dead ends: 4792 [2020-07-21 12:15:14,923 INFO L226 Difference]: Without dead ends: 2793 [2020-07-21 12:15:14,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2020-07-21 12:15:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2785. [2020-07-21 12:15:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-21 12:15:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3321 transitions. [2020-07-21 12:15:15,146 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3321 transitions. Word has length 175 [2020-07-21 12:15:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:15,146 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3321 transitions. [2020-07-21 12:15:15,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3321 transitions. [2020-07-21 12:15:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-21 12:15:15,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:15,151 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:15,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:15,364 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash -557002881, now seen corresponding path program 1 times [2020-07-21 12:15:15,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:15,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943588210] [2020-07-21 12:15:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:15,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:15,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-21 12:15:15,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:15,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943588210] [2020-07-21 12:15:15,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:15,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:15,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418229913] [2020-07-21 12:15:15,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:15,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:15,522 INFO L87 Difference]: Start difference. First operand 2785 states and 3321 transitions. Second operand 3 states. [2020-07-21 12:15:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:15,644 INFO L93 Difference]: Finished difference Result 4289 states and 5279 transitions. [2020-07-21 12:15:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:15,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-07-21 12:15:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:15,661 INFO L225 Difference]: With dead ends: 4289 [2020-07-21 12:15:15,661 INFO L226 Difference]: Without dead ends: 2788 [2020-07-21 12:15:15,667 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2020-07-21 12:15:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2785. [2020-07-21 12:15:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2020-07-21 12:15:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3277 transitions. [2020-07-21 12:15:15,836 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3277 transitions. Word has length 175 [2020-07-21 12:15:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:15,839 INFO L479 AbstractCegarLoop]: Abstraction has 2785 states and 3277 transitions. [2020-07-21 12:15:15,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3277 transitions. [2020-07-21 12:15:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-21 12:15:15,846 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:15,847 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:16,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:16,060 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -264682041, now seen corresponding path program 1 times [2020-07-21 12:15:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:16,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19171944] [2020-07-21 12:15:16,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:16,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-21 12:15:16,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-21 12:15:16,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:15:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-21 12:15:16,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19171944] [2020-07-21 12:15:16,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 12:15:16,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2020-07-21 12:15:16,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304057030] [2020-07-21 12:15:16,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:15:16,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:16,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:15:16,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 12:15:16,546 INFO L87 Difference]: Start difference. First operand 2785 states and 3277 transitions. Second operand 6 states. [2020-07-21 12:15:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:17,382 INFO L93 Difference]: Finished difference Result 6953 states and 8283 transitions. [2020-07-21 12:15:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 12:15:17,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2020-07-21 12:15:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:17,410 INFO L225 Difference]: With dead ends: 6953 [2020-07-21 12:15:17,410 INFO L226 Difference]: Without dead ends: 5174 [2020-07-21 12:15:17,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-21 12:15:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2020-07-21 12:15:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 5091. [2020-07-21 12:15:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2020-07-21 12:15:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 6027 transitions. [2020-07-21 12:15:17,746 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 6027 transitions. Word has length 176 [2020-07-21 12:15:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:17,746 INFO L479 AbstractCegarLoop]: Abstraction has 5091 states and 6027 transitions. [2020-07-21 12:15:17,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:15:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 6027 transitions. [2020-07-21 12:15:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-07-21 12:15:17,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:17,754 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:17,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:17,970 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash -125310296, now seen corresponding path program 1 times [2020-07-21 12:15:17,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:17,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988994880] [2020-07-21 12:15:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:18,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:18,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-07-21 12:15:18,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:18,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988994880] [2020-07-21 12:15:18,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:18,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:18,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010508624] [2020-07-21 12:15:18,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:18,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:18,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:18,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:18,116 INFO L87 Difference]: Start difference. First operand 5091 states and 6027 transitions. Second operand 3 states. [2020-07-21 12:15:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:18,381 INFO L93 Difference]: Finished difference Result 9712 states and 11700 transitions. [2020-07-21 12:15:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:18,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2020-07-21 12:15:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:18,412 INFO L225 Difference]: With dead ends: 9712 [2020-07-21 12:15:18,413 INFO L226 Difference]: Without dead ends: 5200 [2020-07-21 12:15:18,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-07-21 12:15:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5091. [2020-07-21 12:15:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5091 states. [2020-07-21 12:15:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 5995 transitions. [2020-07-21 12:15:18,697 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 5995 transitions. Word has length 202 [2020-07-21 12:15:18,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:18,698 INFO L479 AbstractCegarLoop]: Abstraction has 5091 states and 5995 transitions. [2020-07-21 12:15:18,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 5995 transitions. [2020-07-21 12:15:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-07-21 12:15:18,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:18,707 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:18,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:18,921 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1381777448, now seen corresponding path program 1 times [2020-07-21 12:15:18,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:18,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [233154287] [2020-07-21 12:15:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:19,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:15:19,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2020-07-21 12:15:19,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:19,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [233154287] [2020-07-21 12:15:19,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:19,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:15:19,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313565401] [2020-07-21 12:15:19,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:15:19,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:15:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:19,086 INFO L87 Difference]: Start difference. First operand 5091 states and 5995 transitions. Second operand 3 states. [2020-07-21 12:15:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:19,326 INFO L93 Difference]: Finished difference Result 9604 states and 11310 transitions. [2020-07-21 12:15:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:15:19,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2020-07-21 12:15:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:19,350 INFO L225 Difference]: With dead ends: 9604 [2020-07-21 12:15:19,350 INFO L226 Difference]: Without dead ends: 4533 [2020-07-21 12:15:19,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:15:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2020-07-21 12:15:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4533. [2020-07-21 12:15:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4533 states. [2020-07-21 12:15:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 5338 transitions. [2020-07-21 12:15:19,615 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 5338 transitions. Word has length 202 [2020-07-21 12:15:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:19,615 INFO L479 AbstractCegarLoop]: Abstraction has 4533 states and 5338 transitions. [2020-07-21 12:15:19,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:15:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 5338 transitions. [2020-07-21 12:15:19,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2020-07-21 12:15:19,622 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:19,622 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:19,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:19,837 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash 662284003, now seen corresponding path program 1 times [2020-07-21 12:15:19,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:19,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042228040] [2020-07-21 12:15:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:19,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 12:15:19,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-21 12:15:19,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:19,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042228040] [2020-07-21 12:15:19,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:19,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:15:19,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217767949] [2020-07-21 12:15:19,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:15:19,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:19,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:15:19,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:19,992 INFO L87 Difference]: Start difference. First operand 4533 states and 5338 transitions. Second operand 6 states. [2020-07-21 12:15:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:20,350 INFO L93 Difference]: Finished difference Result 6923 states and 8208 transitions. [2020-07-21 12:15:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 12:15:20,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2020-07-21 12:15:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:20,366 INFO L225 Difference]: With dead ends: 6923 [2020-07-21 12:15:20,367 INFO L226 Difference]: Without dead ends: 2411 [2020-07-21 12:15:20,383 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 12:15:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2020-07-21 12:15:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2252. [2020-07-21 12:15:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2020-07-21 12:15:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 2604 transitions. [2020-07-21 12:15:20,588 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 2604 transitions. Word has length 203 [2020-07-21 12:15:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:20,589 INFO L479 AbstractCegarLoop]: Abstraction has 2252 states and 2604 transitions. [2020-07-21 12:15:20,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:15:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2604 transitions. [2020-07-21 12:15:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-07-21 12:15:20,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:20,596 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:20,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:20,812 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash 803385659, now seen corresponding path program 1 times [2020-07-21 12:15:20,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:20,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271545030] [2020-07-21 12:15:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:20,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 12:15:20,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-21 12:15:20,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:20,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271545030] [2020-07-21 12:15:20,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:20,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:15:20,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477936224] [2020-07-21 12:15:20,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:15:20,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:15:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:20,986 INFO L87 Difference]: Start difference. First operand 2252 states and 2604 transitions. Second operand 6 states. [2020-07-21 12:15:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:21,066 INFO L93 Difference]: Finished difference Result 3189 states and 3695 transitions. [2020-07-21 12:15:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:15:21,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2020-07-21 12:15:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:21,070 INFO L225 Difference]: With dead ends: 3189 [2020-07-21 12:15:21,071 INFO L226 Difference]: Without dead ends: 984 [2020-07-21 12:15:21,076 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:15:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2020-07-21 12:15:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2020-07-21 12:15:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-07-21 12:15:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1079 transitions. [2020-07-21 12:15:21,124 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1079 transitions. Word has length 210 [2020-07-21 12:15:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:21,124 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 1079 transitions. [2020-07-21 12:15:21,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:15:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1079 transitions. [2020-07-21 12:15:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-07-21 12:15:21,128 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:15:21,128 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:15:21,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:21,343 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:15:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:15:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1883728569, now seen corresponding path program 1 times [2020-07-21 12:15:21,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:15:21,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462335626] [2020-07-21 12:15:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:15:21,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 12:15:21,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:15:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-21 12:15:21,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:15:21,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462335626] [2020-07-21 12:15:21,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:15:21,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:15:21,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926540547] [2020-07-21 12:15:21,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:15:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:15:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:15:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:15:21,509 INFO L87 Difference]: Start difference. First operand 984 states and 1079 transitions. Second operand 6 states. [2020-07-21 12:15:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:15:21,558 INFO L93 Difference]: Finished difference Result 1602 states and 1782 transitions. [2020-07-21 12:15:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 12:15:21,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2020-07-21 12:15:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:15:21,560 INFO L225 Difference]: With dead ends: 1602 [2020-07-21 12:15:21,560 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 12:15:21,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 12:15:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 12:15:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 12:15:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 12:15:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 12:15:21,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2020-07-21 12:15:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:15:21,565 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 12:15:21,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:15:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 12:15:21,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 12:15:21,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:15:21,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 12:15:25,760 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-07-21 12:15:25,900 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:26,038 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:26,204 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:26,344 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2020-07-21 12:15:26,484 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:26,630 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:26,928 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-07-21 12:15:27,366 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-07-21 12:15:27,605 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:28,149 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2020-07-21 12:15:28,289 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:28,734 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-07-21 12:15:29,126 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-07-21 12:15:29,382 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 12:15:29,572 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2020-07-21 12:15:30,454 WARN L193 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-07-21 12:15:30,630 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2020-07-21 12:15:30,950 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-07-21 12:15:31,871 WARN L193 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-07-21 12:15:32,179 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2020-07-21 12:15:32,321 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:32,781 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2020-07-21 12:15:33,102 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2020-07-21 12:15:33,355 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 12:15:33,622 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-21 12:15:33,897 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-21 12:15:34,302 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-07-21 12:15:34,724 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2020-07-21 12:15:34,964 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-07-21 12:15:35,134 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-07-21 12:15:35,388 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-21 12:15:35,531 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-07-21 12:15:36,062 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-07-21 12:15:36,213 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-07-21 12:15:36,519 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-07-21 12:15:36,743 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-21 12:15:36,984 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2020-07-21 12:15:37,294 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-07-21 12:15:37,322 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-07-21 12:15:37,323 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (<= 2 ~t1_st~0)) (.cse10 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 2 ~M_E~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (not (<= ~m_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (<= 2 ~E_1~0)) (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse10 .cse1 .cse4 .cse5 (not (<= 2 |old(~m_st~0)|)) .cse8 (<= 2 ~m_st~0)) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8 .cse9))) [2020-07-21 12:15:37,323 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-07-21 12:15:37,324 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse6 (not (= 1 ~m_pc~0))) (.cse4 (<= 2 ~m_st~0)) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse5 (not (<= 2 |old(~E_M~0)|))) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (not (<= 2 ~M_E~0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse13 (= 0 ~m_st~0)) (.cse2 (= ~token~0 ~local~0)) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse10 (not (= |old(~token~0)| ~local~0))) (.cse12 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (= 1 ~t1_pc~0)) (.cse15 (<= 2 ~E_M~0)) (.cse16 (= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse5 .cse6 (and .cse13 .cse14 .cse15 .cse16) .cse8 .cse9 (and .cse14 .cse15 .cse16 .cse4) .cse10 .cse11 (not (= 1 |old(~t1_pc~0)|)) .cse12)) (or .cse0 .cse1 .cse5 .cse7 (not (= 0 |old(~m_st~0)|)) .cse8 .cse9 (and .cse13 .cse2 .cse3) .cse10 .cse12 (not (<= ~m_pc~0 0))))) [2020-07-21 12:15:37,324 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-07-21 12:15:37,325 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse7 (not (= 1 ~m_pc~0))) (.cse5 (<= 2 ~m_st~0)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse2 (= ~token~0 ~local~0)) (.cse3 (<= |old(~E_M~0)| ~E_M~0)) (.cse4 (<= ~t1_pc~0 0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse6 (not (<= 2 |old(~E_M~0)|))) (.cse8 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (not (<= 2 ~M_E~0))) (.cse10 (not (<= 2 ~T1_E~0))) (.cse11 (not (= |old(~token~0)| ~local~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse6 .cse7 (and (= 1 ~t1_pc~0) .cse2 .cse3 .cse5) .cse9 .cse10 .cse11 .cse12 (not (= 1 |old(~t1_pc~0)|)) .cse13) (or (and (= 0 ~m_st~0) .cse2 .cse3 .cse4) .cse0 .cse1 .cse6 .cse8 (not (= 0 |old(~m_st~0)|)) .cse9 .cse10 .cse11 .cse13 (not (<= ~m_pc~0 0))))) [2020-07-21 12:15:37,325 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-07-21 12:15:37,325 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse7 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= 1 ~t1_pc~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= 2 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9))) [2020-07-21 12:15:37,325 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-07-21 12:15:37,325 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse9 (= ~token~0 ~local~0)) (.cse10 (<= |old(~E_M~0)| ~E_M~0)) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse15 (= 0 ~m_st~0)) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse12 (not (= |old(~token~0)| ~local~0))) (.cse7 (= 1 ~t1_pc~0)) (.cse8 (<= 2 ~t1_st~0)) (.cse11 (<= 2 ~m_st~0)) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse14 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse12 .cse14 (and .cse15 .cse7 .cse8 .cse9 .cse10) (not (<= ~m_pc~0 0))) (let ((.cse16 (<= 2 ~E_M~0)) (.cse17 (= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse7 .cse8 .cse16 .cse17) .cse5 .cse6 .cse12 (and .cse7 .cse8 .cse16 .cse17 .cse11) .cse13 (not (= 1 |old(~t1_pc~0)|)) .cse14)))) [2020-07-21 12:15:37,326 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (not (= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~M_E~0))) (.cse6 (not (<= 2 ~T1_E~0))) (.cse7 (not (= |old(~token~0)| ~local~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse4 (not (= 0 |old(~m_st~0)|)) .cse5 .cse6 .cse7 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse1 .cse2 .cse3 (and (= 1 ~t1_pc~0) (= ~token~0 (+ ~local~0 1)) (<= 2 ~m_st~0)) .cse5 .cse6 .cse7 .cse8 (not (= 1 |old(~t1_pc~0)|)) .cse9))) [2020-07-21 12:15:37,326 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-07-21 12:15:37,326 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-07-21 12:15:37,326 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-07-21 12:15:37,326 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-07-21 12:15:37,326 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-07-21 12:15:37,327 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse4 (not (<= 2 ~M_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse7 .cse15)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse4 .cse5 .cse12 .cse8 .cse15) (or .cse10 (= 0 ~m_st~0) .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse13 .cse8)))) [2020-07-21 12:15:37,327 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse7 (<= 2 ~m_st~0)) (.cse6 (= 0 activate_threads_~tmp~1)) (.cse20 (<= 2 ~t1_st~0))) (let ((.cse1 (= 0 ~m_st~0)) (.cse14 (not (= 0 |old(~t1_st~0)|))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse16 (not (<= ~m_pc~0 0))) (.cse18 (and .cse6 .cse20)) (.cse8 (not (<= 2 ~M_E~0))) (.cse13 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse2 (not (= ~token~0 (+ ~local~0 1)))) (.cse3 (not (= 1 ~t1_i~0))) (.cse19 (and .cse6 .cse20 .cse7)) (.cse4 (not (= 1 ~m_pc~0))) (.cse5 (not (= 1 ~t1_pc~0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse17 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (not (= 0 |old(~m_st~0)|)) .cse12 .cse8 .cse9 .cse13 .cse14 .cse15 .cse11 .cse16) (or .cse3 .cse5 .cse12 .cse17 .cse18 .cse8 .cse9 .cse13 .cse11 .cse16) (or .cse0 .cse3 .cse4 .cse19 .cse5 .cse12 .cse17 .cse9 .cse13 .cse10 .cse11) (or (and .cse6 (= 0 ~t1_st~0)) .cse3 .cse12 .cse8 .cse9 .cse13 .cse14 .cse15 .cse11 .cse16) (or .cse3 .cse4 .cse5 .cse12 .cse17 .cse18 .cse8 .cse9 .cse13 .cse11) (or .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse12 .cse17 .cse9 .cse10 .cse11)))) [2020-07-21 12:15:37,327 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-07-21 12:15:37,327 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse7 (<= 2 ~t1_st~0)) (.cse15 (<= 2 ~m_st~0))) (let ((.cse4 (not (<= 2 ~M_E~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse16 (not (= 0 |old(~t1_st~0)|))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse9 (not (<= ~m_pc~0 0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= 1 ~t1_i~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse13 (and .cse7 .cse15)) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse4 .cse5 .cse12 .cse8 .cse15) (or .cse10 (= 0 ~m_st~0) .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse0 .cse2 (= 0 ~t1_st~0) .cse4 .cse5 .cse6 .cse16 .cse17 .cse8 .cse9) (or .cse10 .cse14 .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse12 .cse13 .cse8)))) [2020-07-21 12:15:37,328 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-07-21 12:15:37,328 INFO L264 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse11 (not (<= 2 ~m_st~0))) (.cse14 (not (<= ~t1_pc~0 0))) (.cse13 (not (= 0 ~t1_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (= 0 ~m_st~0))) (.cse5 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 ~t1_st~0))) (.cse7 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not (<= 2 ~M_E~0))) (.cse9 (not (<= 2 ~T1_E~0))) (.cse12 (not (= ~token~0 ~local~0))) (.cse10 (not (= 1 ~m_i~0))) (.cse15 (not (<= ~m_pc~0 0)))) (and (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse11 .cse8 .cse9 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse2 .cse5 .cse7 .cse11 .cse8 .cse9 .cse12 .cse14 .cse13 .cse10) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse13 .cse10 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse15))) [2020-07-21 12:15:37,328 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-07-21 12:15:37,328 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-07-21 12:15:37,328 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-07-21 12:15:37,328 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-07-21 12:15:37,328 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-07-21 12:15:37,329 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-07-21 12:15:37,329 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-07-21 12:15:37,329 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-07-21 12:15:37,329 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse11 (not (= ~token~0 ~local~0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse12 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 ~m_st~0))) (.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~token~0 (+ ~local~0 1)))) (.cse2 (not (= 1 ~t1_i~0))) (.cse3 (not (= 1 ~m_pc~0))) (.cse4 (not (= 1 ~t1_pc~0))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse9 (not (= 1 ~m_i~0))) (.cse8 (= 0 is_transmit1_triggered_~__retres1~1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse6 .cse7 .cse11 (not (<= ~t1_pc~0 0)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse5 .cse7 .cse11 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse5 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~m_st~0)) .cse6 .cse7 .cse9 .cse8))) [2020-07-21 12:15:37,329 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-07-21 12:15:37,329 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-07-21 12:15:37,329 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-07-21 12:15:37,330 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 12:15:37,330 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 12:15:37,330 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-07-21 12:15:37,330 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~token~0 ~local~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse5 .cse10 .cse7 (not (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))))) [2020-07-21 12:15:37,330 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-07-21 12:15:37,330 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-07-21 12:15:37,331 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-07-21 12:15:37,331 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-07-21 12:15:37,331 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 ~E_M~0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0)) (not (<= 2 ~M_E~0)) (not (<= 2 ~T1_E~0)) (not (= ~token~0 ~local~0)) (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (not (= 1 ~m_i~0)) (not (<= ~m_pc~0 0))) [2020-07-21 12:15:37,331 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-07-21 12:15:37,331 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 12:15:37,331 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-07-21 12:15:37,331 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-07-21 12:15:37,332 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-07-21 12:15:37,332 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 12:15:37,332 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 1 ~t1_i~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_i~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-07-21 12:15:37,332 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-07-21 12:15:37,332 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-07-21 12:15:37,332 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-07-21 12:15:37,333 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-07-21 12:15:37,333 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-07-21 12:15:37,333 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-21 12:15:37,333 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8) (or .cse0 .cse1 (and (<= 2 ~t1_st~0) (not (= |old(~token~0)| ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse3 .cse4 .cse6 .cse7 .cse8))) [2020-07-21 12:15:37,333 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse12 (= 0 ~t1_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse20 (= 1 ~t1_i~0)) (.cse17 (<= 2 ~T1_E~0)) (.cse19 (<= 2 ~E_M~0)) (.cse13 (= 1 ~m_pc~0)) (.cse16 (= 1 ~m_i~0)) (.cse14 (= ~token~0 ~local~0)) (.cse18 (<= 2 ~M_E~0)) (.cse15 (<= 2 ~m_st~0)) (.cse21 (= 1 ~t1_pc~0))) (let ((.cse1 (not .cse21)) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (and .cse11 .cse20 .cse17 .cse21 (<= 2 ~t1_st~0) .cse19 .cse13 .cse16 .cse14 .cse18 .cse15)) (.cse9 (and .cse11 .cse17 .cse12 .cse21 .cse19 .cse13 .cse16 .cse14 .cse18 .cse15)) (.cse0 (not .cse20)) (.cse2 (not .cse19)) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= |old(~m_pc~0)| 0))) (.cse7 (not .cse18)) (.cse8 (not .cse17)) (.cse10 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (or (and .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse10)))) [2020-07-21 12:15:37,334 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse5 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~M_E~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) .cse8) (or .cse0 .cse1 .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse3 .cse4 .cse6 .cse7 .cse8))) [2020-07-21 12:15:37,334 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse4 (<= ~m_pc~0 0)) (.cse1 (= ~token~0 ~local~0)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~t1_st~0)) (.cse0 (not (= |old(~token~0)| ~local~0))) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~M_E~0))) (.cse12 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse3 .cse4 .cse1) .cse13) (or .cse5 .cse6 (and .cse2 .cse0 .cse3 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse8 .cse9 .cse11 .cse12 .cse13))) [2020-07-21 12:15:37,334 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse6 (<= ~m_pc~0 0)) (.cse3 (not (<= |old(~m_pc~0)| 0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse9 (not (= 1 ~t1_pc~0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~M_E~0))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse11 (<= 2 ~t1_st~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (not (= 1 ~m_i~0)))) (and (or (not (= |old(~token~0)| |old(~local~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse6 .cse7) .cse8) (or .cse0 .cse9 .cse1 .cse10 (and .cse11 .cse6 .cse7) .cse2 .cse3 .cse4 .cse5 .cse8) (or .cse0 .cse9 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse10 .cse2 .cse4 .cse5 (and .cse11 (= 1 ~m_pc~0) .cse7) .cse8))) [2020-07-21 12:15:37,334 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-07-21 12:15:37,335 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse10 (not (<= |old(~m_pc~0)| 0))) (.cse4 (<= ~m_pc~0 0)) (.cse1 (= ~token~0 ~local~0)) (.cse5 (not (= 1 ~t1_i~0))) (.cse6 (not (= 1 ~t1_pc~0))) (.cse2 (<= 2 ~t1_st~0)) (.cse0 (not (= |old(~token~0)| ~local~0))) (.cse3 (<= |old(~E_1~0)| ~E_1~0)) (.cse7 (not (<= 2 ~E_M~0))) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse11 (not (<= 2 ~M_E~0))) (.cse12 (not (<= 2 ~T1_E~0))) (.cse13 (not (= 1 ~m_i~0)))) (and (or (and (or .cse0 .cse1) .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~token~0)| |old(~local~0)|)) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 (not (= 0 |old(~t1_st~0)|)) (not (<= ~t1_pc~0 0)) (and (= 0 ~t1_st~0) .cse3 .cse4 .cse1) .cse13) (or .cse5 .cse6 (and .cse2 .cse0 .cse3 (= 1 ~m_pc~0) (= ~token~0 (+ ~local~0 1))) .cse7 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) (not (= 1 |old(~m_pc~0)|)) .cse8 .cse9 .cse11 .cse12 .cse13))) [2020-07-21 12:15:37,335 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-07-21 12:15:37,335 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-07-21 12:15:37,335 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_1~0))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (<= |old(~M_E~0)| ~M_E~0)) (.cse9 (not (= 1 ~m_i~0)))) (and (or .cse0 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~token~0 ~local~0)) .cse8 .cse9))) [2020-07-21 12:15:37,335 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-07-21 12:15:37,335 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 12:15:37,335 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (not (= |old(~token~0)| ~local~0)) (= ~token~0 ~local~0)) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0)) [2020-07-21 12:15:37,336 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 12:15:37,336 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse1 (not (= 1 ~t1_i~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= 1 |old(~m_pc~0)|))) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0))) (.cse9 (= 1 ~t1_pc~0)) (.cse10 (<= 2 ~t1_st~0)) (.cse5 (<= |old(~E_1~0)| ~E_1~0)) (.cse11 (= 1 ~m_pc~0)) (.cse6 (= ~token~0 ~local~0)) (.cse7 (<= |old(~E_M~0)| ~E_M~0)) (.cse12 (<= 2 ~m_st~0))) (and (or .cse0 .cse1 .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse4 (and (= 0 ~m_st~0) (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) .cse6 .cse7 (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) .cse8) (or .cse1 .cse2 (and .cse9 .cse10 (not (= |old(~token~0)| ~local~0)) .cse5 .cse11 (= ~token~0 (+ ~local~0 1)) .cse7 .cse12) (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse8) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse3 .cse4 .cse15 .cse16 .cse8 (and .cse9 .cse10 .cse5 .cse11 .cse6 .cse7 .cse12)))) [2020-07-21 12:15:37,336 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-07-21 12:15:37,336 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-21 12:15:37,336 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-07-21 12:15:37,336 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-07-21 12:15:37,337 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse3 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= 1 ~t1_i~0))) (.cse25 (not (= |old(~token~0)| ~local~0))) (.cse24 (= ~token~0 (+ ~local~0 1))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (= 0 ~t1_st~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (<= 1 eval_~tmp~0)) (.cse18 (= 0 ~m_st~0))) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) (and .cse18 .cse11 .cse12 .cse19 .cse16 .cse20 .cse21) .cse10 .cse0 (and .cse11 .cse12 .cse15 .cse22 .cse16 .cse20 .cse21 .cse17) .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse17) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse22 .cse19 .cse16) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse22) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24))) (or .cse1 (and .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2020-07-21 12:15:37,337 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse16 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse10 (= 1 ~m_pc~0)) (.cse15 (<= 2 ~m_st~0)) (.cse9 (<= 2 ~E_1~0)) (.cse11 (<= 1 eval_~tmp~0)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (<= |old(~E_M~0)| ~E_M~0)) (.cse14 (<= ~t1_pc~0 0))) (or .cse0 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse1 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse4 (and .cse9 (= 1 ~t1_pc~0) (<= 2 ~E_M~0) .cse10 .cse11 .cse12 .cse15) (and (= 0 ~m_st~0) .cse9 .cse11 (<= ~m_pc~0 0) .cse12 .cse13 .cse14))) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-07-21 12:15:37,337 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse23 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse3 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= 1 ~t1_i~0))) (.cse25 (not (= |old(~token~0)| ~local~0))) (.cse24 (= ~token~0 (+ ~local~0 1))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse10 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (= 0 ~t1_st~0)) (.cse20 (<= |old(~E_M~0)| ~E_M~0)) (.cse21 (<= ~t1_pc~0 0)) (.cse19 (<= ~m_pc~0 0)) (.cse22 (<= 1 eval_~tmp~0)) (.cse18 (= 0 ~m_st~0))) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) (and .cse18 .cse11 .cse12 .cse19 .cse16 .cse20 .cse21) .cse10 .cse0 (and .cse11 .cse12 .cse15 .cse22 .cse16 .cse20 .cse21 .cse17) .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse17) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse22 .cse19 .cse16) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse15 .cse24 .cse22) (and .cse18 .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24))) (or .cse1 (and .cse11 .cse13 .cse23 .cse14 .cse25 .cse15 .cse24 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2020-07-21 12:15:37,338 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-07-21 12:15:37,338 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse17 (not (= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 |old(~m_pc~0)|))) (.cse3 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (= 1 |old(~t1_pc~0)|))) (.cse8 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse11 (= 1 ~t1_pc~0)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (<= 2 ~E_M~0)) (.cse10 (= ~token~0 (+ ~local~0 1))) (.cse9 (<= 2 ~E_1~0)) (.cse16 (<= 1 eval_~tmp~0)) (.cse14 (<= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0))) (or .cse0 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse5 (not (= 0 |old(~t1_st~0)|)) .cse8 (and (or (and .cse9 (or (not (= |old(~token~0)| ~local~0)) .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse9 .cse11 .cse12 .cse13 .cse14 .cse15)) .cse16) .cse17 .cse1 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and .cse9 .cse11 .cse12 .cse13 (= 1 ~m_pc~0) .cse10 .cse16) (and .cse9 (= 0 ~t1_st~0) .cse16 .cse14 .cse15 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) .cse4)) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2020-07-21 12:15:37,338 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-07-21 12:15:37,338 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse11 (<= 2 ~E_1~0)) (.cse12 (= 1 ~t1_pc~0)) (.cse13 (<= 2 ~t1_st~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= 1 ~m_pc~0)) (.cse17 (<= 2 ~m_st~0))) (let ((.cse4 (not (= 1 |old(~m_pc~0)|))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (= 1 |old(~t1_pc~0)|))) (.cse1 (not (= 1 ~t1_i~0))) (.cse7 (not (<= 2 ~T1_E~0))) (.cse10 (not (= 1 ~m_i~0))) (.cse0 (not (= |old(~token~0)| |old(~local~0)|))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse3 (and .cse11 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) .cse17)) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse16 (= ~token~0 (+ ~local~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 (and .cse11 .cse12 .cse13 .cse14 (not (= |old(~token~0)| ~local~0)) .cse15 .cse16 .cse17) .cse2 (not (= |old(~token~0)| (+ |old(~local~0)| 1))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 (not (<= |old(~m_pc~0)| 0)) (not (<= 2 ~M_E~0)) .cse7 (not (= 0 |old(~t1_st~0)|)) .cse10 .cse0 .cse2 (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2020-07-21 12:15:37,338 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-07-21 12:15:37,339 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-07-21 12:15:37,339 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-07-21 12:15:37,339 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-07-21 12:15:37,339 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-07-21 12:15:37,340 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse6 (not (<= 2 ~m_st~0))) (.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~token~0 ~local~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse9) (or .cse0 .cse1 (not (= 0 ~m_st~0)) .cse5 .cse10 .cse7 (not (<= ~t1_pc~0 0)) (not (<= 2 |old(~M_E~0)|)) (not (= 0 ~t1_st~0)) .cse8 .cse9 (not (<= ~m_pc~0 0))))) [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-07-21 12:15:37,340 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-07-21 12:15:37,341 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,341 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,341 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-07-21 12:15:37,341 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,342 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= 1 ~m_pc~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 (+ ~local~0 1)) .cse6) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-07-21 12:15:37,342 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,342 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,342 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,342 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,343 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,343 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-07-21 12:15:37,343 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse6 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) .cse0 (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) (<= 2 ~M_E~0) .cse6 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse7))) [2020-07-21 12:15:37,343 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-07-21 12:15:37,343 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse6 (= ~token~0 ~local~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse7 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= 0 ~m_st~0) .cse0 (= 0 ~t1_st~0) .cse5 (<= ~m_pc~0 0) (<= 2 ~M_E~0) .cse6 (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse7))) [2020-07-21 12:15:37,344 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,344 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,344 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (or (not (= |old(~token~0)| |old(~local~0)|)) (not (= 1 ~t1_i~0)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= |old(~m_pc~0)| 0)) (and (= 0 ~m_st~0) (= 0 ~t1_st~0) (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= ~m_pc~0 0) (<= |old(~M_E~0)| ~M_E~0) (= ~token~0 ~local~0) (<= |old(~E_M~0)| ~E_M~0) (<= ~t1_pc~0 0)) (not (= 0 |old(~t1_st~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= 1 ~m_i~0))) [2020-07-21 12:15:37,344 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,344 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-07-21 12:15:37,345 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,345 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-07-21 12:15:37,345 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~t1_st~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~T1_E~0)| ~T1_E~0)) (.cse6 (<= 2 ~m_st~0))) (or (not (= 1 ~t1_i~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~token~0 ~local~0) .cse6) (not (<= |old(~m_pc~0)| 0)) (not (= 0 |old(~t1_st~0)|)) (not (= 1 ~m_i~0)) (not (= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~token~0 (+ ~local~0 1)) .cse5 .cse6))) [2020-07-21 12:15:37,345 INFO L271 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: true [2020-07-21 12:15:37,345 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-07-21 12:15:37,345 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse7 (not (<= ~m_pc~0 0))) (.cse8 (not (<= 2 ~E_1~0))) (.cse12 (not (<= 2 ~m_st~0))) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (not (= 1 ~t1_i~0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse10 (not (= 1 ~t1_pc~0))) (.cse2 (not (<= 2 ~E_M~0))) (.cse11 (not (<= 2 ~t1_st~0))) (.cse3 (not (<= 2 ~M_E~0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse6 (not (= 1 ~m_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~t1_pc~0 0)) (not (= 0 ~t1_st~0)) .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse10 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 (not (= ~token~0 (+ ~local~0 1))) .cse1 .cse9 .cse10 .cse2 .cse11 .cse12 .cse4 .cse6) (or .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6))) [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-07-21 12:15:37,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 12:15:37,346 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_1~0) (= 0 ~m_st~0) (<= 2 ~T1_E~0) (= 0 ~t1_st~0) (<= 2 ~E_M~0) (<= ~m_pc~0 0) (= ~token~0 ~local~0) (<= 2 ~M_E~0) (<= ~t1_pc~0 0)) [2020-07-21 12:15:37,347 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 12:15:37,347 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse0 (not (= 1 ~t1_i~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse2 (not (= 1 ~m_pc~0))) (.cse3 (not (= 1 ~t1_pc~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (<= 2 ~m_st~0))) (.cse7 (and (<= |old(~T1_E~0)| ~T1_E~0) (<= |old(~E_1~0)| ~E_1~0) (<= |old(~M_E~0)| ~M_E~0) (<= |old(~E_M~0)| ~E_M~0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= 1 ~m_i~0)))) (and (or (not (= ~token~0 (+ ~local~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~token~0 ~local~0)) .cse7 .cse8 .cse9))) [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 12:15:37,347 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-07-21 12:15:37,348 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-07-21 12:15:37,348 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-07-21 12:15:37,348 INFO L271 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2020-07-21 12:15:37,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:15:37 BoogieIcfgContainer [2020-07-21 12:15:37,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 12:15:37,407 INFO L168 Benchmark]: Toolchain (without parser) took 31429.62 ms. Allocated memory was 137.9 MB in the beginning and 816.3 MB in the end (delta: 678.4 MB). Free memory was 101.2 MB in the beginning and 110.0 MB in the end (delta: -8.8 MB). Peak memory consumption was 713.3 MB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,407 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.47 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 180.6 MB in the end (delta: -79.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,408 INFO L168 Benchmark]: Boogie Preprocessor took 52.12 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,409 INFO L168 Benchmark]: RCFGBuilder took 587.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 146.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,412 INFO L168 Benchmark]: TraceAbstraction took 30363.22 ms. Allocated memory was 201.9 MB in the beginning and 816.3 MB in the end (delta: 614.5 MB). Free memory was 146.2 MB in the beginning and 110.0 MB in the end (delta: 36.2 MB). Peak memory consumption was 694.3 MB. Max. memory is 7.1 GB. [2020-07-21 12:15:37,415 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 419.47 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 180.6 MB in the end (delta: -79.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.12 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 587.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.1 MB in the beginning and 146.9 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30363.22 ms. Allocated memory was 201.9 MB in the beginning and 816.3 MB in the end (delta: 614.5 MB). Free memory was 146.2 MB in the beginning and 110.0 MB in the end (delta: 36.2 MB). Peak memory consumption was 694.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(0 == t1_st)) || !(1 == m_i))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(0 == m_st)) || !(2 <= E_M)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i)) || !(m_pc <= 0))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= E_M)) || !(2 <= t1_st)) || 1 <= __retres1) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) || !(m_pc <= 0)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= \old(E_M))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) && ((((((((((((((((((!(1 == t1_i) || ((((((2 <= E_1 && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || ((((((0 == m_st && 2 <= E_1) && 0 == t1_st) && m_pc <= 0) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0)) || !(1 == m_i)) || !(\old(token) == \old(local))) || (((((((2 <= E_1 && 0 == t1_st) && 1 == m_pc) && 1 <= tmp) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 <= tmp) && m_pc <= 0) && token == local)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 1 <= tmp)) || (((((((0 == m_st && 2 <= E_1) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1))) && ((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((0 == __retres1 || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || !(1 == m_i)) || !(m_pc <= 0)) && ((((((((((0 == __retres1 || !(2 <= E_1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i))) && (((((((((0 == __retres1 || !(1 == t1_i)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((0 == __retres1 || !(2 <= E_1)) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(1 == m_i))) && (((((((((0 == __retres1 || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(1 == m_i)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((((((((((2 <= E_1 && 1 == t1_i) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || (((((((((2 <= E_1 && 2 <= T1_E) && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(1 == m_i)) && (((((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || ((((((((((2 <= E_1 && 1 == t1_i) && 2 <= T1_E) && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || (((((((((2 <= E_1 && 2 <= T1_E) && 0 == t1_st) && 1 == t1_pc) && 2 <= E_M) && 1 == m_pc) && 1 == m_i) && token == local) && 2 <= M_E) && 2 <= m_st)) || !(1 == m_i))) && ((((((((((((((2 <= E_1 && 0 == t1_st) && 1 == m_pc) && token == local) && 2 <= m_st) || !(\old(token) == \old(local))) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || ((token == local && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || (((0 == m_st && 1 == t1_pc) && 2 <= E_M) && token == local + 1)) || !(2 <= M_E)) || !(2 <= T1_E)) || (((1 == t1_pc && 2 <= E_M) && token == local + 1) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || ((0 == m_st && token == local) && \old(E_M) <= E_M)) || !(\old(token) == local)) || !(1 == m_i)) || !(m_pc <= 0)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= \old(E_M))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) && ((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && !(\old(token) == local)) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(E_M))) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i))) && ((((((((((((!(1 == t1_i) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local) && 2 <= m_st)) || !(2 <= \old(E_1))) || ((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && 2 <= m_st)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || ((((1 == t1_pc && 2 <= t1_st) && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && token == local) && \old(E_M) <= E_M)) || !(m_pc <= 0))) && (((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || ((((0 == m_st && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && token == local + 1)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || ((((1 == t1_pc && 2 <= t1_st) && 2 <= E_M) && token == local + 1) && 2 <= m_st)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || !(\old(t1_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == m_i)) && (((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(2 <= \old(E_M))) || !(1 == m_pc)) || (((1 == t1_pc && token == local) && \old(E_M) <= E_M) && 2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(\old(token) == local)) || !(2 <= \old(m_st))) || !(1 == \old(t1_pc))) || !(1 == m_i)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == t1_i) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && \old(T1_E) <= T1_E) && token == local) && 2 <= m_st)) || !(\old(m_pc) <= 0)) || !(0 == \old(t1_st))) || !(1 == m_i)) || !(\old(token) == \old(local))) || !(2 <= \old(E_M))) || !(\old(t1_pc) <= 0)) || !(0 == \old(m_st))) || ((((((((0 == m_st && 2 <= E_1) && 0 == t1_st) && \old(T1_E) <= T1_E) && m_pc <= 0) && 2 <= M_E) && token == local) && \old(E_M) <= E_M) && t1_pc <= 0)) || !(2 <= \old(E_1))) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E))) || (((((((2 <= E_1 && 1 == t1_pc) && 2 <= t1_st) && 2 <= E_M) && 1 == m_pc) && token == local + 1) && \old(T1_E) <= T1_E) && 2 <= m_st) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(1 == t1_i) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && (((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || ((((2 <= t1_st && !(\old(token) == local)) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || 0 == __retres1) || !(1 == m_i)) && (((((((((!(1 == t1_i) || !(2 <= E_M)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(token == local)) || !(t1_pc <= 0)) || !(0 == t1_st)) || 0 == __retres1) || !(1 == m_i)) || !(m_pc <= 0))) && ((((((((((!(2 <= E_1) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || !(token == local)) || 0 == __retres1) || !(1 == m_i))) && ((((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= t1_st)) || !(2 <= m_st)) || !(2 <= T1_E)) || 0 == __retres1) || !(1 == m_i))) && (((((((((!(2 <= E_1) || !(token == local + 1)) || !(1 == t1_i)) || !(1 == m_pc)) || !(1 == t1_pc)) || !(0 == m_st)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) || 0 == __retres1) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(token) == local) || token == local) && 2 <= t1_st) && \old(E_1) <= E_1) && m_pc <= 0) || !(1 == t1_i)) || !(1 == t1_pc)) || !(2 <= E_M)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) && ((((((((((!(\old(token) == \old(local)) || !(1 == t1_i)) || !(2 <= E_M)) || !(2 <= \old(E_1))) || !(\old(m_pc) <= 0)) || !(2 <= M_E)) || !(2 <= T1_E)) || !(0 == \old(t1_st))) || !(t1_pc <= 0)) || (((0 == t1_st && \old(E_1) <= E_1) && m_pc <= 0) && token == local)) || !(1 == m_i))) && ((((((((((!(1 == t1_i) || !(1 == t1_pc)) || ((((2 <= t1_st && !(\old(token) == local)) && \old(E_1) <= E_1) && 1 == m_pc) && token == local + 1)) || !(2 <= E_M)) || !(\old(token) == \old(local) + 1)) || !(1 == \old(m_pc))) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= M_E)) || !(2 <= T1_E)) || !(1 == m_i)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.6s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3691 SDtfs, 3057 SDslu, 3552 SDs, 0 SdLazy, 1432 SolverSat, 651 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2831 GetRequests, 2776 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5091occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 690 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 11190 PreInvPairs, 11344 NumberOfFragments, 7627 HoareAnnotationTreeSize, 11190 FomulaSimplifications, 6172 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 62 FomulaSimplificationsInter, 12289 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2659 NumberOfCodeBlocks, 2659 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2816 ConstructedInterpolants, 0 QuantifiedInterpolants, 588797 SizeOfPredicates, 21 NumberOfNonLiveVariables, 11146 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 1487/1510 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...