./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/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 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-09 16:06:50,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:06:50,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:06:50,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:06:50,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:06:50,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:06:50,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:06:50,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:06:50,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:06:50,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:06:50,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:06:50,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:06:50,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:06:50,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:06:50,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:06:50,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:06:50,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:06:50,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:06:50,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:06:50,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:06:50,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:06:50,774 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:06:50,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:06:50,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:06:50,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:06:50,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:06:50,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:06:50,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:06:50,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:06:50,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:06:50,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:06:50,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:06:50,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:06:50,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:06:50,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:06:50,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:06:50,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 16:06:50,791 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:06:50,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:06:50,792 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:06:50,792 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:06:50,792 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:06:50,793 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:06:50,793 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:06:50,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:06:50,794 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 16:06:50,795 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:06:50,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:06:50,795 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:06:50,796 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 16:06:50,796 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_697c1c96-e892-4626-acc9-71517a2ad33f/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 -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2018-12-09 16:06:50,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:06:50,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:06:50,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:06:50,826 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:06:50,826 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:06:50,827 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c [2018-12-09 16:06:50,861 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/data/6efa5e421/d331731d550b4347bc37cb437cc5b599/FLAG386950a20 [2018-12-09 16:06:51,266 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:06:51,267 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/sv-benchmarks/c/systemc/token_ring.02_false-unreach-call_false-termination.cil.c [2018-12-09 16:06:51,272 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/data/6efa5e421/d331731d550b4347bc37cb437cc5b599/FLAG386950a20 [2018-12-09 16:06:51,280 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/data/6efa5e421/d331731d550b4347bc37cb437cc5b599 [2018-12-09 16:06:51,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:06:51,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:06:51,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:06:51,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:06:51,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:06:51,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97cb65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51, skipping insertion in model container [2018-12-09 16:06:51,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:06:51,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:06:51,417 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:06:51,420 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:06:51,443 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:06:51,453 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:06:51,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51 WrapperNode [2018-12-09 16:06:51,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:06:51,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:06:51,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:06:51,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:06:51,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:06:51,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:06:51,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:06:51,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:06:51,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... [2018-12-09 16:06:51,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:06:51,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:06:51,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:06:51,520 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:06:51,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/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-12-09 16:06:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-09 16:06:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-09 16:06:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-09 16:06:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-09 16:06:51,551 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-09 16:06:51,551 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-09 16:06:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-09 16:06:51,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:06:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-09 16:06:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-09 16:06:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-09 16:06:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:06:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-09 16:06:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-09 16:06:51,829 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:06:51,829 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 16:06:51,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:51 BoogieIcfgContainer [2018-12-09 16:06:51,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:06:51,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:06:51,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:06:51,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:06:51,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:06:51" (1/3) ... [2018-12-09 16:06:51,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9707ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:06:51, skipping insertion in model container [2018-12-09 16:06:51,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:06:51" (2/3) ... [2018-12-09 16:06:51,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9707ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:06:51, skipping insertion in model container [2018-12-09 16:06:51,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:51" (3/3) ... [2018-12-09 16:06:51,834 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_false-unreach-call_false-termination.cil.c [2018-12-09 16:06:51,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:06:51,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 16:06:51,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 16:06:51,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:06:51,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 16:06:51,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:06:51,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:06:51,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:06:51,873 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:06:51,873 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:06:51,873 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:06:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2018-12-09 16:06:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:51,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:51,891 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:51,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1757159407, now seen corresponding path program 1 times [2018-12-09 16:06:51,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:51,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:52,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:52,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:52,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:52,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:52,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:52,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:52,073 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 5 states. [2018-12-09 16:06:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:52,359 INFO L93 Difference]: Finished difference Result 375 states and 553 transitions. [2018-12-09 16:06:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:52,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:52,369 INFO L225 Difference]: With dead ends: 375 [2018-12-09 16:06:52,369 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 16:06:52,372 INFO L631 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-12-09 16:06:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 16:06:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2018-12-09 16:06:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 234 transitions. [2018-12-09 16:06:52,419 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 234 transitions. Word has length 92 [2018-12-09 16:06:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:52,419 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 234 transitions. [2018-12-09 16:06:52,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 234 transitions. [2018-12-09 16:06:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:52,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:52,422 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:52,422 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:52,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -629350099, now seen corresponding path program 1 times [2018-12-09 16:06:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:52,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:52,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:52,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:52,494 INFO L87 Difference]: Start difference. First operand 172 states and 234 transitions. Second operand 5 states. [2018-12-09 16:06:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:52,740 INFO L93 Difference]: Finished difference Result 354 states and 498 transitions. [2018-12-09 16:06:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:52,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:52,742 INFO L225 Difference]: With dead ends: 354 [2018-12-09 16:06:52,742 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 16:06:52,743 INFO L631 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-12-09 16:06:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 16:06:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2018-12-09 16:06:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 233 transitions. [2018-12-09 16:06:52,756 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 233 transitions. Word has length 92 [2018-12-09 16:06:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:52,756 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 233 transitions. [2018-12-09 16:06:52,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 233 transitions. [2018-12-09 16:06:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:52,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:52,758 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:52,758 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:52,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1121976273, now seen corresponding path program 1 times [2018-12-09 16:06:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:52,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:52,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:52,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:52,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:52,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:52,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:52,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:52,809 INFO L87 Difference]: Start difference. First operand 172 states and 233 transitions. Second operand 5 states. [2018-12-09 16:06:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:53,009 INFO L93 Difference]: Finished difference Result 352 states and 492 transitions. [2018-12-09 16:06:53,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:53,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:53,011 INFO L225 Difference]: With dead ends: 352 [2018-12-09 16:06:53,011 INFO L226 Difference]: Without dead ends: 200 [2018-12-09 16:06:53,012 INFO L631 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-12-09 16:06:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-09 16:06:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 172. [2018-12-09 16:06:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2018-12-09 16:06:53,029 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 92 [2018-12-09 16:06:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:53,030 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2018-12-09 16:06:53,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2018-12-09 16:06:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:53,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:53,031 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:53,032 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash -168036115, now seen corresponding path program 1 times [2018-12-09 16:06:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:53,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:53,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:53,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:53,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:53,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:53,097 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand 5 states. [2018-12-09 16:06:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:53,292 INFO L93 Difference]: Finished difference Result 369 states and 518 transitions. [2018-12-09 16:06:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:53,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:53,294 INFO L225 Difference]: With dead ends: 369 [2018-12-09 16:06:53,294 INFO L226 Difference]: Without dead ends: 217 [2018-12-09 16:06:53,294 INFO L631 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-12-09 16:06:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-09 16:06:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2018-12-09 16:06:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2018-12-09 16:06:53,305 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 92 [2018-12-09 16:06:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:53,305 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2018-12-09 16:06:53,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2018-12-09 16:06:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:53,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:53,306 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:53,306 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:53,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1384189841, now seen corresponding path program 1 times [2018-12-09 16:06:53,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:53,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:53,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:53,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:53,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:53,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:53,346 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand 5 states. [2018-12-09 16:06:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:53,550 INFO L93 Difference]: Finished difference Result 363 states and 507 transitions. [2018-12-09 16:06:53,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:53,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:53,552 INFO L225 Difference]: With dead ends: 363 [2018-12-09 16:06:53,552 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 16:06:53,552 INFO L631 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-12-09 16:06:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 16:06:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2018-12-09 16:06:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2018-12-09 16:06:53,571 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 92 [2018-12-09 16:06:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:53,571 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2018-12-09 16:06:53,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2018-12-09 16:06:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:53,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:53,573 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:53,573 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:53,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2116157267, now seen corresponding path program 1 times [2018-12-09 16:06:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:53,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:53,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:53,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:53,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:53,626 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand 5 states. [2018-12-09 16:06:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:53,833 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2018-12-09 16:06:53,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:53,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:53,835 INFO L225 Difference]: With dead ends: 365 [2018-12-09 16:06:53,835 INFO L226 Difference]: Without dead ends: 213 [2018-12-09 16:06:53,835 INFO L631 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-12-09 16:06:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-09 16:06:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 172. [2018-12-09 16:06:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 16:06:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2018-12-09 16:06:53,846 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 92 [2018-12-09 16:06:53,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:53,846 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2018-12-09 16:06:53,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2018-12-09 16:06:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:53,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:53,847 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:53,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:53,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash 492630191, now seen corresponding path program 1 times [2018-12-09 16:06:53,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:53,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:53,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:53,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:53,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:06:53,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:53,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:06:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:06:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:06:53,881 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand 6 states. [2018-12-09 16:06:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:53,908 INFO L93 Difference]: Finished difference Result 336 states and 463 transitions. [2018-12-09 16:06:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:53,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 16:06:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:53,910 INFO L225 Difference]: With dead ends: 336 [2018-12-09 16:06:53,910 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 16:06:53,910 INFO L631 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-12-09 16:06:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 16:06:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2018-12-09 16:06:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-09 16:06:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 234 transitions. [2018-12-09 16:06:53,922 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 234 transitions. Word has length 92 [2018-12-09 16:06:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:53,922 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 234 transitions. [2018-12-09 16:06:53,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:06:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 234 transitions. [2018-12-09 16:06:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:53,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:53,923 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:53,923 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2030970221, now seen corresponding path program 1 times [2018-12-09 16:06:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:53,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:53,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:06:53,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:53,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:06:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:06:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:06:53,978 INFO L87 Difference]: Start difference. First operand 177 states and 234 transitions. Second operand 4 states. [2018-12-09 16:06:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:54,097 INFO L93 Difference]: Finished difference Result 482 states and 662 transitions. [2018-12-09 16:06:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:06:54,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 16:06:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:54,100 INFO L225 Difference]: With dead ends: 482 [2018-12-09 16:06:54,100 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 16:06:54,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:06:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 16:06:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 320. [2018-12-09 16:06:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-09 16:06:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 423 transitions. [2018-12-09 16:06:54,127 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 423 transitions. Word has length 92 [2018-12-09 16:06:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:54,127 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 423 transitions. [2018-12-09 16:06:54,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:06:54,127 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2018-12-09 16:06:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:54,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:54,128 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:54,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:54,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -795793746, now seen corresponding path program 1 times [2018-12-09 16:06:54,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:54,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:54,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:06:54,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:54,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:06:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:06:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:06:54,164 INFO L87 Difference]: Start difference. First operand 320 states and 423 transitions. Second operand 6 states. [2018-12-09 16:06:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:54,200 INFO L93 Difference]: Finished difference Result 629 states and 854 transitions. [2018-12-09 16:06:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:54,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 16:06:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:54,201 INFO L225 Difference]: With dead ends: 629 [2018-12-09 16:06:54,201 INFO L226 Difference]: Without dead ends: 330 [2018-12-09 16:06:54,202 INFO L631 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-12-09 16:06:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-09 16:06:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2018-12-09 16:06:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-09 16:06:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 427 transitions. [2018-12-09 16:06:54,218 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 427 transitions. Word has length 92 [2018-12-09 16:06:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:54,218 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 427 transitions. [2018-12-09 16:06:54,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:06:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2018-12-09 16:06:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:54,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:54,219 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:54,219 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:54,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:54,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1693187024, now seen corresponding path program 1 times [2018-12-09 16:06:54,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:54,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:54,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:54,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:06:54,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:54,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:06:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:06:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:06:54,257 INFO L87 Difference]: Start difference. First operand 325 states and 427 transitions. Second operand 6 states. [2018-12-09 16:06:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:54,289 INFO L93 Difference]: Finished difference Result 643 states and 868 transitions. [2018-12-09 16:06:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:54,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 16:06:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:54,290 INFO L225 Difference]: With dead ends: 643 [2018-12-09 16:06:54,290 INFO L226 Difference]: Without dead ends: 339 [2018-12-09 16:06:54,291 INFO L631 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-12-09 16:06:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-09 16:06:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-12-09 16:06:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-09 16:06:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 437 transitions. [2018-12-09 16:06:54,311 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 437 transitions. Word has length 92 [2018-12-09 16:06:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:54,312 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 437 transitions. [2018-12-09 16:06:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:06:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 437 transitions. [2018-12-09 16:06:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:54,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:54,313 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:54,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:54,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 357796974, now seen corresponding path program 1 times [2018-12-09 16:06:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:54,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:54,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:54,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:54,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:54,365 INFO L87 Difference]: Start difference. First operand 335 states and 437 transitions. Second operand 5 states. [2018-12-09 16:06:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:54,619 INFO L93 Difference]: Finished difference Result 784 states and 1027 transitions. [2018-12-09 16:06:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:54,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:54,621 INFO L225 Difference]: With dead ends: 784 [2018-12-09 16:06:54,621 INFO L226 Difference]: Without dead ends: 471 [2018-12-09 16:06:54,622 INFO L631 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-12-09 16:06:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-09 16:06:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 425. [2018-12-09 16:06:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-09 16:06:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 537 transitions. [2018-12-09 16:06:54,642 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 537 transitions. Word has length 92 [2018-12-09 16:06:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:54,643 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 537 transitions. [2018-12-09 16:06:54,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 537 transitions. [2018-12-09 16:06:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:54,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:54,644 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:54,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:54,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash 380429228, now seen corresponding path program 1 times [2018-12-09 16:06:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:54,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:54,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:54,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:54,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:54,687 INFO L87 Difference]: Start difference. First operand 425 states and 537 transitions. Second operand 5 states. [2018-12-09 16:06:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:54,908 INFO L93 Difference]: Finished difference Result 828 states and 1050 transitions. [2018-12-09 16:06:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:54,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:54,909 INFO L225 Difference]: With dead ends: 828 [2018-12-09 16:06:54,909 INFO L226 Difference]: Without dead ends: 425 [2018-12-09 16:06:54,910 INFO L631 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-12-09 16:06:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-09 16:06:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-12-09 16:06:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-09 16:06:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 533 transitions. [2018-12-09 16:06:54,933 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 533 transitions. Word has length 92 [2018-12-09 16:06:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:54,933 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 533 transitions. [2018-12-09 16:06:54,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 533 transitions. [2018-12-09 16:06:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:54,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:54,934 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:54,935 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:54,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1766632622, now seen corresponding path program 1 times [2018-12-09 16:06:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:54,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:54,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:54,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:54,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:54,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:54,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:54,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:54,986 INFO L87 Difference]: Start difference. First operand 425 states and 533 transitions. Second operand 5 states. [2018-12-09 16:06:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:55,189 INFO L93 Difference]: Finished difference Result 828 states and 1042 transitions. [2018-12-09 16:06:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:06:55,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:55,190 INFO L225 Difference]: With dead ends: 828 [2018-12-09 16:06:55,190 INFO L226 Difference]: Without dead ends: 425 [2018-12-09 16:06:55,191 INFO L631 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-12-09 16:06:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-09 16:06:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-12-09 16:06:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-09 16:06:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 529 transitions. [2018-12-09 16:06:55,220 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 529 transitions. Word has length 92 [2018-12-09 16:06:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:55,220 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 529 transitions. [2018-12-09 16:06:55,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 529 transitions. [2018-12-09 16:06:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:55,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:55,221 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:55,221 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:55,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1257159532, now seen corresponding path program 1 times [2018-12-09 16:06:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:55,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:55,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:55,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:55,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:55,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:55,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:55,271 INFO L87 Difference]: Start difference. First operand 425 states and 529 transitions. Second operand 5 states. [2018-12-09 16:06:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:55,561 INFO L93 Difference]: Finished difference Result 1043 states and 1357 transitions. [2018-12-09 16:06:55,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:55,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:55,564 INFO L225 Difference]: With dead ends: 1043 [2018-12-09 16:06:55,564 INFO L226 Difference]: Without dead ends: 639 [2018-12-09 16:06:55,565 INFO L631 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-12-09 16:06:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-09 16:06:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 501. [2018-12-09 16:06:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-12-09 16:06:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 611 transitions. [2018-12-09 16:06:55,588 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 611 transitions. Word has length 92 [2018-12-09 16:06:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:55,588 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 611 transitions. [2018-12-09 16:06:55,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 611 transitions. [2018-12-09 16:06:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:55,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:55,589 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:55,589 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:55,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1114579730, now seen corresponding path program 1 times [2018-12-09 16:06:55,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:55,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:55,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:55,643 INFO L87 Difference]: Start difference. First operand 501 states and 611 transitions. Second operand 5 states. [2018-12-09 16:06:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:55,901 INFO L93 Difference]: Finished difference Result 1111 states and 1410 transitions. [2018-12-09 16:06:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:55,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:55,904 INFO L225 Difference]: With dead ends: 1111 [2018-12-09 16:06:55,904 INFO L226 Difference]: Without dead ends: 632 [2018-12-09 16:06:55,905 INFO L631 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-12-09 16:06:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-12-09 16:06:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 563. [2018-12-09 16:06:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-12-09 16:06:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 673 transitions. [2018-12-09 16:06:55,949 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 673 transitions. Word has length 92 [2018-12-09 16:06:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:55,949 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 673 transitions. [2018-12-09 16:06:55,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 673 transitions. [2018-12-09 16:06:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:55,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:55,951 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:55,951 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1052540116, now seen corresponding path program 1 times [2018-12-09 16:06:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:55,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:56,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:56,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:06:56,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:56,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:06:56,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:06:56,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:06:56,002 INFO L87 Difference]: Start difference. First operand 563 states and 673 transitions. Second operand 5 states. [2018-12-09 16:06:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:56,298 INFO L93 Difference]: Finished difference Result 1147 states and 1426 transitions. [2018-12-09 16:06:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:06:56,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 16:06:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:56,300 INFO L225 Difference]: With dead ends: 1147 [2018-12-09 16:06:56,300 INFO L226 Difference]: Without dead ends: 605 [2018-12-09 16:06:56,302 INFO L631 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-12-09 16:06:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-12-09 16:06:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 567. [2018-12-09 16:06:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-09 16:06:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 661 transitions. [2018-12-09 16:06:56,344 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 661 transitions. Word has length 92 [2018-12-09 16:06:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:56,345 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 661 transitions. [2018-12-09 16:06:56,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:06:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 661 transitions. [2018-12-09 16:06:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 16:06:56,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:56,346 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:56,346 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:56,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -911991506, now seen corresponding path program 1 times [2018-12-09 16:06:56,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:06:56,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:56,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:06:56,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:56,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:06:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:06:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:06:56,374 INFO L87 Difference]: Start difference. First operand 567 states and 661 transitions. Second operand 3 states. [2018-12-09 16:06:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:56,432 INFO L93 Difference]: Finished difference Result 1607 states and 1940 transitions. [2018-12-09 16:06:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:06:56,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-09 16:06:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:56,435 INFO L225 Difference]: With dead ends: 1607 [2018-12-09 16:06:56,435 INFO L226 Difference]: Without dead ends: 1061 [2018-12-09 16:06:56,436 INFO L631 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-12-09 16:06:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-12-09 16:06:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1059. [2018-12-09 16:06:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-12-09 16:06:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1247 transitions. [2018-12-09 16:06:56,484 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1247 transitions. Word has length 92 [2018-12-09 16:06:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:56,484 INFO L480 AbstractCegarLoop]: Abstraction has 1059 states and 1247 transitions. [2018-12-09 16:06:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:06:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1247 transitions. [2018-12-09 16:06:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 16:06:56,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:56,486 INFO L402 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, 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] [2018-12-09 16:06:56,486 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:56,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1433851939, now seen corresponding path program 1 times [2018-12-09 16:06:56,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-09 16:06:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:06:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:06:56,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:56,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:06:56,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:06:56,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:06:56,520 INFO L87 Difference]: Start difference. First operand 1059 states and 1247 transitions. Second operand 4 states. [2018-12-09 16:06:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:06:56,743 INFO L93 Difference]: Finished difference Result 2980 states and 3553 transitions. [2018-12-09 16:06:56,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:06:56,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-09 16:06:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:06:56,747 INFO L225 Difference]: With dead ends: 2980 [2018-12-09 16:06:56,747 INFO L226 Difference]: Without dead ends: 1516 [2018-12-09 16:06:56,750 INFO L631 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-12-09 16:06:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2018-12-09 16:06:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1486. [2018-12-09 16:06:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-12-09 16:06:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1716 transitions. [2018-12-09 16:06:56,847 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1716 transitions. Word has length 147 [2018-12-09 16:06:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:06:56,848 INFO L480 AbstractCegarLoop]: Abstraction has 1486 states and 1716 transitions. [2018-12-09 16:06:56,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:06:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1716 transitions. [2018-12-09 16:06:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 16:06:56,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:06:56,849 INFO L402 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:06:56,849 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:06:56,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1993378184, now seen corresponding path program 1 times [2018-12-09 16:06:56,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:06:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:06:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:06:56,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:06:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:06:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 16:06:56,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:06:56,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:06:56,903 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 192 with the following transitions: [2018-12-09 16:06:56,904 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [309], [313], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:06:56,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:06:56,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:06:57,078 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:06:57,079 INFO L272 AbstractInterpreter]: Visited 102 different actions 133 times. Never merged. Never widened. Performed 900 root evaluator evaluations with a maximum evaluation depth of 3. Performed 900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-09 16:06:57,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:06:57,086 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:06:57,240 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 75.58% of their original sizes. [2018-12-09 16:06:57,240 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:06:58,174 INFO L418 sIntCurrentIteration]: We unified 190 AI predicates to 190 [2018-12-09 16:06:58,174 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:06:58,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:06:58,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [6] total 54 [2018-12-09 16:06:58,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:06:58,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-09 16:06:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-09 16:06:58,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2147, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 16:06:58,178 INFO L87 Difference]: Start difference. First operand 1486 states and 1716 transitions. Second operand 50 states. [2018-12-09 16:07:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:04,833 INFO L93 Difference]: Finished difference Result 3277 states and 3825 transitions. [2018-12-09 16:07:04,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-09 16:07:04,833 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 191 [2018-12-09 16:07:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:04,837 INFO L225 Difference]: With dead ends: 3277 [2018-12-09 16:07:04,837 INFO L226 Difference]: Without dead ends: 1807 [2018-12-09 16:07:04,840 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 240 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3093 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1024, Invalid=8876, Unknown=0, NotChecked=0, Total=9900 [2018-12-09 16:07:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2018-12-09 16:07:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1790. [2018-12-09 16:07:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2018-12-09 16:07:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2059 transitions. [2018-12-09 16:07:04,927 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2059 transitions. Word has length 191 [2018-12-09 16:07:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:04,927 INFO L480 AbstractCegarLoop]: Abstraction has 1790 states and 2059 transitions. [2018-12-09 16:07:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-09 16:07:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2059 transitions. [2018-12-09 16:07:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 16:07:04,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:04,928 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:04,929 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:04,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 854195035, now seen corresponding path program 1 times [2018-12-09 16:07:04,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:04,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:04,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:04,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 16:07:04,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:04,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:04,983 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2018-12-09 16:07:04,983 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [300], [306], [313], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:04,986 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:04,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:05,029 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:07:05,030 INFO L272 AbstractInterpreter]: Visited 107 different actions 138 times. Never merged. Never widened. Performed 956 root evaluator evaluations with a maximum evaluation depth of 3. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 16:07:05,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:05,034 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:07:05,123 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 76.08% of their original sizes. [2018-12-09 16:07:05,123 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:07:05,611 INFO L418 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2018-12-09 16:07:05,611 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:07:05,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:07:05,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [6] total 56 [2018-12-09 16:07:05,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:05,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 16:07:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 16:07:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2342, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 16:07:05,613 INFO L87 Difference]: Start difference. First operand 1790 states and 2059 transitions. Second operand 52 states. [2018-12-09 16:07:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:11,931 INFO L93 Difference]: Finished difference Result 3279 states and 3793 transitions. [2018-12-09 16:07:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-09 16:07:11,931 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 192 [2018-12-09 16:07:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:11,934 INFO L225 Difference]: With dead ends: 3279 [2018-12-09 16:07:11,934 INFO L226 Difference]: Without dead ends: 1815 [2018-12-09 16:07:11,937 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3211 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1055, Invalid=9247, Unknown=0, NotChecked=0, Total=10302 [2018-12-09 16:07:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2018-12-09 16:07:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1794. [2018-12-09 16:07:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2018-12-09 16:07:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2065 transitions. [2018-12-09 16:07:12,018 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2065 transitions. Word has length 192 [2018-12-09 16:07:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:12,019 INFO L480 AbstractCegarLoop]: Abstraction has 1794 states and 2065 transitions. [2018-12-09 16:07:12,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 16:07:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2065 transitions. [2018-12-09 16:07:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 16:07:12,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:12,020 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:12,021 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:12,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 525514926, now seen corresponding path program 1 times [2018-12-09 16:07:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:12,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:12,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 16:07:12,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:12,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:12,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-12-09 16:07:12,065 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [300], [303], [313], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:12,067 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:12,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:12,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:07:12,096 INFO L272 AbstractInterpreter]: Visited 114 different actions 146 times. Never merged. Never widened. Performed 1000 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1000 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 16:07:12,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:12,102 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:07:12,185 INFO L227 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 76.27% of their original sizes. [2018-12-09 16:07:12,186 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:07:12,773 INFO L418 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-12-09 16:07:12,774 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:07:12,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:07:12,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2018-12-09 16:07:12,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:12,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-09 16:07:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-09 16:07:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 16:07:12,775 INFO L87 Difference]: Start difference. First operand 1794 states and 2065 transitions. Second operand 54 states. [2018-12-09 16:07:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:21,059 INFO L93 Difference]: Finished difference Result 2813 states and 3252 transitions. [2018-12-09 16:07:21,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-09 16:07:21,059 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 199 [2018-12-09 16:07:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:21,062 INFO L225 Difference]: With dead ends: 2813 [2018-12-09 16:07:21,062 INFO L226 Difference]: Without dead ends: 2001 [2018-12-09 16:07:21,065 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1061, Invalid=9651, Unknown=0, NotChecked=0, Total=10712 [2018-12-09 16:07:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2018-12-09 16:07:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1982. [2018-12-09 16:07:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-12-09 16:07:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2268 transitions. [2018-12-09 16:07:21,170 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2268 transitions. Word has length 199 [2018-12-09 16:07:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:21,170 INFO L480 AbstractCegarLoop]: Abstraction has 1982 states and 2268 transitions. [2018-12-09 16:07:21,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-09 16:07:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2268 transitions. [2018-12-09 16:07:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 16:07:21,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:21,173 INFO L402 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, 3, 3, 3, 3, 3, 3, 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-12-09 16:07:21,173 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:21,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash -137129457, now seen corresponding path program 1 times [2018-12-09 16:07:21,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:21,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:21,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 16:07:21,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:21,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:21,230 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-12-09 16:07:21,230 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [296], [300], [306], [309], [313], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:21,231 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:21,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:21,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:07:21,272 INFO L272 AbstractInterpreter]: Visited 116 different actions 166 times. Merged at 11 different actions 11 times. Never widened. Performed 1178 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1178 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-09 16:07:21,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:21,278 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:07:21,405 INFO L227 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 76.89% of their original sizes. [2018-12-09 16:07:21,405 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:07:22,168 INFO L418 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-12-09 16:07:22,168 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:07:22,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:07:22,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [4] total 66 [2018-12-09 16:07:22,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:22,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-09 16:07:22,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-09 16:07:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3644, Unknown=0, NotChecked=0, Total=4032 [2018-12-09 16:07:22,170 INFO L87 Difference]: Start difference. First operand 1982 states and 2268 transitions. Second operand 64 states. [2018-12-09 16:07:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:30,650 INFO L93 Difference]: Finished difference Result 3621 states and 4200 transitions. [2018-12-09 16:07:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-09 16:07:30,651 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 212 [2018-12-09 16:07:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:30,656 INFO L225 Difference]: With dead ends: 3621 [2018-12-09 16:07:30,656 INFO L226 Difference]: Without dead ends: 1831 [2018-12-09 16:07:30,662 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 272 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1387, Invalid=14113, Unknown=0, NotChecked=0, Total=15500 [2018-12-09 16:07:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2018-12-09 16:07:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1772. [2018-12-09 16:07:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-12-09 16:07:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2039 transitions. [2018-12-09 16:07:30,789 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2039 transitions. Word has length 212 [2018-12-09 16:07:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:30,789 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 2039 transitions. [2018-12-09 16:07:30,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-09 16:07:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2039 transitions. [2018-12-09 16:07:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-09 16:07:30,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:30,791 INFO L402 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:30,792 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:30,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1768103881, now seen corresponding path program 1 times [2018-12-09 16:07:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:30,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 16:07:30,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:30,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:30,823 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-12-09 16:07:30,823 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [306], [309], [313], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:30,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:30,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:30,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:07:30,918 INFO L272 AbstractInterpreter]: Visited 122 different actions 366 times. Merged at 22 different actions 36 times. Never widened. Performed 4174 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4174 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-09 16:07:30,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:30,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:07:30,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:30,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/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-12-09 16:07:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:30,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:07:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:31,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:07:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 16:07:31,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:07:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 16:07:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:07:31,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-12-09 16:07:31,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:07:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:07:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:07:31,186 INFO L87 Difference]: Start difference. First operand 1772 states and 2039 transitions. Second operand 3 states. [2018-12-09 16:07:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:31,350 INFO L93 Difference]: Finished difference Result 3734 states and 4486 transitions. [2018-12-09 16:07:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:07:31,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-09 16:07:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:31,355 INFO L225 Difference]: With dead ends: 3734 [2018-12-09 16:07:31,355 INFO L226 Difference]: Without dead ends: 2203 [2018-12-09 16:07:31,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 418 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-12-09 16:07:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2018-12-09 16:07:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 2193. [2018-12-09 16:07:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-12-09 16:07:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 2501 transitions. [2018-12-09 16:07:31,467 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 2501 transitions. Word has length 212 [2018-12-09 16:07:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:31,467 INFO L480 AbstractCegarLoop]: Abstraction has 2193 states and 2501 transitions. [2018-12-09 16:07:31,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:07:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2501 transitions. [2018-12-09 16:07:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-09 16:07:31,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:31,470 INFO L402 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:07:31,470 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:31,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1039652455, now seen corresponding path program 1 times [2018-12-09 16:07:31,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:31,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:31,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 17 proven. 27 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-09 16:07:31,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:31,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:31,511 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-12-09 16:07:31,511 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [303], [309], [313], [316], [322], [328], [331], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:31,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:31,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:31,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:07:31,544 INFO L272 AbstractInterpreter]: Visited 119 different actions 167 times. Merged at 6 different actions 6 times. Never widened. Performed 1350 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-09 16:07:31,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:31,545 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:07:31,616 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 75.42% of their original sizes. [2018-12-09 16:07:31,616 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:07:32,322 INFO L418 sIntCurrentIteration]: We unified 213 AI predicates to 213 [2018-12-09 16:07:32,322 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:07:32,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:07:32,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [4] total 65 [2018-12-09 16:07:32,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:32,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-09 16:07:32,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-09 16:07:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3485, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 16:07:32,324 INFO L87 Difference]: Start difference. First operand 2193 states and 2501 transitions. Second operand 63 states. [2018-12-09 16:07:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:41,038 INFO L93 Difference]: Finished difference Result 3499 states and 4014 transitions. [2018-12-09 16:07:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-09 16:07:41,038 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 214 [2018-12-09 16:07:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:41,042 INFO L225 Difference]: With dead ends: 3499 [2018-12-09 16:07:41,042 INFO L226 Difference]: Without dead ends: 2237 [2018-12-09 16:07:41,044 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4012 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1252, Invalid=10958, Unknown=0, NotChecked=0, Total=12210 [2018-12-09 16:07:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2018-12-09 16:07:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2192. [2018-12-09 16:07:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2018-12-09 16:07:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 2496 transitions. [2018-12-09 16:07:41,150 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 2496 transitions. Word has length 214 [2018-12-09 16:07:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:41,150 INFO L480 AbstractCegarLoop]: Abstraction has 2192 states and 2496 transitions. [2018-12-09 16:07:41,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-09 16:07:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 2496 transitions. [2018-12-09 16:07:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-09 16:07:41,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:41,152 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:07:41,152 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:41,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash 667968137, now seen corresponding path program 1 times [2018-12-09 16:07:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:41,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:41,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:41,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-09 16:07:41,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:41,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:41,186 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-12-09 16:07:41,186 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [306], [309], [313], [316], [328], [331], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:41,187 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:41,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:41,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:07:41,312 INFO L272 AbstractInterpreter]: Visited 126 different actions 526 times. Merged at 39 different actions 94 times. Never widened. Performed 4976 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 6 different actions. Largest state had 42 variables. [2018-12-09 16:07:41,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:41,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:07:41,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:41,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:07:41,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:41,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:07:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:41,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:07:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 16:07:41,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:07:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-09 16:07:41,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:07:41,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-09 16:07:41,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:41,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:07:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:07:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:07:41,638 INFO L87 Difference]: Start difference. First operand 2192 states and 2496 transitions. Second operand 4 states. [2018-12-09 16:07:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:41,944 INFO L93 Difference]: Finished difference Result 4002 states and 4686 transitions. [2018-12-09 16:07:41,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:07:41,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-12-09 16:07:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:41,949 INFO L225 Difference]: With dead ends: 4002 [2018-12-09 16:07:41,949 INFO L226 Difference]: Without dead ends: 2503 [2018-12-09 16:07:41,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:07:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2018-12-09 16:07:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2495. [2018-12-09 16:07:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-09 16:07:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2918 transitions. [2018-12-09 16:07:42,076 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2918 transitions. Word has length 214 [2018-12-09 16:07:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:42,076 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 2918 transitions. [2018-12-09 16:07:42,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:07:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2918 transitions. [2018-12-09 16:07:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 16:07:42,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:42,078 INFO L402 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:07:42,078 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:42,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1408733273, now seen corresponding path program 1 times [2018-12-09 16:07:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:42,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-09 16:07:42,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:42,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:42,131 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-12-09 16:07:42,132 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [303], [309], [313], [316], [319], [328], [331], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:42,132 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:42,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:42,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:07:42,261 INFO L272 AbstractInterpreter]: Visited 125 different actions 505 times. Merged at 31 different actions 114 times. Never widened. Performed 5555 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5555 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 14 fixpoints after 6 different actions. Largest state had 42 variables. [2018-12-09 16:07:42,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:42,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:07:42,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:42,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:07:42,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:42,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:07:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:42,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:07:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 16:07:42,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:07:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 16:07:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:07:42,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2018-12-09 16:07:42,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:42,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:07:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:07:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:07:42,436 INFO L87 Difference]: Start difference. First operand 2495 states and 2918 transitions. Second operand 3 states. [2018-12-09 16:07:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:42,628 INFO L93 Difference]: Finished difference Result 6111 states and 7458 transitions. [2018-12-09 16:07:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:07:42,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-12-09 16:07:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:42,637 INFO L225 Difference]: With dead ends: 6111 [2018-12-09 16:07:42,638 INFO L226 Difference]: Without dead ends: 3802 [2018-12-09 16:07:42,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:07:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2018-12-09 16:07:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3774. [2018-12-09 16:07:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2018-12-09 16:07:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 4532 transitions. [2018-12-09 16:07:42,871 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 4532 transitions. Word has length 215 [2018-12-09 16:07:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:42,871 INFO L480 AbstractCegarLoop]: Abstraction has 3774 states and 4532 transitions. [2018-12-09 16:07:42,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:07:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 4532 transitions. [2018-12-09 16:07:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-09 16:07:42,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:42,874 INFO L402 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:42,874 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:42,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1196366154, now seen corresponding path program 1 times [2018-12-09 16:07:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:42,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:42,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 16:07:42,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:42,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:42,941 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-12-09 16:07:42,941 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [303], [309], [313], [316], [319], [328], [331], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:42,942 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:42,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:43,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:07:43,032 INFO L272 AbstractInterpreter]: Visited 124 different actions 399 times. Merged at 20 different actions 54 times. Never widened. Performed 4241 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4241 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 6 different actions. Largest state had 42 variables. [2018-12-09 16:07:43,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:43,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:07:43,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:43,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:07:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:43,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:07:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:43,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:07:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 16:07:43,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:07:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-09 16:07:43,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:07:43,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-12-09 16:07:43,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:43,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:07:43,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:07:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:07:43,282 INFO L87 Difference]: Start difference. First operand 3774 states and 4532 transitions. Second operand 6 states. [2018-12-09 16:07:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:43,487 INFO L93 Difference]: Finished difference Result 6760 states and 8370 transitions. [2018-12-09 16:07:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:07:43,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2018-12-09 16:07:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:43,497 INFO L225 Difference]: With dead ends: 6760 [2018-12-09 16:07:43,497 INFO L226 Difference]: Without dead ends: 3799 [2018-12-09 16:07:43,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 423 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:07:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2018-12-09 16:07:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 3789. [2018-12-09 16:07:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3789 states. [2018-12-09 16:07:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3789 states to 3789 states and 4546 transitions. [2018-12-09 16:07:43,700 INFO L78 Accepts]: Start accepts. Automaton has 3789 states and 4546 transitions. Word has length 214 [2018-12-09 16:07:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 3789 states and 4546 transitions. [2018-12-09 16:07:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:07:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3789 states and 4546 transitions. [2018-12-09 16:07:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 16:07:43,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:43,703 INFO L402 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 16:07:43,703 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:43,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1816666747, now seen corresponding path program 1 times [2018-12-09 16:07:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:43,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-09 16:07:43,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:43,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:43,753 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-12-09 16:07:43,753 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [293], [300], [303], [306], [313], [316], [319], [328], [331], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [438], [440], [442], [443], [484], [485], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:43,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:43,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:43,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:07:43,836 INFO L272 AbstractInterpreter]: Visited 125 different actions 386 times. Merged at 31 different actions 77 times. Never widened. Performed 3598 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3598 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-09 16:07:43,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:43,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:07:43,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:43,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:07:43,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:43,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:07:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:43,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:07:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 16:07:43,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:07:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 16:07:44,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 16:07:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2018-12-09 16:07:44,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:44,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:07:44,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:07:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:07:44,113 INFO L87 Difference]: Start difference. First operand 3789 states and 4546 transitions. Second operand 5 states. [2018-12-09 16:07:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:44,535 INFO L93 Difference]: Finished difference Result 6769 states and 8286 transitions. [2018-12-09 16:07:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:07:44,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2018-12-09 16:07:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:44,543 INFO L225 Difference]: With dead ends: 6769 [2018-12-09 16:07:44,543 INFO L226 Difference]: Without dead ends: 4097 [2018-12-09 16:07:44,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 423 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:07:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2018-12-09 16:07:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4037. [2018-12-09 16:07:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4037 states. [2018-12-09 16:07:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 4841 transitions. [2018-12-09 16:07:44,783 INFO L78 Accepts]: Start accepts. Automaton has 4037 states and 4841 transitions. Word has length 215 [2018-12-09 16:07:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:44,783 INFO L480 AbstractCegarLoop]: Abstraction has 4037 states and 4841 transitions. [2018-12-09 16:07:44,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:07:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4037 states and 4841 transitions. [2018-12-09 16:07:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-09 16:07:44,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:44,786 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:44,786 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:44,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1462892358, now seen corresponding path program 1 times [2018-12-09 16:07:44,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:44,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:44,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:44,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-09 16:07:44,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:07:44,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:07:44,858 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-12-09 16:07:44,859 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [185], [188], [190], [193], [204], [206], [208], [212], [250], [253], [254], [266], [275], [278], [281], [287], [290], [296], [300], [303], [313], [316], [328], [331], [334], [336], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [380], [381], [395], [397], [427], [428], [431], [434], [436], [438], [440], [442], [443], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [496], [497], [498], [499], [500], [502], [503], [504], [510], [511], [512], [513], [514], [515], [516], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [548], [549], [550] [2018-12-09 16:07:44,859 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:07:44,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:07:44,886 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 16:07:44,886 INFO L272 AbstractInterpreter]: Visited 125 different actions 167 times. Merged at 2 different actions 2 times. Never widened. Performed 1160 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1160 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-12-09 16:07:44,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:44,887 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 16:07:44,966 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 75.46% of their original sizes. [2018-12-09 16:07:44,966 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 16:07:45,731 INFO L418 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2018-12-09 16:07:45,731 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 16:07:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:07:45,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [5] total 72 [2018-12-09 16:07:45,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:45,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-09 16:07:45,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-09 16:07:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=4285, Unknown=0, NotChecked=0, Total=4692 [2018-12-09 16:07:45,733 INFO L87 Difference]: Start difference. First operand 4037 states and 4841 transitions. Second operand 69 states. [2018-12-09 16:07:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:56,226 INFO L93 Difference]: Finished difference Result 7135 states and 8636 transitions. [2018-12-09 16:07:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-09 16:07:56,226 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 266 [2018-12-09 16:07:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:56,233 INFO L225 Difference]: With dead ends: 7135 [2018-12-09 16:07:56,233 INFO L226 Difference]: Without dead ends: 3971 [2018-12-09 16:07:56,238 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1180, Invalid=11476, Unknown=0, NotChecked=0, Total=12656 [2018-12-09 16:07:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3971 states. [2018-12-09 16:07:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3971 to 3952. [2018-12-09 16:07:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2018-12-09 16:07:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4747 transitions. [2018-12-09 16:07:56,468 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4747 transitions. Word has length 266 [2018-12-09 16:07:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:56,469 INFO L480 AbstractCegarLoop]: Abstraction has 3952 states and 4747 transitions. [2018-12-09 16:07:56,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-09 16:07:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4747 transitions. [2018-12-09 16:07:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-09 16:07:56,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:56,472 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:56,472 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:56,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash -104803410, now seen corresponding path program 1 times [2018-12-09 16:07:56,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:56,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:56,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-09 16:07:56,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:07:56,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:07:56,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:56,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:07:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:07:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:07:56,568 INFO L87 Difference]: Start difference. First operand 3952 states and 4747 transitions. Second operand 7 states. [2018-12-09 16:07:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:58,186 INFO L93 Difference]: Finished difference Result 14583 states and 20063 transitions. [2018-12-09 16:07:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 16:07:58,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 267 [2018-12-09 16:07:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:58,212 INFO L225 Difference]: With dead ends: 14583 [2018-12-09 16:07:58,212 INFO L226 Difference]: Without dead ends: 11679 [2018-12-09 16:07:58,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:07:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11679 states. [2018-12-09 16:07:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11679 to 11122. [2018-12-09 16:07:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11122 states. [2018-12-09 16:07:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11122 states to 11122 states and 14827 transitions. [2018-12-09 16:07:58,923 INFO L78 Accepts]: Start accepts. Automaton has 11122 states and 14827 transitions. Word has length 267 [2018-12-09 16:07:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:07:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 11122 states and 14827 transitions. [2018-12-09 16:07:58,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:07:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11122 states and 14827 transitions. [2018-12-09 16:07:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-09 16:07:58,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:07:58,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:07:58,927 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:07:58,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:07:58,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2011903914, now seen corresponding path program 1 times [2018-12-09 16:07:58,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:07:58,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:58,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:07:58,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:07:58,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:07:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:07:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-12-09 16:07:59,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:07:59,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:07:59,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:07:59,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:07:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:07:59,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:07:59,017 INFO L87 Difference]: Start difference. First operand 11122 states and 14827 transitions. Second operand 3 states. [2018-12-09 16:07:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:07:59,664 INFO L93 Difference]: Finished difference Result 18690 states and 26485 transitions. [2018-12-09 16:07:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:07:59,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-12-09 16:07:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:07:59,691 INFO L225 Difference]: With dead ends: 18690 [2018-12-09 16:07:59,691 INFO L226 Difference]: Without dead ends: 11150 [2018-12-09 16:07:59,715 INFO L631 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-12-09 16:07:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11150 states. [2018-12-09 16:08:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11150 to 11150. [2018-12-09 16:08:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2018-12-09 16:08:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 14899 transitions. [2018-12-09 16:08:00,414 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 14899 transitions. Word has length 271 [2018-12-09 16:08:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:08:00,414 INFO L480 AbstractCegarLoop]: Abstraction has 11150 states and 14899 transitions. [2018-12-09 16:08:00,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:08:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 14899 transitions. [2018-12-09 16:08:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-09 16:08:00,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:08:00,418 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:08:00,419 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 16:08:00,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:08:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1010345585, now seen corresponding path program 1 times [2018-12-09 16:08:00,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:08:00,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:08:00,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:08:00,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:08:00,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:08:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:08:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:08:00,512 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:08:00,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:08:00 BoogieIcfgContainer [2018-12-09 16:08:00,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:08:00,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:08:00,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:08:00,600 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:08:00,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:06:51" (3/4) ... [2018-12-09 16:08:00,602 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 16:08:00,694 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_697c1c96-e892-4626-acc9-71517a2ad33f/bin-2019/utaipan/witness.graphml [2018-12-09 16:08:00,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:08:00,695 INFO L168 Benchmark]: Toolchain (without parser) took 69412.35 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 950.9 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 130.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,695 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:08:00,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.32 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 933.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 933.7 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,696 INFO L168 Benchmark]: Boogie Preprocessor took 22.83 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,696 INFO L168 Benchmark]: RCFGBuilder took 309.70 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,697 INFO L168 Benchmark]: TraceAbstraction took 68770.01 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,697 INFO L168 Benchmark]: Witness Printer took 93.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:08:00,698 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.32 ms. Allocated memory is still 1.0 GB. Free memory was 950.9 MB in the beginning and 933.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 933.7 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.83 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 309.70 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68770.01 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * Witness Printer took 93.66 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 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 t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [\old(E_1)=18, \old(E_2)=5, \old(E_M)=13, \old(local)=17, \old(M_E)=14, \old(m_i)=7, \old(m_pc)=11, \old(m_st)=12, \old(T1_E)=3, \old(t1_i)=16, \old(t1_pc)=8, \old(t1_st)=4, \old(T2_E)=15, \old(t2_i)=6, \old(t2_pc)=9, \old(t2_st)=10, \old(token)=19, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L600] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L604] CALL init_model() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L604] RET init_model() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L605] CALL start_simulation() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] FCALL update_channels() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL init_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET init_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L346] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L351] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L361] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L366] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L371] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L551] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=2, E_M=2, is_transmit2_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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L551] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L384] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L389] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L399] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L404] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L409] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L552] RET reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L555] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] kernel_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL eval() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L279] int tmp ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L96] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L132] COND TRUE t2_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=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)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=1, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L51] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L57] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L168] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=2, E_M=2, is_transmit2_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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L57] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L299] RET master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L313] CALL transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L115] token += 1 [L116] E_2 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L117] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_master_triggered()=0, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=0, __retres1=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_transmit1_triggered()=0, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, __retres1=1, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, E_M=2, is_transmit2_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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L117] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L118] E_2 = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L313] RET transmit1() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=1] [L327] CALL transmit2() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L151] token += 1 [L152] E_M = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] CALL immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L457] CALL activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L165] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=1, __retres1=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L433] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L184] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L433] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L441] CALL, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L203] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, __retres1=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, \result=0, __retres1=0, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L441] RET, EXPR is_transmit2_triggered() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=2, E_M=1, is_transmit2_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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L457] RET activate_threads() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L153] RET immediate_notify() VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L154] E_M = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [\old(E_1)=2, \old(E_2)=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)=0, \old(t1_st)=2, \old(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=1, \old(t2_st)=1, \old(token)=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L327] RET transmit2() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L283] COND TRUE 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L286] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L253] int __retres1 ; VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L274] return (__retres1); VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, \result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L286] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=0, \old(token)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L299] CALL master() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L43] COND TRUE m_pc == 1 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L65] COND FALSE !(token != local + 2) VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L70] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L71] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L76] COND TRUE tmp_var <= 5 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L77] COND TRUE tmp_var >= 5 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L78] COND TRUE tmp_var == 5 VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L79] CALL error() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [\old(E_1)=2, \old(E_2)=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(T2_E)=2, \old(t2_i)=0, \old(t2_pc)=0, \old(t2_st)=2, \old(token)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 181 locations, 1 error locations. UNSAFE Result, 68.7s OverallTime, 32 OverallIterations, 4 TraceHistogramMax, 56.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8523 SDtfs, 12504 SDslu, 39829 SDs, 0 SdLazy, 21214 SolverSat, 4088 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 3935 GetRequests, 3126 SyntacticMatches, 50 SemanticMatches, 759 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23309 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11150occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 11 AbstIntIterations, 6 AbstIntStrong, 0.9887561445796952 AbsIntWeakeningRatio, 0.580441640378549 AbsIntAvgWeakeningVarsNumRemoved, 17.62223974763407 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5935 NumberOfCodeBlocks, 5935 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6692 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798312 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4666 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 41 InterpolantComputations, 25 PerfectInterpolantSequences, 3028/3322 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...