./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/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_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/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-1dbac8b [2018-11-10 04:06:49,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:06:49,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:06:49,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:06:49,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:06:49,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:06:49,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:06:49,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:06:49,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:06:49,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:06:49,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:06:49,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:06:49,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:06:49,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:06:49,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:06:49,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:06:49,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:06:49,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:06:49,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:06:49,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:06:49,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:06:49,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:06:49,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:06:49,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:06:49,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:06:49,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:06:49,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:06:49,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:06:49,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:06:49,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:06:49,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:06:49,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:06:49,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:06:49,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:06:49,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:06:49,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:06:49,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 04:06:49,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:06:49,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:06:49,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:06:49,688 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:06:49,688 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:06:49,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:06:49,688 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:06:49,688 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:06:49,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:06:49,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:06:49,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:06:49,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:06:49,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:06:49,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:06:49,691 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:06:49,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:06:49,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:06:49,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:06:49,691 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_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/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-10 04:06:49,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:06:49,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:06:49,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:06:49,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:06:49,727 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:06:49,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/../../sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-10 04:06:49,771 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/data/89b67565a/75c3903a1eeb42c3a2a036f85b8ef6f9/FLAG78af8e7a8 [2018-11-10 04:06:50,107 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:06:50,108 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/sv-benchmarks/c/systemc/transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-10 04:06:50,115 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/data/89b67565a/75c3903a1eeb42c3a2a036f85b8ef6f9/FLAG78af8e7a8 [2018-11-10 04:06:50,124 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/data/89b67565a/75c3903a1eeb42c3a2a036f85b8ef6f9 [2018-11-10 04:06:50,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:06:50,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:06:50,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:06:50,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:06:50,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:06:50,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c0ff32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50, skipping insertion in model container [2018-11-10 04:06:50,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:06:50,160 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:06:50,283 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:06:50,287 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:06:50,312 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:06:50,326 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:06:50,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50 WrapperNode [2018-11-10 04:06:50,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:06:50,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:06:50,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:06:50,327 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:06:50,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:06:50,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:06:50,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:06:50,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:06:50,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... [2018-11-10 04:06:50,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:06:50,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:06:50,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:06:50,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:06:50,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/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-10 04:06:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 04:06:50,434 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 04:06:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-10 04:06:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-10 04:06:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 04:06:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 04:06:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 04:06:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 04:06:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-10 04:06:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-10 04:06:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 04:06:50,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 04:06:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 04:06:50,436 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 04:06:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:06:50,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:06:50,436 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 04:06:50,436 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 04:06:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-10 04:06:50,437 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-10 04:06:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:06:50,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:06:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 04:06:50,437 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 04:06:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 04:06:50,437 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 04:06:50,437 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 04:06:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 04:06:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 04:06:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 04:06:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 04:06:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 04:06:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 04:06:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 04:06:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:06:50,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:06:50,438 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-10 04:06:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-10 04:06:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 04:06:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 04:06:50,439 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 04:06:50,439 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 04:06:50,711 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:06:50,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:06:50 BoogieIcfgContainer [2018-11-10 04:06:50,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:06:50,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:06:50,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:06:50,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:06:50,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:06:50" (1/3) ... [2018-11-10 04:06:50,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b7833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:50, skipping insertion in model container [2018-11-10 04:06:50,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:06:50" (2/3) ... [2018-11-10 04:06:50,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b7833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:06:50, skipping insertion in model container [2018-11-10 04:06:50,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:06:50" (3/3) ... [2018-11-10 04:06:50,718 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.01_false-unreach-call_false-termination.cil.c [2018-11-10 04:06:50,725 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:06:50,732 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:06:50,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:06:50,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:06:50,771 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:06:50,771 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:06:50,771 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:06:50,771 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:06:50,771 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:06:50,771 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:06:50,771 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:06:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-11-10 04:06:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:06:50,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:50,796 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-10 04:06:50,798 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:50,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -569774200, now seen corresponding path program 1 times [2018-11-10 04:06:50,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:50,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:51,009 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-10 04:06:51,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:51,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:51,011 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:51,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:51,024 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-11-10 04:06:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:51,335 INFO L93 Difference]: Finished difference Result 297 states and 415 transitions. [2018-11-10 04:06:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:06:51,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-10 04:06:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:51,346 INFO L225 Difference]: With dead ends: 297 [2018-11-10 04:06:51,346 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 04:06:51,349 INFO L605 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-10 04:06:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 04:06:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-10 04:06:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 04:06:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2018-11-10 04:06:51,393 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 77 [2018-11-10 04:06:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:51,394 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2018-11-10 04:06:51,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2018-11-10 04:06:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:06:51,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:51,396 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-10 04:06:51,397 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:51,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -529099450, now seen corresponding path program 1 times [2018-11-10 04:06:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:51,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:51,487 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-10 04:06:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:51,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:51,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:51,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:51,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:51,490 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand 5 states. [2018-11-10 04:06:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:51,749 INFO L93 Difference]: Finished difference Result 276 states and 363 transitions. [2018-11-10 04:06:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:06:51,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-10 04:06:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:51,754 INFO L225 Difference]: With dead ends: 276 [2018-11-10 04:06:51,754 INFO L226 Difference]: Without dead ends: 160 [2018-11-10 04:06:51,755 INFO L605 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-10 04:06:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-10 04:06:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-11-10 04:06:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 04:06:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2018-11-10 04:06:51,769 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 77 [2018-11-10 04:06:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:51,770 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2018-11-10 04:06:51,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2018-11-10 04:06:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:06:51,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:51,772 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-10 04:06:51,772 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:51,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash 857685960, now seen corresponding path program 1 times [2018-11-10 04:06:51,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:51,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:51,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:51,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:51,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:51,864 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-10 04:06:51,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:51,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:51,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:51,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:51,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:51,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:51,865 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 5 states. [2018-11-10 04:06:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:52,044 INFO L93 Difference]: Finished difference Result 292 states and 385 transitions. [2018-11-10 04:06:52,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:06:52,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-10 04:06:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:52,045 INFO L225 Difference]: With dead ends: 292 [2018-11-10 04:06:52,045 INFO L226 Difference]: Without dead ends: 176 [2018-11-10 04:06:52,046 INFO L605 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-10 04:06:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-10 04:06:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 135. [2018-11-10 04:06:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 04:06:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2018-11-10 04:06:52,060 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 77 [2018-11-10 04:06:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:52,060 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2018-11-10 04:06:52,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2018-11-10 04:06:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:06:52,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:52,061 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-10 04:06:52,061 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:52,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1733704966, now seen corresponding path program 1 times [2018-11-10 04:06:52,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:52,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:52,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,063 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:52,121 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-10 04:06:52,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:06:52,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:52,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:06:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:06:52,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:06:52,123 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand 6 states. [2018-11-10 04:06:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:52,147 INFO L93 Difference]: Finished difference Result 260 states and 336 transitions. [2018-11-10 04:06:52,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:06:52,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-10 04:06:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:52,149 INFO L225 Difference]: With dead ends: 260 [2018-11-10 04:06:52,149 INFO L226 Difference]: Without dead ends: 145 [2018-11-10 04:06:52,150 INFO L605 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-10 04:06:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-10 04:06:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-10 04:06:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 04:06:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2018-11-10 04:06:52,166 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 77 [2018-11-10 04:06:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:52,166 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2018-11-10 04:06:52,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:06:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2018-11-10 04:06:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:06:52,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:52,167 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-10 04:06:52,167 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:52,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:52,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2137615608, now seen corresponding path program 1 times [2018-11-10 04:06:52,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:52,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:52,215 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-10 04:06:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:52,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:06:52,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:52,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:06:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:06:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:06:52,216 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 4 states. [2018-11-10 04:06:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:52,349 INFO L93 Difference]: Finished difference Result 370 states and 478 transitions. [2018-11-10 04:06:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:06:52,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-11-10 04:06:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:52,351 INFO L225 Difference]: With dead ends: 370 [2018-11-10 04:06:52,351 INFO L226 Difference]: Without dead ends: 250 [2018-11-10 04:06:52,351 INFO L605 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-10 04:06:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-10 04:06:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-11-10 04:06:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-10 04:06:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 308 transitions. [2018-11-10 04:06:52,370 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 308 transitions. Word has length 77 [2018-11-10 04:06:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:52,370 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 308 transitions. [2018-11-10 04:06:52,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:06:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 308 transitions. [2018-11-10 04:06:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:06:52,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:52,372 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-10 04:06:52,372 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:52,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 752249110, now seen corresponding path program 1 times [2018-11-10 04:06:52,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:52,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:52,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:52,430 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-10 04:06:52,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:52,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:06:52,431 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:52,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:06:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:06:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:06:52,432 INFO L87 Difference]: Start difference. First operand 250 states and 308 transitions. Second operand 6 states. [2018-11-10 04:06:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:52,471 INFO L93 Difference]: Finished difference Result 487 states and 615 transitions. [2018-11-10 04:06:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:06:52,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-10 04:06:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:52,472 INFO L225 Difference]: With dead ends: 487 [2018-11-10 04:06:52,472 INFO L226 Difference]: Without dead ends: 257 [2018-11-10 04:06:52,473 INFO L605 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-10 04:06:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-10 04:06:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-11-10 04:06:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-10 04:06:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-11-10 04:06:52,489 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 97 [2018-11-10 04:06:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:52,489 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-11-10 04:06:52,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:06:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-11-10 04:06:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:06:52,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:52,491 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-10 04:06:52,491 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:52,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2004378156, now seen corresponding path program 1 times [2018-11-10 04:06:52,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:52,552 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-10 04:06:52,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:52,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:52,552 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:52,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:52,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:52,553 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 5 states. [2018-11-10 04:06:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:52,774 INFO L93 Difference]: Finished difference Result 614 states and 786 transitions. [2018-11-10 04:06:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:06:52,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-10 04:06:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:52,776 INFO L225 Difference]: With dead ends: 614 [2018-11-10 04:06:52,777 INFO L226 Difference]: Without dead ends: 379 [2018-11-10 04:06:52,777 INFO L605 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-10 04:06:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-10 04:06:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2018-11-10 04:06:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 04:06:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 384 transitions. [2018-11-10 04:06:52,798 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 384 transitions. Word has length 97 [2018-11-10 04:06:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:52,798 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 384 transitions. [2018-11-10 04:06:52,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 384 transitions. [2018-11-10 04:06:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:06:52,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:52,799 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-10 04:06:52,799 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:52,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -65216110, now seen corresponding path program 1 times [2018-11-10 04:06:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:52,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:52,801 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:52,858 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-10 04:06:52,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:52,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:52,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:52,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:52,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:52,859 INFO L87 Difference]: Start difference. First operand 317 states and 384 transitions. Second operand 5 states. [2018-11-10 04:06:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:53,023 INFO L93 Difference]: Finished difference Result 613 states and 750 transitions. [2018-11-10 04:06:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:06:53,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-10 04:06:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:53,025 INFO L225 Difference]: With dead ends: 613 [2018-11-10 04:06:53,025 INFO L226 Difference]: Without dead ends: 317 [2018-11-10 04:06:53,026 INFO L605 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-10 04:06:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-10 04:06:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-10 04:06:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 04:06:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 378 transitions. [2018-11-10 04:06:53,041 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 378 transitions. Word has length 97 [2018-11-10 04:06:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:53,041 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 378 transitions. [2018-11-10 04:06:53,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 378 transitions. [2018-11-10 04:06:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:06:53,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:53,043 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-10 04:06:53,043 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:53,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -418304492, now seen corresponding path program 1 times [2018-11-10 04:06:53,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:53,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:53,046 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:53,101 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-10 04:06:53,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:06:53,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:06:53,102 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:53,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:06:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:06:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:06:53,103 INFO L87 Difference]: Start difference. First operand 317 states and 378 transitions. Second operand 5 states. [2018-11-10 04:06:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:53,312 INFO L93 Difference]: Finished difference Result 726 states and 919 transitions. [2018-11-10 04:06:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:06:53,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-11-10 04:06:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:53,314 INFO L225 Difference]: With dead ends: 726 [2018-11-10 04:06:53,315 INFO L226 Difference]: Without dead ends: 430 [2018-11-10 04:06:53,315 INFO L605 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-10 04:06:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-10 04:06:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 351. [2018-11-10 04:06:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-10 04:06:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2018-11-10 04:06:53,336 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 97 [2018-11-10 04:06:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:53,337 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2018-11-10 04:06:53,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:06:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2018-11-10 04:06:53,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:06:53,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:53,338 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-10 04:06:53,338 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:53,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1509968210, now seen corresponding path program 1 times [2018-11-10 04:06:53,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:53,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:53,361 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-10 04:06:53,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:06:53,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:06:53,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-10 04:06:53,364 INFO L202 CegarAbsIntRunner]: [4], [6], [9], [15], [21], [23], [29], [30], [32], [37], [40], [45], [47], [48], [51], [60], [61], [62], [72], [74], [76], [77], [82], [88], [94], [96], [99], [105], [109], [110], [115], [162], [163], [166], [170], [176], [179], [182], [197], [201], [204], [227], [232], [238], [244], [246], [247], [256], [262], [264], [297], [307], [309], [311], [312], [332], [333], [336], [338], [339], [340], [341], [342], [343], [344], [348], [349], [352], [353], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [386], [387], [388] [2018-11-10 04:06:53,398 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:06:53,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:06:53,775 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:06:53,776 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Never found a fixpoint. Largest state had 22 variables. [2018-11-10 04:06:53,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:53,791 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:06:54,167 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 70.61% of their original sizes. [2018-11-10 04:06:54,167 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:06:54,850 INFO L415 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2018-11-10 04:06:54,850 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:06:54,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:06:54,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [3] total 23 [2018-11-10 04:06:54,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:06:54,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 04:06:54,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 04:06:54,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-10 04:06:54,852 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand 22 states. [2018-11-10 04:06:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:06:59,321 INFO L93 Difference]: Finished difference Result 753 states and 879 transitions. [2018-11-10 04:06:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 04:06:59,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 97 [2018-11-10 04:06:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:06:59,324 INFO L225 Difference]: With dead ends: 753 [2018-11-10 04:06:59,324 INFO L226 Difference]: Without dead ends: 417 [2018-11-10 04:06:59,325 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 04:06:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-10 04:06:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 407. [2018-11-10 04:06:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-10 04:06:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 462 transitions. [2018-11-10 04:06:59,377 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 462 transitions. Word has length 97 [2018-11-10 04:06:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:06:59,378 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 462 transitions. [2018-11-10 04:06:59,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 04:06:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 462 transitions. [2018-11-10 04:06:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 04:06:59,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:06:59,379 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-10 04:06:59,379 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:06:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:59,380 INFO L82 PathProgramCache]: Analyzing trace with hash -493237241, now seen corresponding path program 1 times [2018-11-10 04:06:59,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:06:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:59,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:06:59,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:06:59,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:06:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:06:59,420 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-10 04:06:59,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:06:59,420 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:06:59,420 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2018-11-10 04:06:59,421 INFO L202 CegarAbsIntRunner]: [4], [6], [9], [15], [21], [23], [29], [30], [32], [37], [40], [45], [47], [48], [51], [60], [61], [62], [72], [74], [76], [77], [82], [88], [94], [96], [99], [105], [109], [110], [115], [162], [163], [166], [170], [176], [179], [182], [188], [194], [197], [201], [204], [227], [232], [238], [244], [246], [247], [256], [262], [264], [297], [307], [309], [311], [312], [332], [333], [336], [338], [339], [340], [341], [342], [343], [344], [348], [349], [352], [353], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [386], [387], [388] [2018-11-10 04:06:59,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:06:59,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:06:59,792 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 04:06:59,792 INFO L272 AbstractInterpreter]: Visited 82 different actions 96 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 04:06:59,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:06:59,808 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 04:07:00,392 INFO L227 lantSequenceWeakener]: Weakened 94 states. On average, predicates are now at 73.55% of their original sizes. [2018-11-10 04:07:00,392 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 04:07:01,384 INFO L415 sIntCurrentIteration]: We unified 97 AI predicates to 97 [2018-11-10 04:07:01,384 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 04:07:01,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:07:01,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [3] total 32 [2018-11-10 04:07:01,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:07:01,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-10 04:07:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-10 04:07:01,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-11-10 04:07:01,386 INFO L87 Difference]: Start difference. First operand 407 states and 462 transitions. Second operand 31 states. [2018-11-10 04:07:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:07:12,723 INFO L93 Difference]: Finished difference Result 1467 states and 1828 transitions. [2018-11-10 04:07:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-10 04:07:12,723 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 98 [2018-11-10 04:07:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:07:12,726 INFO L225 Difference]: With dead ends: 1467 [2018-11-10 04:07:12,726 INFO L226 Difference]: Without dead ends: 964 [2018-11-10 04:07:12,728 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=897, Invalid=4653, Unknown=0, NotChecked=0, Total=5550 [2018-11-10 04:07:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-10 04:07:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 901. [2018-11-10 04:07:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-11-10 04:07:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1048 transitions. [2018-11-10 04:07:12,798 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1048 transitions. Word has length 98 [2018-11-10 04:07:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:07:12,798 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1048 transitions. [2018-11-10 04:07:12,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-10 04:07:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1048 transitions. [2018-11-10 04:07:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 04:07:12,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:07:12,800 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-10 04:07:12,800 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:07:12,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:07:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1384335282, now seen corresponding path program 1 times [2018-11-10 04:07:12,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:07:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:12,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:07:12,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:07:12,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:07:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:07:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:07:12,841 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:07:12,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:07:12 BoogieIcfgContainer [2018-11-10 04:07:12,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:07:12,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:07:12,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:07:12,899 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:07:12,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:06:50" (3/4) ... [2018-11-10 04:07:12,902 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:07:12,962 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c9b5493a-c203-49c7-b8f1-1f942a3ace7a/bin-2019/utaipan/witness.graphml [2018-11-10 04:07:12,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:07:12,963 INFO L168 Benchmark]: Toolchain (without parser) took 22836.30 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 699.4 MB). Free memory was 960.3 MB in the beginning and 890.8 MB in the end (delta: 69.5 MB). Peak memory consumption was 768.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,964 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:07:12,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,965 INFO L168 Benchmark]: Boogie Preprocessor took 57.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,965 INFO L168 Benchmark]: RCFGBuilder took 314.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,965 INFO L168 Benchmark]: TraceAbstraction took 22186.31 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 557.8 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 217.7 MB). Peak memory consumption was 775.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:07:12,965 INFO L168 Benchmark]: Witness Printer took 63.37 ms. Allocated memory is still 1.7 GB. Free memory was 890.8 MB in the beginning and 890.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 04:07:12,967 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.51 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.78 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -197.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 314.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22186.31 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 557.8 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 217.7 MB). Peak memory consumption was 775.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.37 ms. Allocated memory is still 1.7 GB. Free memory was 890.8 MB in the beginning and 890.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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, 22.1s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2039 SDtfs, 3002 SDslu, 5464 SDs, 0 SdLazy, 2606 SolverSat, 1118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 337 GetRequests, 166 SyntacticMatches, 24 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9768129304262381 AbsIntWeakeningRatio, 0.49222797927461137 AbsIntAvgWeakeningVarsNumRemoved, 474.1139896373057 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 312 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...