./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:51:59,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:51:59,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:51:59,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:51:59,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:51:59,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:51:59,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:51:59,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:51:59,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:51:59,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:51:59,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:51:59,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:51:59,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:51:59,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:51:59,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:51:59,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:51:59,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:51:59,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:51:59,647 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:51:59,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:51:59,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:51:59,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:51:59,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:51:59,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:51:59,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:51:59,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:51:59,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:51:59,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:51:59,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:51:59,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:51:59,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:51:59,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:51:59,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:51:59,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:51:59,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:51:59,658 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:51:59,659 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 12:51:59,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:51:59,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:51:59,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:51:59,669 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:51:59,669 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:51:59,669 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:51:59,669 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:51:59,669 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:51:59,670 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:51:59,670 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:51:59,670 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:51:59,670 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:51:59,670 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:51:59,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:51:59,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:51:59,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:51:59,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:51:59,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:51:59,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:51:59,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 12:51:59,674 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_237c3dc5-0862-4c67-8c9d-3e5f54dba664/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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2018-11-18 12:51:59,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:51:59,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:51:59,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:51:59,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:51:59,708 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:51:59,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:51:59,744 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/data/6aa56f7f6/8370188dc4134554984470806fae516e/FLAG1f4e9df0b [2018-11-18 12:52:00,156 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:52:00,156 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:52:00,163 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/data/6aa56f7f6/8370188dc4134554984470806fae516e/FLAG1f4e9df0b [2018-11-18 12:52:00,171 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/data/6aa56f7f6/8370188dc4134554984470806fae516e [2018-11-18 12:52:00,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:52:00,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:52:00,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:52:00,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:52:00,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:52:00,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4959e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00, skipping insertion in model container [2018-11-18 12:52:00,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:52:00,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:52:00,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:52:00,336 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:52:00,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:52:00,366 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:52:00,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00 WrapperNode [2018-11-18 12:52:00,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:52:00,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:52:00,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:52:00,367 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:52:00,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:52:00,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:52:00,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:52:00,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:52:00,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... [2018-11-18 12:52:00,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:52:00,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:52:00,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:52:00,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:52:00,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:52:00,480 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 12:52:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 12:52:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 12:52:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 12:52:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 12:52:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 12:52:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 12:52:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 12:52:00,481 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 12:52:00,481 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 12:52:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 12:52:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 12:52:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 12:52:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 12:52:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:52:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:52:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 12:52:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 12:52:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 12:52:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 12:52:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 12:52:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 12:52:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:52:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:52:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 12:52:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 12:52:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 12:52:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 12:52:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 12:52:00,483 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 12:52:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 12:52:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 12:52:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 12:52:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 12:52:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 12:52:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 12:52:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:52:00,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:52:00,484 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 12:52:00,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 12:52:00,485 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 12:52:00,485 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 12:52:00,760 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:52:00,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:52:00 BoogieIcfgContainer [2018-11-18 12:52:00,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:52:00,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:52:00,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:52:00,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:52:00,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:52:00" (1/3) ... [2018-11-18 12:52:00,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00c1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:52:00, skipping insertion in model container [2018-11-18 12:52:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:52:00" (2/3) ... [2018-11-18 12:52:00,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d00c1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:52:00, skipping insertion in model container [2018-11-18 12:52:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:52:00" (3/3) ... [2018-11-18 12:52:00,767 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-18 12:52:00,774 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:52:00,779 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 12:52:00,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 12:52:00,821 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:52:00,821 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 12:52:00,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:52:00,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:52:00,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:52:00,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:52:00,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:52:00,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:52:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-11-18 12:52:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:52:00,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:00,844 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:00,846 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:00,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1453249284, now seen corresponding path program 1 times [2018-11-18 12:52:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:00,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:00,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:01,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:01,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:01,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:01,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:01,095 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-11-18 12:52:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:01,473 INFO L93 Difference]: Finished difference Result 297 states and 415 transitions. [2018-11-18 12:52:01,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:52:01,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-18 12:52:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:01,487 INFO L225 Difference]: With dead ends: 297 [2018-11-18 12:52:01,487 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 12:52:01,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 12:52:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-18 12:52:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 12:52:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2018-11-18 12:52:01,533 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 77 [2018-11-18 12:52:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:01,533 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2018-11-18 12:52:01,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2018-11-18 12:52:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:52:01,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:01,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:01,536 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:01,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1412574534, now seen corresponding path program 1 times [2018-11-18 12:52:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:01,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:01,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:01,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:01,617 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand 5 states. [2018-11-18 12:52:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:01,856 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2018-11-18 12:52:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:52:01,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-18 12:52:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:01,859 INFO L225 Difference]: With dead ends: 276 [2018-11-18 12:52:01,859 INFO L226 Difference]: Without dead ends: 160 [2018-11-18 12:52:01,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-18 12:52:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-18 12:52:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 12:52:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2018-11-18 12:52:01,878 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 77 [2018-11-18 12:52:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:01,878 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2018-11-18 12:52:01,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2018-11-18 12:52:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:52:01,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:01,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:01,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:01,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash -25789124, now seen corresponding path program 1 times [2018-11-18 12:52:01,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:01,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:01,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:01,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:01,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:01,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:01,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:01,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:01,948 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 5 states. [2018-11-18 12:52:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,133 INFO L93 Difference]: Finished difference Result 292 states and 385 transitions. [2018-11-18 12:52:02,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:52:02,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-18 12:52:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:02,135 INFO L225 Difference]: With dead ends: 292 [2018-11-18 12:52:02,135 INFO L226 Difference]: Without dead ends: 176 [2018-11-18 12:52:02,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-18 12:52:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 135. [2018-11-18 12:52:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 12:52:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2018-11-18 12:52:02,150 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 77 [2018-11-18 12:52:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:02,150 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2018-11-18 12:52:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2018-11-18 12:52:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:52:02,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:02,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:02,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:02,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,152 INFO L82 PathProgramCache]: Analyzing trace with hash 850229882, now seen corresponding path program 1 times [2018-11-18 12:52:02,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:02,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:02,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:02,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:02,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:52:02,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:02,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:52:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:52:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:02,203 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand 6 states. [2018-11-18 12:52:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,253 INFO L93 Difference]: Finished difference Result 260 states and 336 transitions. [2018-11-18 12:52:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:52:02,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-18 12:52:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:02,255 INFO L225 Difference]: With dead ends: 260 [2018-11-18 12:52:02,255 INFO L226 Difference]: Without dead ends: 145 [2018-11-18 12:52:02,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:52:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-18 12:52:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-18 12:52:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 12:52:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2018-11-18 12:52:02,272 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 77 [2018-11-18 12:52:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:02,273 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2018-11-18 12:52:02,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:52:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2018-11-18 12:52:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 12:52:02,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:02,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:02,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:02,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1273876604, now seen corresponding path program 1 times [2018-11-18 12:52:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:52:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:52:02,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:02,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 12:52:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:52:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:52:02,353 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 4 states. [2018-11-18 12:52:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,494 INFO L93 Difference]: Finished difference Result 370 states and 478 transitions. [2018-11-18 12:52:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:52:02,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-11-18 12:52:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:02,495 INFO L225 Difference]: With dead ends: 370 [2018-11-18 12:52:02,495 INFO L226 Difference]: Without dead ends: 250 [2018-11-18 12:52:02,496 INFO L604 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-11-18 12:52:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-18 12:52:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-11-18 12:52:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 12:52:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 308 transitions. [2018-11-18 12:52:02,517 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 308 transitions. Word has length 77 [2018-11-18 12:52:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:02,517 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 308 transitions. [2018-11-18 12:52:02,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 12:52:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 308 transitions. [2018-11-18 12:52:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 12:52:02,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:02,519 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:52:02,519 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:02,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -857761741, now seen corresponding path program 1 times [2018-11-18 12:52:02,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:02,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 12:52:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 12:52:02,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:02,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:52:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:52:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:02,577 INFO L87 Difference]: Start difference. First operand 250 states and 308 transitions. Second operand 6 states. [2018-11-18 12:52:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,614 INFO L93 Difference]: Finished difference Result 487 states and 615 transitions. [2018-11-18 12:52:02,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:52:02,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-18 12:52:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:02,616 INFO L225 Difference]: With dead ends: 487 [2018-11-18 12:52:02,616 INFO L226 Difference]: Without dead ends: 257 [2018-11-18 12:52:02,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:52:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-18 12:52:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-11-18 12:52:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 12:52:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-11-18 12:52:02,637 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 97 [2018-11-18 12:52:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:02,637 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-11-18 12:52:02,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:52:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-11-18 12:52:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 12:52:02,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:02,638 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:52:02,639 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:02,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 680578289, now seen corresponding path program 1 times [2018-11-18 12:52:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 12:52:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:02,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:02,699 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 5 states. [2018-11-18 12:52:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:02,926 INFO L93 Difference]: Finished difference Result 614 states and 786 transitions. [2018-11-18 12:52:02,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 12:52:02,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-18 12:52:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:02,931 INFO L225 Difference]: With dead ends: 614 [2018-11-18 12:52:02,931 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 12:52:02,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:52:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 12:52:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2018-11-18 12:52:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-18 12:52:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2018-11-18 12:52:02,956 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 97 [2018-11-18 12:52:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:02,956 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2018-11-18 12:52:02,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2018-11-18 12:52:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 12:52:02,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:02,957 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:52:02,957 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:02,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1675226961, now seen corresponding path program 1 times [2018-11-18 12:52:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:02,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 12:52:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:03,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:03,020 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand 5 states. [2018-11-18 12:52:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:03,248 INFO L93 Difference]: Finished difference Result 613 states and 750 transitions. [2018-11-18 12:52:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:52:03,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-18 12:52:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:03,251 INFO L225 Difference]: With dead ends: 613 [2018-11-18 12:52:03,251 INFO L226 Difference]: Without dead ends: 317 [2018-11-18 12:52:03,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:52:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-18 12:52:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-18 12:52:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-18 12:52:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 378 transitions. [2018-11-18 12:52:03,274 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 378 transitions. Word has length 97 [2018-11-18 12:52:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:03,275 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 378 transitions. [2018-11-18 12:52:03,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 378 transitions. [2018-11-18 12:52:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 12:52:03,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:03,276 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:52:03,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:03,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2028315343, now seen corresponding path program 1 times [2018-11-18 12:52:03,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 12:52:03,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:52:03,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:52:03,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:03,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:52:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:52:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:52:03,361 INFO L87 Difference]: Start difference. First operand 317 states and 378 transitions. Second operand 5 states. [2018-11-18 12:52:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:03,608 INFO L93 Difference]: Finished difference Result 726 states and 919 transitions. [2018-11-18 12:52:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:52:03,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-18 12:52:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:03,611 INFO L225 Difference]: With dead ends: 726 [2018-11-18 12:52:03,611 INFO L226 Difference]: Without dead ends: 430 [2018-11-18 12:52:03,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:52:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-18 12:52:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 351. [2018-11-18 12:52:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-18 12:52:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2018-11-18 12:52:03,636 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 97 [2018-11-18 12:52:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2018-11-18 12:52:03,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:52:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2018-11-18 12:52:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 12:52:03,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:03,638 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 12:52:03,638 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:03,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash -100042641, now seen corresponding path program 1 times [2018-11-18 12:52:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:03,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 12:52:03,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:52:03,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:52:03,667 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-18 12:52:03,669 INFO L202 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [45], [48], [51], [60], [61], [66], [72], [78], [80], [81], [91], [93], [95], [96], [99], [105], [109], [110], [115], [164], [165], [177], [181], [187], [190], [193], [208], [212], [215], [227], [236], [242], [244], [278], [284], [290], [292], [293], [294], [304], [306], [308], [309], [332], [333], [334], [335], [336], [337], [338], [342], [343], [344], [350], [351], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [386], [387], [388] [2018-11-18 12:52:03,694 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:52:03,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:52:03,840 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:52:03,841 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Performed 323 root evaluator evaluations with a maximum evaluation depth of 3. Performed 323 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-18 12:52:03,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:03,859 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:52:03,988 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 70.24% of their original sizes. [2018-11-18 12:52:03,988 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:52:04,126 INFO L415 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2018-11-18 12:52:04,126 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:52:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:52:04,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [3] total 23 [2018-11-18 12:52:04,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:04,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 12:52:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 12:52:04,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-18 12:52:04,128 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand 22 states. [2018-11-18 12:52:05,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:05,731 INFO L93 Difference]: Finished difference Result 753 states and 879 transitions. [2018-11-18 12:52:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 12:52:05,731 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-11-18 12:52:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:05,733 INFO L225 Difference]: With dead ends: 753 [2018-11-18 12:52:05,733 INFO L226 Difference]: Without dead ends: 417 [2018-11-18 12:52:05,734 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 12:52:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-18 12:52:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 407. [2018-11-18 12:52:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-18 12:52:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 462 transitions. [2018-11-18 12:52:05,756 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 462 transitions. Word has length 97 [2018-11-18 12:52:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:05,756 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 462 transitions. [2018-11-18 12:52:05,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 12:52:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 462 transitions. [2018-11-18 12:52:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 12:52:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:05,757 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:05,758 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:05,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -438829167, now seen corresponding path program 1 times [2018-11-18 12:52:05,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:05,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:52:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 12:52:05,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:52:05,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:52:05,791 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2018-11-18 12:52:05,791 INFO L202 CegarAbsIntRunner]: [0], [2], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [45], [48], [51], [60], [61], [66], [72], [78], [80], [81], [91], [93], [95], [96], [99], [105], [109], [110], [115], [164], [165], [177], [181], [187], [190], [193], [199], [205], [208], [212], [215], [227], [236], [242], [244], [278], [284], [290], [292], [293], [294], [304], [306], [308], [309], [332], [333], [334], [335], [336], [337], [338], [342], [343], [344], [350], [351], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [386], [387], [388] [2018-11-18 12:52:05,793 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:52:05,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:52:05,833 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 12:52:05,833 INFO L272 AbstractInterpreter]: Visited 82 different actions 96 times. Merged at 8 different actions 8 times. Never widened. Performed 505 root evaluator evaluations with a maximum evaluation depth of 3. Performed 505 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-18 12:52:05,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:05,836 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 12:52:05,913 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 73.4% of their original sizes. [2018-11-18 12:52:05,913 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 12:52:06,093 INFO L415 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2018-11-18 12:52:06,093 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 12:52:06,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 12:52:06,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [3] total 29 [2018-11-18 12:52:06,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:52:06,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 12:52:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 12:52:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-11-18 12:52:06,095 INFO L87 Difference]: Start difference. First operand 407 states and 462 transitions. Second operand 28 states. [2018-11-18 12:52:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:52:09,721 INFO L93 Difference]: Finished difference Result 1410 states and 1724 transitions. [2018-11-18 12:52:09,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 12:52:09,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 98 [2018-11-18 12:52:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:52:09,724 INFO L225 Difference]: With dead ends: 1410 [2018-11-18 12:52:09,725 INFO L226 Difference]: Without dead ends: 930 [2018-11-18 12:52:09,727 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 125 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=623, Invalid=2457, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 12:52:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-18 12:52:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 894. [2018-11-18 12:52:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-18 12:52:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1038 transitions. [2018-11-18 12:52:09,796 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1038 transitions. Word has length 98 [2018-11-18 12:52:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:52:09,796 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1038 transitions. [2018-11-18 12:52:09,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 12:52:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1038 transitions. [2018-11-18 12:52:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 12:52:09,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:52:09,798 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:52:09,798 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 12:52:09,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:52:09,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1603897085, now seen corresponding path program 1 times [2018-11-18 12:52:09,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:52:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:52:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:52:09,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:52:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:52:09,850 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 12:52:09,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:52:09 BoogieIcfgContainer [2018-11-18 12:52:09,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 12:52:09,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:52:09,912 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:52:09,912 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:52:09,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:52:00" (3/4) ... [2018-11-18 12:52:09,916 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:52:09,985 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_237c3dc5-0862-4c67-8c9d-3e5f54dba664/bin-2019/utaipan/witness.graphml [2018-11-18 12:52:09,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:52:09,986 INFO L168 Benchmark]: Toolchain (without parser) took 9811.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 405.8 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -366.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,986 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:52:09,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.71 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:52:09,987 INFO L168 Benchmark]: Boogie Preprocessor took 61.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,987 INFO L168 Benchmark]: RCFGBuilder took 317.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,987 INFO L168 Benchmark]: TraceAbstraction took 9150.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,988 INFO L168 Benchmark]: Witness Printer took 72.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:52:09,989 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.71 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9150.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -222.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Witness Printer took 72.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [\old(E_1)=6, \old(M_E)=11, \old(m_i)=5, \old(m_pc)=9, \old(m_st)=8, \old(T1_E)=3, \old(t1_i)=10, \old(t1_pc)=7, \old(t1_st)=4, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L443] CALL init_model() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L354] m_i = 1 [L355] RET t1_i = 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L443] init_model() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L444] CALL start_simulation() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L387] FCALL update_channels() VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L388] CALL init_threads() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] RET t1_st = 0 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L388] init_threads() VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L389] CALL fire_delta_events() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE, RET !(E_1 == 0) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] fire_delta_events() VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L390] CALL activate_threads() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L102] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [\old(E_1)=2, \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, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] EXPR is_master_triggered() VAL [\old(E_1)=2, \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, E_1=2, is_master_triggered()=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [\old(E_1)=2, \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, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \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, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE, RET !(\read(tmp___0)) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L390] activate_threads() VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L391] CALL reset_delta_events() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE, RET !(E_1 == 1) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] reset_delta_events() VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L394] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, kernel_st=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] [L397] kernel_st = 1 VAL [\old(E_1)=2, \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, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL eval() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L187] int tmp ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \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, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \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, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] RET t1_st = 2 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L221] transmit1() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L191] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [\old(E_1)=2, \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, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] EXPR exists_runnable_thread() VAL [\old(E_1)=2, \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, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L207] CALL master() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L46] CALL immediate_notify() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L312] CALL activate_threads() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L283] int tmp ; [L284] int tmp___0 ; VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L102] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [\old(E_1)=2, \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, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] EXPR is_master_triggered() VAL [\old(E_1)=2, \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, E_1=1, is_master_triggered()=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] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [\old(E_1)=2, \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, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] RET return (__retres1); VAL [\old(E_1)=2, \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, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \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, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] RET t1_st = 0 VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L312] RET activate_threads() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L46] immediate_notify() VAL [\old(E_1)=2, \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, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] RET m_st = 2 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L207] master() VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [\old(E_1)=2, \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, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1] [L221] CALL transmit1() VAL [\old(E_1)=2, \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)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \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)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \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)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L91] CALL error() VAL [\old(E_1)=2, \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)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [\old(E_1)=2, \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)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. UNSAFE Result, 9.0s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2038 SDtfs, 2971 SDslu, 5124 SDs, 0 SdLazy, 2285 SolverSat, 1078 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 321 GetRequests, 176 SyntacticMatches, 17 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=894occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9802230100293916 AbsIntWeakeningRatio, 0.49222797927461137 AbsIntAvgWeakeningVarsNumRemoved, 9.813471502590673 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 285 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 957 ConstructedInterpolants, 0 QuantifiedInterpolants, 119317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 84/90 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...