./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59598ef74ac7afb6c962e2cc2ba26af488759b7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:21:59,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:59,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:59,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:59,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:59,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:59,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:59,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:59,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:59,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:59,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:59,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:59,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:59,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:59,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:59,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:59,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:59,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:59,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:59,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:59,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:59,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:59,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:59,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:59,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:59,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:59,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:59,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:59,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:59,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:59,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:59,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:59,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:59,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:59,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:59,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:59,563 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:21:59,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:59,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:59,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:21:59,573 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:21:59,573 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:21:59,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:21:59,574 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:21:59,575 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:21:59,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:21:59,576 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:21:59,576 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:21:59,577 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:21:59,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:21:59,577 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:21:59,577 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-11-18 12:21:59,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:59,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:59,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:59,610 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:59,610 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:59,610 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:21:59,645 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/data/e46cf667b/cc61e050edfb4b1c9a5526aa04743ee3/FLAGf633abd1b [2018-11-18 12:21:59,956 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:59,956 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/sv-benchmarks/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:21:59,963 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/data/e46cf667b/cc61e050edfb4b1c9a5526aa04743ee3/FLAGf633abd1b [2018-11-18 12:21:59,973 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/data/e46cf667b/cc61e050edfb4b1c9a5526aa04743ee3 [2018-11-18 12:21:59,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:59,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:21:59,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:59,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:59,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:59,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:59" (1/1) ... [2018-11-18 12:21:59,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ae4871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:59, skipping insertion in model container [2018-11-18 12:21:59,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:59" (1/1) ... [2018-11-18 12:21:59,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:22:00,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:22:00,137 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:22:00,140 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:22:00,163 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:22:00,173 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:22:00,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00 WrapperNode [2018-11-18 12:22:00,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:22:00,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:22:00,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:22:00,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:22:00,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:22:00,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:22:00,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:22:00,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:22:00,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... [2018-11-18 12:22:00,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:22:00,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:22:00,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:22:00,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:22:00,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/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 [2018-11-18 12:22:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 12:22:00,294 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 12:22:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 12:22:00,294 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 12:22:00,295 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 12:22:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 12:22:00,296 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 12:22:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 12:22:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:22:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:22:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 12:22:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 12:22:00,297 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 12:22:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 12:22:00,653 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:22:00,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:00 BoogieIcfgContainer [2018-11-18 12:22:00,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:22:00,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:22:00,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:22:00,656 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:22:00,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:21:59" (1/3) ... [2018-11-18 12:22:00,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f14437e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:22:00, skipping insertion in model container [2018-11-18 12:22:00,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:22:00" (2/3) ... [2018-11-18 12:22:00,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f14437e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:22:00, skipping insertion in model container [2018-11-18 12:22:00,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:00" (3/3) ... [2018-11-18 12:22:00,659 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:22:00,668 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:22:00,674 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:22:00,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:22:00,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:22:00,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:22:00,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:22:00,702 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:22:00,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:22:00,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:22:00,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:22:00,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:22:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-11-18 12:22:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:00,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:00,724 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:00,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:00,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1020048504, now seen corresponding path program 1 times [2018-11-18 12:22:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:00,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:00,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:00,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:00,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:00,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:00,946 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2018-11-18 12:22:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:01,293 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2018-11-18 12:22:01,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:22:01,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:01,307 INFO L225 Difference]: With dead ends: 321 [2018-11-18 12:22:01,308 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 12:22:01,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 12:22:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-18 12:22:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 12:22:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2018-11-18 12:22:01,361 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 80 [2018-11-18 12:22:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:01,362 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2018-11-18 12:22:01,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2018-11-18 12:22:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:01,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:01,365 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:01,365 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:01,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -459348726, now seen corresponding path program 1 times [2018-11-18 12:22:01,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:01,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:01,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:01,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:01,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:01,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:01,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:01,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:01,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:01,471 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand 5 states. [2018-11-18 12:22:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:01,720 INFO L93 Difference]: Finished difference Result 300 states and 409 transitions. [2018-11-18 12:22:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:22:01,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:01,723 INFO L225 Difference]: With dead ends: 300 [2018-11-18 12:22:01,723 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 12:22:01,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 12:22:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2018-11-18 12:22:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 12:22:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2018-11-18 12:22:01,743 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 80 [2018-11-18 12:22:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:01,743 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2018-11-18 12:22:01,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2018-11-18 12:22:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:01,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:01,746 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:01,746 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:01,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -25619640, now seen corresponding path program 1 times [2018-11-18 12:22:01,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:01,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:01,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:01,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:01,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:01,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:01,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:01,802 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand 5 states. [2018-11-18 12:22:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:02,014 INFO L93 Difference]: Finished difference Result 309 states and 421 transitions. [2018-11-18 12:22:02,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:22:02,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:02,016 INFO L225 Difference]: With dead ends: 309 [2018-11-18 12:22:02,016 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 12:22:02,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 12:22:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 146. [2018-11-18 12:22:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 12:22:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-11-18 12:22:02,035 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 80 [2018-11-18 12:22:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:02,035 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-11-18 12:22:02,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-18 12:22:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:02,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:02,036 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:02,037 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:02,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 15055110, now seen corresponding path program 1 times [2018-11-18 12:22:02,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:02,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:02,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:22:02,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:22:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:22:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:02,095 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 6 states. [2018-11-18 12:22:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:02,120 INFO L93 Difference]: Finished difference Result 282 states and 380 transitions. [2018-11-18 12:22:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:22:02,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 12:22:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:02,126 INFO L225 Difference]: With dead ends: 282 [2018-11-18 12:22:02,126 INFO L226 Difference]: Without dead ends: 156 [2018-11-18 12:22:02,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:22:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-18 12:22:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2018-11-18 12:22:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-18 12:22:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2018-11-18 12:22:02,141 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 80 [2018-11-18 12:22:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:02,141 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2018-11-18 12:22:02,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:22:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2018-11-18 12:22:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:02,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:02,142 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:02,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:02,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash -882338168, now seen corresponding path program 1 times [2018-11-18 12:22:02,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:02,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:02,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:22:02,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:02,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:22:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:22:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:02,186 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 6 states. [2018-11-18 12:22:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:02,228 INFO L93 Difference]: Finished difference Result 289 states and 385 transitions. [2018-11-18 12:22:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:22:02,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 12:22:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:02,230 INFO L225 Difference]: With dead ends: 289 [2018-11-18 12:22:02,230 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 12:22:02,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:22:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 12:22:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-11-18 12:22:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-18 12:22:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2018-11-18 12:22:02,242 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 80 [2018-11-18 12:22:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:02,242 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2018-11-18 12:22:02,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:22:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2018-11-18 12:22:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:02,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:02,244 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:02,244 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:02,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:02,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1168645830, now seen corresponding path program 1 times [2018-11-18 12:22:02,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:02,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:02,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:02,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:02,306 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand 5 states. [2018-11-18 12:22:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:02,518 INFO L93 Difference]: Finished difference Result 346 states and 448 transitions. [2018-11-18 12:22:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:22:02,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:02,520 INFO L225 Difference]: With dead ends: 346 [2018-11-18 12:22:02,520 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 12:22:02,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:22:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 12:22:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 189. [2018-11-18 12:22:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 12:22:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2018-11-18 12:22:02,536 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 80 [2018-11-18 12:22:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2018-11-18 12:22:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2018-11-18 12:22:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:02,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:02,537 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:02,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:02,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1191278084, now seen corresponding path program 1 times [2018-11-18 12:22:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:02,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:02,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:02,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:02,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:02,597 INFO L87 Difference]: Start difference. First operand 189 states and 237 transitions. Second operand 5 states. [2018-11-18 12:22:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:02,837 INFO L93 Difference]: Finished difference Result 357 states and 450 transitions. [2018-11-18 12:22:02,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:22:02,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:02,839 INFO L225 Difference]: With dead ends: 357 [2018-11-18 12:22:02,839 INFO L226 Difference]: Without dead ends: 189 [2018-11-18 12:22:02,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:02,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-18 12:22:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-18 12:22:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 12:22:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 235 transitions. [2018-11-18 12:22:02,856 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 235 transitions. Word has length 80 [2018-11-18 12:22:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:02,857 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 235 transitions. [2018-11-18 12:22:02,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 235 transitions. [2018-11-18 12:22:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:02,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:02,858 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:02,858 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:02,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1717485818, now seen corresponding path program 1 times [2018-11-18 12:22:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:02,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:02,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:02,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:22:02,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:02,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:22:02,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:22:02,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:22:02,912 INFO L87 Difference]: Start difference. First operand 189 states and 235 transitions. Second operand 5 states. [2018-11-18 12:22:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:03,208 INFO L93 Difference]: Finished difference Result 421 states and 552 transitions. [2018-11-18 12:22:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:22:03,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-11-18 12:22:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:03,210 INFO L225 Difference]: With dead ends: 421 [2018-11-18 12:22:03,210 INFO L226 Difference]: Without dead ends: 252 [2018-11-18 12:22:03,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:22:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-18 12:22:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 215. [2018-11-18 12:22:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-18 12:22:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 263 transitions. [2018-11-18 12:22:03,227 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 263 transitions. Word has length 80 [2018-11-18 12:22:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:03,227 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 263 transitions. [2018-11-18 12:22:03,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:22:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 263 transitions. [2018-11-18 12:22:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 12:22:03,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:03,228 INFO L375 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, 1, 1, 1] [2018-11-18 12:22:03,228 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:03,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 205742216, now seen corresponding path program 1 times [2018-11-18 12:22:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:22:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:22:03,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:03,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:22:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:22:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:22:03,258 INFO L87 Difference]: Start difference. First operand 215 states and 263 transitions. Second operand 3 states. [2018-11-18 12:22:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:03,296 INFO L93 Difference]: Finished difference Result 574 states and 731 transitions. [2018-11-18 12:22:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:22:03,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 12:22:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:03,299 INFO L225 Difference]: With dead ends: 574 [2018-11-18 12:22:03,299 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 12:22:03,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:22:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 12:22:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378. [2018-11-18 12:22:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-18 12:22:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 468 transitions. [2018-11-18 12:22:03,328 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 468 transitions. Word has length 80 [2018-11-18 12:22:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:03,328 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 468 transitions. [2018-11-18 12:22:03,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:22:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 468 transitions. [2018-11-18 12:22:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 12:22:03,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:03,330 INFO L375 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, 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] [2018-11-18 12:22:03,330 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:03,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -4791731, now seen corresponding path program 1 times [2018-11-18 12:22:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 12:22:03,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:03,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:22:03,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:22:03,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:22:03,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:22:03,384 INFO L87 Difference]: Start difference. First operand 378 states and 468 transitions. Second operand 4 states. [2018-11-18 12:22:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:03,572 INFO L93 Difference]: Finished difference Result 1039 states and 1302 transitions. [2018-11-18 12:22:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:22:03,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-18 12:22:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:03,574 INFO L225 Difference]: With dead ends: 1039 [2018-11-18 12:22:03,574 INFO L226 Difference]: Without dead ends: 552 [2018-11-18 12:22:03,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:22:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-11-18 12:22:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 523. [2018-11-18 12:22:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-11-18 12:22:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 633 transitions. [2018-11-18 12:22:03,600 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 633 transitions. Word has length 127 [2018-11-18 12:22:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:03,600 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 633 transitions. [2018-11-18 12:22:03,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:22:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 633 transitions. [2018-11-18 12:22:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 12:22:03,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:03,603 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:22:03,603 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:03,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash 252421077, now seen corresponding path program 1 times [2018-11-18 12:22:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:03,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 12:22:03,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:22:03,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:22:03,671 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-18 12:22:03,672 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [195], [196], [208], [212], [218], [221], [224], [230], [233], [243], [246], [258], [267], [273], [275], [309], [315], [321], [327], [329], [330], [331], [334], [337], [341], [343], [345], [346], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-18 12:22:03,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:22:03,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:22:03,858 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:22:03,859 INFO L272 AbstractInterpreter]: Visited 94 different actions 116 times. Never merged. Never widened. Performed 636 root evaluator evaluations with a maximum evaluation depth of 3. Performed 636 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-18 12:22:03,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:03,885 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:22:04,043 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 77.64% of their original sizes. [2018-11-18 12:22:04,043 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:22:04,390 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-18 12:22:04,390 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:22:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:22:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-11-18 12:22:04,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:04,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 12:22:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 12:22:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 12:22:04,392 INFO L87 Difference]: Start difference. First operand 523 states and 633 transitions. Second operand 40 states. [2018-11-18 12:22:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:09,053 INFO L93 Difference]: Finished difference Result 1476 states and 1837 transitions. [2018-11-18 12:22:09,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 12:22:09,053 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 163 [2018-11-18 12:22:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:09,058 INFO L225 Difference]: With dead ends: 1476 [2018-11-18 12:22:09,058 INFO L226 Difference]: Without dead ends: 969 [2018-11-18 12:22:09,062 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 200 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=685, Invalid=5321, Unknown=0, NotChecked=0, Total=6006 [2018-11-18 12:22:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-18 12:22:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 936. [2018-11-18 12:22:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-11-18 12:22:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1106 transitions. [2018-11-18 12:22:09,123 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1106 transitions. Word has length 163 [2018-11-18 12:22:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:09,123 INFO L480 AbstractCegarLoop]: Abstraction has 936 states and 1106 transitions. [2018-11-18 12:22:09,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 12:22:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1106 transitions. [2018-11-18 12:22:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 12:22:09,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:09,127 INFO L375 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, 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] [2018-11-18 12:22:09,128 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:09,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1616870452, now seen corresponding path program 1 times [2018-11-18 12:22:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:09,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:09,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 12:22:09,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:22:09,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:22:09,204 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-18 12:22:09,204 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [55], [58], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [195], [196], [208], [212], [218], [221], [224], [230], [233], [239], [243], [246], [258], [267], [273], [275], [309], [315], [321], [327], [329], [330], [331], [334], [337], [341], [343], [345], [346], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-18 12:22:09,207 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:22:09,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:22:09,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:22:09,266 INFO L272 AbstractInterpreter]: Visited 103 different actions 134 times. Merged at 3 different actions 3 times. Never widened. Performed 751 root evaluator evaluations with a maximum evaluation depth of 3. Performed 751 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-18 12:22:09,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:09,272 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:22:09,413 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 78.36% of their original sizes. [2018-11-18 12:22:09,414 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:22:09,841 INFO L415 sIntCurrentIteration]: We unified 183 AI predicates to 183 [2018-11-18 12:22:09,841 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:22:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:22:09,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [4] total 54 [2018-11-18 12:22:09,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-18 12:22:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-18 12:22:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 12:22:09,843 INFO L87 Difference]: Start difference. First operand 936 states and 1106 transitions. Second operand 52 states. [2018-11-18 12:22:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:14,905 INFO L93 Difference]: Finished difference Result 1586 states and 1913 transitions. [2018-11-18 12:22:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-18 12:22:14,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 184 [2018-11-18 12:22:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:14,909 INFO L225 Difference]: With dead ends: 1586 [2018-11-18 12:22:14,909 INFO L226 Difference]: Without dead ends: 1084 [2018-11-18 12:22:14,911 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=972, Invalid=8534, Unknown=0, NotChecked=0, Total=9506 [2018-11-18 12:22:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2018-11-18 12:22:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1057. [2018-11-18 12:22:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-11-18 12:22:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1245 transitions. [2018-11-18 12:22:14,981 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1245 transitions. Word has length 184 [2018-11-18 12:22:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:14,982 INFO L480 AbstractCegarLoop]: Abstraction has 1057 states and 1245 transitions. [2018-11-18 12:22:14,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-18 12:22:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1245 transitions. [2018-11-18 12:22:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-18 12:22:14,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:14,984 INFO L375 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, 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] [2018-11-18 12:22:14,985 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:14,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1332164817, now seen corresponding path program 1 times [2018-11-18 12:22:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:14,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:14,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 12:22:15,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:22:15,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:22:15,028 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-18 12:22:15,028 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [126], [129], [131], [134], [140], [146], [148], [150], [154], [192], [195], [196], [208], [212], [218], [221], [224], [230], [233], [236], [243], [246], [258], [267], [273], [275], [309], [315], [321], [327], [329], [330], [331], [334], [337], [341], [343], [345], [346], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [389], [390], [391], [397], [398], [399], [400], [401], [402], [403], [404], [405], [406], [407], [408], [409], [410], [411], [412], [413], [433], [434], [435] [2018-11-18 12:22:15,030 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:22:15,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:22:15,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:22:15,107 INFO L272 AbstractInterpreter]: Visited 109 different actions 296 times. Merged at 18 different actions 29 times. Never widened. Performed 2732 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2732 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 30 variables. [2018-11-18 12:22:15,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:15,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:22:15,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:22:15,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:22:15,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:15,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:22:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:15,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:22:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 12:22:15,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:22:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 12:22:15,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:22:15,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 12:22:15,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:15,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:22:15,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:22:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:22:15,390 INFO L87 Difference]: Start difference. First operand 1057 states and 1245 transitions. Second operand 3 states. [2018-11-18 12:22:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:15,433 INFO L93 Difference]: Finished difference Result 1711 states and 2094 transitions. [2018-11-18 12:22:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:22:15,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-18 12:22:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:15,437 INFO L225 Difference]: With dead ends: 1711 [2018-11-18 12:22:15,437 INFO L226 Difference]: Without dead ends: 1063 [2018-11-18 12:22:15,439 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 362 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:22:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-11-18 12:22:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1050. [2018-11-18 12:22:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2018-11-18 12:22:15,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1219 transitions. [2018-11-18 12:22:15,478 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1219 transitions. Word has length 184 [2018-11-18 12:22:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:15,479 INFO L480 AbstractCegarLoop]: Abstraction has 1050 states and 1219 transitions. [2018-11-18 12:22:15,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:22:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1219 transitions. [2018-11-18 12:22:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 12:22:15,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:15,481 INFO L375 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, 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] [2018-11-18 12:22:15,481 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:15,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash -146028886, now seen corresponding path program 1 times [2018-11-18 12:22:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:15,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:15,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 12:22:15,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:15,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:22:15,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:15,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:22:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:22:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:22:15,589 INFO L87 Difference]: Start difference. First operand 1050 states and 1219 transitions. Second operand 6 states. [2018-11-18 12:22:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:16,211 INFO L93 Difference]: Finished difference Result 2780 states and 3325 transitions. [2018-11-18 12:22:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:22:16,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-11-18 12:22:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:16,218 INFO L225 Difference]: With dead ends: 2780 [2018-11-18 12:22:16,219 INFO L226 Difference]: Without dead ends: 1860 [2018-11-18 12:22:16,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:22:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2018-11-18 12:22:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1799. [2018-11-18 12:22:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-11-18 12:22:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2136 transitions. [2018-11-18 12:22:16,341 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2136 transitions. Word has length 185 [2018-11-18 12:22:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:16,341 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 2136 transitions. [2018-11-18 12:22:16,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:22:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2136 transitions. [2018-11-18 12:22:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-18 12:22:16,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:16,344 INFO L375 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, 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] [2018-11-18 12:22:16,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:16,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1854093778, now seen corresponding path program 1 times [2018-11-18 12:22:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:16,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:22:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-18 12:22:16,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:22:16,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:22:16,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:22:16,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:22:16,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:22:16,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:22:16,408 INFO L87 Difference]: Start difference. First operand 1799 states and 2136 transitions. Second operand 3 states. [2018-11-18 12:22:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:22:16,513 INFO L93 Difference]: Finished difference Result 3064 states and 3714 transitions. [2018-11-18 12:22:16,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:22:16,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-11-18 12:22:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:22:16,520 INFO L225 Difference]: With dead ends: 3064 [2018-11-18 12:22:16,520 INFO L226 Difference]: Without dead ends: 1807 [2018-11-18 12:22:16,524 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:22:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2018-11-18 12:22:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2018-11-18 12:22:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1807 states. [2018-11-18 12:22:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2147 transitions. [2018-11-18 12:22:16,641 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2147 transitions. Word has length 189 [2018-11-18 12:22:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:22:16,642 INFO L480 AbstractCegarLoop]: Abstraction has 1807 states and 2147 transitions. [2018-11-18 12:22:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:22:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2147 transitions. [2018-11-18 12:22:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-18 12:22:16,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:22:16,645 INFO L375 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, 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] [2018-11-18 12:22:16,645 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:22:16,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:22:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1423450299, now seen corresponding path program 1 times [2018-11-18 12:22:16,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:22:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:22:16,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:22:16,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:22:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:22:16,711 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:22:16,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:22:16 BoogieIcfgContainer [2018-11-18 12:22:16,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:22:16,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:22:16,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:22:16,791 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:22:16,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:22:00" (3/4) ... [2018-11-18 12:22:16,793 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:22:16,878 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b7677c41-b5b3-4d00-a0e5-93fbf61ca1ba/bin-2019/utaipan/witness.graphml [2018-11-18 12:22:16,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:22:16,879 INFO L168 Benchmark]: Toolchain (without parser) took 16904.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 520.6 MB). Free memory was 953.8 MB in the beginning and 1.2 GB in the end (delta: -214.6 MB). Peak memory consumption was 306.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,880 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:16,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 937.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:22:16,881 INFO L168 Benchmark]: Boogie Preprocessor took 65.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -209.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,881 INFO L168 Benchmark]: RCFGBuilder took 393.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,881 INFO L168 Benchmark]: TraceAbstraction took 16136.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,882 INFO L168 Benchmark]: Witness Printer took 87.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:22:16,883 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.24 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.0 GB. Free memory is still 937.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -209.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 393.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16136.43 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 371.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.8 MB). Peak memory consumption was 302.4 MB. Max. memory is 11.5 GB. * Witness Printer took 87.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [\old(E_1)=7, \old(E_M)=12, \old(local)=3, \old(M_E)=14, \old(m_i)=6, \old(m_pc)=11, \old(m_st)=10, \old(T1_E)=4, \old(t1_i)=13, \old(t1_pc)=8, \old(t1_st)=5, \old(token)=9, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L479] CALL init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L390] m_i = 1 [L391] RET t1_i = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L479] init_model() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L480] CALL start_simulation() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] FCALL update_channels() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] RET t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] init_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE, RET !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L426] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L426] activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE, RET !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L427] reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, kernel_st=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL eval() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L208] int tmp ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L242] transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L45] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L51] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_master_triggered()=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, is_transmit1_triggered()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] RET t1_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L51] immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] RET m_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L228] master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=0] [L242] CALL transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L343] CALL activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L314] int tmp ; [L315] int tmp___0 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_master_triggered()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, \result=0, __retres1=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, is_transmit1_triggered()=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L343] RET activate_threads() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L111] immediate_notify() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] RET t1_st = 2 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=2, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L242] transmit1() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L212] COND TRUE 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] RET return (__retres1); VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \old(token)=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L228] CALL master() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L37] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L59] COND FALSE !(token != local + 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L64] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L65] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L72] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L73] CALL error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_M)=2, \old(local)=0, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=1, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \old(token)=1, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 155 locations, 1 error locations. UNSAFE Result, 16.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3555 SDtfs, 4875 SDslu, 10336 SDs, 0 SdLazy, 5117 SolverSat, 1607 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 903 GetRequests, 658 SyntacticMatches, 24 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1807occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9842437321132965 AbsIntWeakeningRatio, 0.5304347826086957 AbsIntAvgWeakeningVarsNumRemoved, 13.602898550724637 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 320 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2126 NumberOfCodeBlocks, 2126 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2103 ConstructedInterpolants, 0 QuantifiedInterpolants, 434289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 738/783 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...