./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/kundu2_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_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2559ce56d5bdfaeec5255956226223494fe099f5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:22:39,059 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:22:39,060 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:22:39,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:22:39,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:22:39,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:22:39,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:22:39,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:22:39,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:22:39,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:22:39,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:22:39,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:22:39,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:22:39,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:22:39,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:22:39,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:22:39,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:22:39,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:22:39,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:22:39,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:22:39,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:22:39,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:22:39,084 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:22:39,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:22:39,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:22:39,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:22:39,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:22:39,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:22:39,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:22:39,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:22:39,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:22:39,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:22:39,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:22:39,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:22:39,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:22:39,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:22:39,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 02:22:39,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:22:39,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:22:39,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 02:22:39,098 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 02:22:39,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:22:39,099 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:22:39,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 02:22:39,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:22:39,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 02:22:39,101 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 02:22:39,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 02:22:39,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer 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 -> Automizer 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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2018-11-10 02:22:39,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:22:39,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:22:39,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:22:39,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:22:39,136 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:22:39,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 02:22:39,174 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/data/8ed498acf/eac7847c58664daa9b72460c4bc3a9e0/FLAGbcb27cd26 [2018-11-10 02:22:39,594 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:22:39,595 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 02:22:39,600 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/data/8ed498acf/eac7847c58664daa9b72460c4bc3a9e0/FLAGbcb27cd26 [2018-11-10 02:22:39,611 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/data/8ed498acf/eac7847c58664daa9b72460c4bc3a9e0 [2018-11-10 02:22:39,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:22:39,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 02:22:39,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:22:39,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:22:39,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:22:39,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769b41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39, skipping insertion in model container [2018-11-10 02:22:39,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:22:39,650 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:22:39,790 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:22:39,793 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:22:39,818 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:22:39,828 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:22:39,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39 WrapperNode [2018-11-10 02:22:39,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:22:39,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:22:39,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:22:39,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:22:39,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... [2018-11-10 02:22:39,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:22:39,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:22:39,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:22:39,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:22:39,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/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 02:22:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 02:22:39,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2018-11-10 02:22:39,955 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 02:22:39,956 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 02:22:39,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 02:22:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 02:22:39,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 02:22:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 02:22:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 02:22:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 02:22:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 02:22:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 02:22:39,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:22:40,369 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:22:40,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:22:40 BoogieIcfgContainer [2018-11-10 02:22:40,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:22:40,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 02:22:40,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 02:22:40,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 02:22:40,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:22:39" (1/3) ... [2018-11-10 02:22:40,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314821a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:22:40, skipping insertion in model container [2018-11-10 02:22:40,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:22:39" (2/3) ... [2018-11-10 02:22:40,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314821a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:22:40, skipping insertion in model container [2018-11-10 02:22:40,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:22:40" (3/3) ... [2018-11-10 02:22:40,376 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-11-10 02:22:40,385 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 02:22:40,392 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 02:22:40,407 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 02:22:40,436 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:22:40,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 02:22:40,437 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 02:22:40,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 02:22:40,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:22:40,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:22:40,437 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 02:22:40,437 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:22:40,437 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 02:22:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2018-11-10 02:22:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 02:22:40,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:40,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:40,468 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:40,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1543453838, now seen corresponding path program 1 times [2018-11-10 02:22:40,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:40,725 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 02:22:40,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:40,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:22:40,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:22:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:22:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:22:40,744 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 4 states. [2018-11-10 02:22:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:41,028 INFO L93 Difference]: Finished difference Result 502 states and 705 transitions. [2018-11-10 02:22:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:22:41,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-10 02:22:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:41,043 INFO L225 Difference]: With dead ends: 502 [2018-11-10 02:22:41,043 INFO L226 Difference]: Without dead ends: 323 [2018-11-10 02:22:41,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:22:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-10 02:22:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 308. [2018-11-10 02:22:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-10 02:22:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2018-11-10 02:22:41,115 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 85 [2018-11-10 02:22:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:41,115 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2018-11-10 02:22:41,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:22:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2018-11-10 02:22:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:22:41,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:41,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:41,119 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:41,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash -497912226, now seen corresponding path program 1 times [2018-11-10 02:22:41,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:41,233 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 02:22:41,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:41,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:22:41,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:22:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:22:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:22:41,236 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand 4 states. [2018-11-10 02:22:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:41,461 INFO L93 Difference]: Finished difference Result 747 states and 993 transitions. [2018-11-10 02:22:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:22:41,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-10 02:22:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:41,465 INFO L225 Difference]: With dead ends: 747 [2018-11-10 02:22:41,465 INFO L226 Difference]: Without dead ends: 460 [2018-11-10 02:22:41,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:22:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-11-10 02:22:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 444. [2018-11-10 02:22:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-10 02:22:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 574 transitions. [2018-11-10 02:22:41,502 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 574 transitions. Word has length 86 [2018-11-10 02:22:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:41,502 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 574 transitions. [2018-11-10 02:22:41,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:22:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 574 transitions. [2018-11-10 02:22:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:22:41,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:41,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:41,505 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:41,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1454840609, now seen corresponding path program 1 times [2018-11-10 02:22:41,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:41,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:41,615 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 02:22:41,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:41,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:22:41,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:22:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:22:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:22:41,617 INFO L87 Difference]: Start difference. First operand 444 states and 574 transitions. Second operand 6 states. [2018-11-10 02:22:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:41,671 INFO L93 Difference]: Finished difference Result 906 states and 1205 transitions. [2018-11-10 02:22:41,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:22:41,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-10 02:22:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:41,675 INFO L225 Difference]: With dead ends: 906 [2018-11-10 02:22:41,676 INFO L226 Difference]: Without dead ends: 483 [2018-11-10 02:22:41,677 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 02:22:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-10 02:22:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2018-11-10 02:22:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-11-10 02:22:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 589 transitions. [2018-11-10 02:22:41,712 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 589 transitions. Word has length 86 [2018-11-10 02:22:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:41,713 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 589 transitions. [2018-11-10 02:22:41,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:22:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 589 transitions. [2018-11-10 02:22:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:22:41,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:41,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:41,715 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:41,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash 83499421, now seen corresponding path program 1 times [2018-11-10 02:22:41,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:41,830 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 02:22:41,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:41,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:22:41,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:22:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:22:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:22:41,832 INFO L87 Difference]: Start difference. First operand 459 states and 589 transitions. Second operand 6 states. [2018-11-10 02:22:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:41,874 INFO L93 Difference]: Finished difference Result 927 states and 1220 transitions. [2018-11-10 02:22:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:22:41,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-10 02:22:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:41,877 INFO L225 Difference]: With dead ends: 927 [2018-11-10 02:22:41,877 INFO L226 Difference]: Without dead ends: 489 [2018-11-10 02:22:41,878 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 02:22:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-11-10 02:22:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 474. [2018-11-10 02:22:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 02:22:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 604 transitions. [2018-11-10 02:22:41,898 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 604 transitions. Word has length 86 [2018-11-10 02:22:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:41,898 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 604 transitions. [2018-11-10 02:22:41,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:22:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 604 transitions. [2018-11-10 02:22:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:22:41,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:41,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:41,900 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:41,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash -813893857, now seen corresponding path program 1 times [2018-11-10 02:22:41,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:41,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:41,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:41,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:41,974 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 02:22:41,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:41,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:22:41,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:22:41,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:22:41,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:22:41,976 INFO L87 Difference]: Start difference. First operand 474 states and 604 transitions. Second operand 6 states. [2018-11-10 02:22:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:42,013 INFO L93 Difference]: Finished difference Result 941 states and 1224 transitions. [2018-11-10 02:22:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:22:42,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-10 02:22:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:42,017 INFO L225 Difference]: With dead ends: 941 [2018-11-10 02:22:42,017 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 02:22:42,018 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 02:22:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 02:22:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 484. [2018-11-10 02:22:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-11-10 02:22:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 613 transitions. [2018-11-10 02:22:42,035 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 613 transitions. Word has length 86 [2018-11-10 02:22:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:42,036 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 613 transitions. [2018-11-10 02:22:42,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:22:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 613 transitions. [2018-11-10 02:22:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 02:22:42,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:42,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:42,037 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:42,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -886280415, now seen corresponding path program 1 times [2018-11-10 02:22:42,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:42,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:42,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:42,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:42,110 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 02:22:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:22:42,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:22:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:22:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:22:42,111 INFO L87 Difference]: Start difference. First operand 484 states and 613 transitions. Second operand 6 states. [2018-11-10 02:22:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:42,186 INFO L93 Difference]: Finished difference Result 1230 states and 1588 transitions. [2018-11-10 02:22:42,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:22:42,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2018-11-10 02:22:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:42,190 INFO L225 Difference]: With dead ends: 1230 [2018-11-10 02:22:42,190 INFO L226 Difference]: Without dead ends: 768 [2018-11-10 02:22:42,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:22:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-11-10 02:22:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 753. [2018-11-10 02:22:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-10 02:22:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 962 transitions. [2018-11-10 02:22:42,216 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 962 transitions. Word has length 86 [2018-11-10 02:22:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:42,216 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 962 transitions. [2018-11-10 02:22:42,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:22:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 962 transitions. [2018-11-10 02:22:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 02:22:42,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:42,217 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:42,218 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:42,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1427334616, now seen corresponding path program 1 times [2018-11-10 02:22:42,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:42,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:22:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 02:22:42,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:22:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:22:42,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:22:42,327 INFO L87 Difference]: Start difference. First operand 753 states and 962 transitions. Second operand 8 states. [2018-11-10 02:22:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:43,201 INFO L93 Difference]: Finished difference Result 2227 states and 3068 transitions. [2018-11-10 02:22:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:22:43,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-11-10 02:22:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:43,207 INFO L225 Difference]: With dead ends: 2227 [2018-11-10 02:22:43,207 INFO L226 Difference]: Without dead ends: 1633 [2018-11-10 02:22:43,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:22:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-11-10 02:22:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1566. [2018-11-10 02:22:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-11-10 02:22:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2131 transitions. [2018-11-10 02:22:43,268 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2131 transitions. Word has length 100 [2018-11-10 02:22:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:43,268 INFO L481 AbstractCegarLoop]: Abstraction has 1566 states and 2131 transitions. [2018-11-10 02:22:43,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:22:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2131 transitions. [2018-11-10 02:22:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 02:22:43,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:43,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:22:43,270 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:43,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1794198785, now seen corresponding path program 1 times [2018-11-10 02:22:43,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:43,368 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 02:22:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:43,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 02:22:43,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:22:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:22:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:22:43,369 INFO L87 Difference]: Start difference. First operand 1566 states and 2131 transitions. Second operand 8 states. [2018-11-10 02:22:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:44,514 INFO L93 Difference]: Finished difference Result 2786 states and 3969 transitions. [2018-11-10 02:22:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 02:22:44,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-10 02:22:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:44,521 INFO L225 Difference]: With dead ends: 2786 [2018-11-10 02:22:44,521 INFO L226 Difference]: Without dead ends: 1726 [2018-11-10 02:22:44,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:22:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-11-10 02:22:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1613. [2018-11-10 02:22:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-11-10 02:22:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2229 transitions. [2018-11-10 02:22:44,584 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2229 transitions. Word has length 105 [2018-11-10 02:22:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:44,585 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 2229 transitions. [2018-11-10 02:22:44,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:22:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2229 transitions. [2018-11-10 02:22:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 02:22:44,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:44,586 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:44,587 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:44,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1612231203, now seen corresponding path program 1 times [2018-11-10 02:22:44,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:22:44,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:22:44,626 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:22:44,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:44,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:22:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:22:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:22:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-10 02:22:44,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:22:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:22:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:22:44,731 INFO L87 Difference]: Start difference. First operand 1613 states and 2229 transitions. Second operand 3 states. [2018-11-10 02:22:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:44,851 INFO L93 Difference]: Finished difference Result 4646 states and 6907 transitions. [2018-11-10 02:22:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:22:44,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 02:22:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:44,862 INFO L225 Difference]: With dead ends: 4646 [2018-11-10 02:22:44,862 INFO L226 Difference]: Without dead ends: 3055 [2018-11-10 02:22:44,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:22:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2018-11-10 02:22:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3050. [2018-11-10 02:22:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2018-11-10 02:22:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4431 transitions. [2018-11-10 02:22:44,993 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4431 transitions. Word has length 108 [2018-11-10 02:22:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:44,993 INFO L481 AbstractCegarLoop]: Abstraction has 3050 states and 4431 transitions. [2018-11-10 02:22:44,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:22:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4431 transitions. [2018-11-10 02:22:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 02:22:44,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:44,996 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:44,996 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:44,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1142655188, now seen corresponding path program 1 times [2018-11-10 02:22:44,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:44,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:44,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 02:22:45,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:45,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:22:45,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:22:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:22:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:22:45,043 INFO L87 Difference]: Start difference. First operand 3050 states and 4431 transitions. Second operand 4 states. [2018-11-10 02:22:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:45,223 INFO L93 Difference]: Finished difference Result 6072 states and 8822 transitions. [2018-11-10 02:22:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:22:45,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 02:22:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:45,235 INFO L225 Difference]: With dead ends: 6072 [2018-11-10 02:22:45,235 INFO L226 Difference]: Without dead ends: 3043 [2018-11-10 02:22:45,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 02:22:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2018-11-10 02:22:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3043. [2018-11-10 02:22:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-11-10 02:22:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4417 transitions. [2018-11-10 02:22:45,360 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4417 transitions. Word has length 110 [2018-11-10 02:22:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:45,360 INFO L481 AbstractCegarLoop]: Abstraction has 3043 states and 4417 transitions. [2018-11-10 02:22:45,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:22:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4417 transitions. [2018-11-10 02:22:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 02:22:45,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:45,363 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:45,363 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:45,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 709121419, now seen corresponding path program 1 times [2018-11-10 02:22:45,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:45,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:22:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:22:45,435 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:22:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:45,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:22:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:22:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:22:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-10 02:22:45,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:22:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:22:45,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:22:45,538 INFO L87 Difference]: Start difference. First operand 3043 states and 4417 transitions. Second operand 8 states. [2018-11-10 02:22:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:48,059 INFO L93 Difference]: Finished difference Result 14365 states and 26690 transitions. [2018-11-10 02:22:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 02:22:48,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-11-10 02:22:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:48,115 INFO L225 Difference]: With dead ends: 14365 [2018-11-10 02:22:48,115 INFO L226 Difference]: Without dead ends: 11344 [2018-11-10 02:22:48,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2018-11-10 02:22:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11344 states. [2018-11-10 02:22:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11344 to 10336. [2018-11-10 02:22:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10336 states. [2018-11-10 02:22:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10336 states to 10336 states and 16484 transitions. [2018-11-10 02:22:48,764 INFO L78 Accepts]: Start accepts. Automaton has 10336 states and 16484 transitions. Word has length 110 [2018-11-10 02:22:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:48,764 INFO L481 AbstractCegarLoop]: Abstraction has 10336 states and 16484 transitions. [2018-11-10 02:22:48,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:22:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10336 states and 16484 transitions. [2018-11-10 02:22:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 02:22:48,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:48,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:22:48,769 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:48,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1749355622, now seen corresponding path program 1 times [2018-11-10 02:22:48,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:48,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 02:22:48,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:48,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:22:48,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 02:22:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:22:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:22:48,840 INFO L87 Difference]: Start difference. First operand 10336 states and 16484 transitions. Second operand 7 states. [2018-11-10 02:22:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:49,630 INFO L93 Difference]: Finished difference Result 22530 states and 38517 transitions. [2018-11-10 02:22:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:22:49,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2018-11-10 02:22:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:49,701 INFO L225 Difference]: With dead ends: 22530 [2018-11-10 02:22:49,701 INFO L226 Difference]: Without dead ends: 14438 [2018-11-10 02:22:49,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:22:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14438 states. [2018-11-10 02:22:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14438 to 14138. [2018-11-10 02:22:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14138 states. [2018-11-10 02:22:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 21709 transitions. [2018-11-10 02:22:50,420 INFO L78 Accepts]: Start accepts. Automaton has 14138 states and 21709 transitions. Word has length 117 [2018-11-10 02:22:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:50,420 INFO L481 AbstractCegarLoop]: Abstraction has 14138 states and 21709 transitions. [2018-11-10 02:22:50,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 02:22:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14138 states and 21709 transitions. [2018-11-10 02:22:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 02:22:50,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:50,426 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:22:50,426 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:50,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash 996074321, now seen corresponding path program 1 times [2018-11-10 02:22:50,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:50,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:50,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:50,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 02:22:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 02:22:50,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:22:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:22:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:22:50,522 INFO L87 Difference]: Start difference. First operand 14138 states and 21709 transitions. Second operand 8 states. [2018-11-10 02:22:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:51,448 INFO L93 Difference]: Finished difference Result 27999 states and 45115 transitions. [2018-11-10 02:22:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:22:51,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-11-10 02:22:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:51,505 INFO L225 Difference]: With dead ends: 27999 [2018-11-10 02:22:51,505 INFO L226 Difference]: Without dead ends: 16564 [2018-11-10 02:22:51,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-10 02:22:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16564 states. [2018-11-10 02:22:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16564 to 16353. [2018-11-10 02:22:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16353 states. [2018-11-10 02:22:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16353 states to 16353 states and 25813 transitions. [2018-11-10 02:22:52,145 INFO L78 Accepts]: Start accepts. Automaton has 16353 states and 25813 transitions. Word has length 121 [2018-11-10 02:22:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:52,145 INFO L481 AbstractCegarLoop]: Abstraction has 16353 states and 25813 transitions. [2018-11-10 02:22:52,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:22:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16353 states and 25813 transitions. [2018-11-10 02:22:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 02:22:52,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:52,150 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:52,151 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:52,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash 983882708, now seen corresponding path program 1 times [2018-11-10 02:22:52,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:52,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:52,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:52,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:22:52,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:22:52,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:22:52,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:52,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:22:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 02:22:52,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:22:52,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-10 02:22:52,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:22:52,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:22:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:22:52,331 INFO L87 Difference]: Start difference. First operand 16353 states and 25813 transitions. Second operand 9 states. [2018-11-10 02:22:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:22:56,093 INFO L93 Difference]: Finished difference Result 50403 states and 122584 transitions. [2018-11-10 02:22:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 02:22:56,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-11-10 02:22:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:22:56,348 INFO L225 Difference]: With dead ends: 50403 [2018-11-10 02:22:56,348 INFO L226 Difference]: Without dead ends: 34077 [2018-11-10 02:22:56,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-11-10 02:22:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34077 states. [2018-11-10 02:22:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34077 to 32830. [2018-11-10 02:22:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32830 states. [2018-11-10 02:22:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32830 states to 32830 states and 76883 transitions. [2018-11-10 02:22:58,794 INFO L78 Accepts]: Start accepts. Automaton has 32830 states and 76883 transitions. Word has length 127 [2018-11-10 02:22:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:22:58,795 INFO L481 AbstractCegarLoop]: Abstraction has 32830 states and 76883 transitions. [2018-11-10 02:22:58,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:22:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32830 states and 76883 transitions. [2018-11-10 02:22:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 02:22:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:22:58,807 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:22:58,808 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:22:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:22:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1054762615, now seen corresponding path program 1 times [2018-11-10 02:22:58,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:22:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:22:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:22:58,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:22:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:22:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:22:58,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:22:58,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 02:22:58,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:22:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:22:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:22:58,891 INFO L87 Difference]: Start difference. First operand 32830 states and 76883 transitions. Second operand 8 states. [2018-11-10 02:23:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:06,297 INFO L93 Difference]: Finished difference Result 121562 states and 411318 transitions. [2018-11-10 02:23:06,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 02:23:06,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2018-11-10 02:23:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:06,836 INFO L225 Difference]: With dead ends: 121562 [2018-11-10 02:23:06,837 INFO L226 Difference]: Without dead ends: 85798 [2018-11-10 02:23:07,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-10 02:23:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85798 states. [2018-11-10 02:23:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85798 to 83493. [2018-11-10 02:23:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83493 states. [2018-11-10 02:23:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83493 states to 83493 states and 249426 transitions. [2018-11-10 02:23:16,116 INFO L78 Accepts]: Start accepts. Automaton has 83493 states and 249426 transitions. Word has length 130 [2018-11-10 02:23:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:16,117 INFO L481 AbstractCegarLoop]: Abstraction has 83493 states and 249426 transitions. [2018-11-10 02:23:16,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:23:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 83493 states and 249426 transitions. [2018-11-10 02:23:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 02:23:16,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:16,133 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:23:16,134 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:16,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1136720061, now seen corresponding path program 1 times [2018-11-10 02:23:16,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:23:16,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:23:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:16,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 02:23:16,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:23:16,211 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:23:16,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:16,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:23:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:23:16,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:23:16,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-10 02:23:16,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:23:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:23:16,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:23:16,365 INFO L87 Difference]: Start difference. First operand 83493 states and 249426 transitions. Second operand 8 states. [2018-11-10 02:23:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:28,268 INFO L93 Difference]: Finished difference Result 219343 states and 897718 transitions. [2018-11-10 02:23:28,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 02:23:28,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2018-11-10 02:23:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:29,257 INFO L225 Difference]: With dead ends: 219343 [2018-11-10 02:23:29,257 INFO L226 Difference]: Without dead ends: 135879 [2018-11-10 02:23:37,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-10 02:23:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135879 states. [2018-11-10 02:23:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135879 to 124861. [2018-11-10 02:23:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124861 states. [2018-11-10 02:23:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124861 states to 124861 states and 201132 transitions. [2018-11-10 02:23:43,910 INFO L78 Accepts]: Start accepts. Automaton has 124861 states and 201132 transitions. Word has length 130 [2018-11-10 02:23:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:43,911 INFO L481 AbstractCegarLoop]: Abstraction has 124861 states and 201132 transitions. [2018-11-10 02:23:43,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:23:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 124861 states and 201132 transitions. [2018-11-10 02:23:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 02:23:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:43,938 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:23:43,939 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:43,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash -102693778, now seen corresponding path program 1 times [2018-11-10 02:23:43,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:23:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:23:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:43,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 02:23:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:23:43,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:23:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:23:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:23:43,999 INFO L87 Difference]: Start difference. First operand 124861 states and 201132 transitions. Second operand 4 states. [2018-11-10 02:23:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:23:50,570 INFO L93 Difference]: Finished difference Result 249684 states and 402209 transitions. [2018-11-10 02:23:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:23:50,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-10 02:23:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:23:51,212 INFO L225 Difference]: With dead ends: 249684 [2018-11-10 02:23:51,213 INFO L226 Difference]: Without dead ends: 124850 [2018-11-10 02:23:51,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 02:23:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124850 states. [2018-11-10 02:23:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124850 to 124850. [2018-11-10 02:23:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124850 states. [2018-11-10 02:23:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124850 states to 124850 states and 201109 transitions. [2018-11-10 02:23:58,075 INFO L78 Accepts]: Start accepts. Automaton has 124850 states and 201109 transitions. Word has length 134 [2018-11-10 02:23:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:23:58,076 INFO L481 AbstractCegarLoop]: Abstraction has 124850 states and 201109 transitions. [2018-11-10 02:23:58,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:23:58,076 INFO L276 IsEmpty]: Start isEmpty. Operand 124850 states and 201109 transitions. [2018-11-10 02:23:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 02:23:58,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:23:58,089 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:23:58,089 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:23:58,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:23:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2112282159, now seen corresponding path program 1 times [2018-11-10 02:23:58,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:23:58,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:23:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:58,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:23:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:23:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:23:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 02:23:58,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:23:58,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:23:58,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:23:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:23:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:23:58,166 INFO L87 Difference]: Start difference. First operand 124850 states and 201109 transitions. Second operand 6 states. [2018-11-10 02:24:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:07,452 INFO L93 Difference]: Finished difference Result 289919 states and 439419 transitions. [2018-11-10 02:24:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:24:07,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2018-11-10 02:24:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:24:08,059 INFO L225 Difference]: With dead ends: 289919 [2018-11-10 02:24:08,059 INFO L226 Difference]: Without dead ends: 165096 [2018-11-10 02:24:08,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-10 02:24:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165096 states. [2018-11-10 02:24:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165096 to 155101. [2018-11-10 02:24:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155101 states. [2018-11-10 02:24:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155101 states to 155101 states and 209257 transitions. [2018-11-10 02:24:14,661 INFO L78 Accepts]: Start accepts. Automaton has 155101 states and 209257 transitions. Word has length 134 [2018-11-10 02:24:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:24:14,661 INFO L481 AbstractCegarLoop]: Abstraction has 155101 states and 209257 transitions. [2018-11-10 02:24:14,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:24:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 155101 states and 209257 transitions. [2018-11-10 02:24:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 02:24:14,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:24:14,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:14,669 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:24:14,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1156660373, now seen corresponding path program 1 times [2018-11-10 02:24:14,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:14,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:14,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 02:24:14,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:14,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 02:24:14,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 02:24:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 02:24:14,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 02:24:14,789 INFO L87 Difference]: Start difference. First operand 155101 states and 209257 transitions. Second operand 9 states. [2018-11-10 02:24:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:20,831 INFO L93 Difference]: Finished difference Result 288684 states and 396502 transitions. [2018-11-10 02:24:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:24:20,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-11-10 02:24:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:24:21,364 INFO L225 Difference]: With dead ends: 288684 [2018-11-10 02:24:21,364 INFO L226 Difference]: Without dead ends: 174699 [2018-11-10 02:24:21,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:24:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174699 states. [2018-11-10 02:24:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174699 to 174056. [2018-11-10 02:24:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174056 states. [2018-11-10 02:24:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174056 states to 174056 states and 236606 transitions. [2018-11-10 02:24:28,000 INFO L78 Accepts]: Start accepts. Automaton has 174056 states and 236606 transitions. Word has length 133 [2018-11-10 02:24:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:24:28,001 INFO L481 AbstractCegarLoop]: Abstraction has 174056 states and 236606 transitions. [2018-11-10 02:24:28,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 02:24:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 174056 states and 236606 transitions. [2018-11-10 02:24:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 02:24:28,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:24:28,016 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 02:24:28,016 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:24:28,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash 845977, now seen corresponding path program 1 times [2018-11-10 02:24:28,016 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:28,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:28,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 02:24:28,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:28,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:24:28,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:24:28,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:24:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:24:28,100 INFO L87 Difference]: Start difference. First operand 174056 states and 236606 transitions. Second operand 4 states. [2018-11-10 02:24:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:37,596 INFO L93 Difference]: Finished difference Result 369361 states and 502177 transitions. [2018-11-10 02:24:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:24:37,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-11-10 02:24:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:24:38,132 INFO L225 Difference]: With dead ends: 369361 [2018-11-10 02:24:38,132 INFO L226 Difference]: Without dead ends: 195334 [2018-11-10 02:24:38,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 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 02:24:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195334 states. [2018-11-10 02:24:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195334 to 187817. [2018-11-10 02:24:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187817 states. [2018-11-10 02:24:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187817 states to 187817 states and 238847 transitions. [2018-11-10 02:24:45,256 INFO L78 Accepts]: Start accepts. Automaton has 187817 states and 238847 transitions. Word has length 164 [2018-11-10 02:24:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:24:45,256 INFO L481 AbstractCegarLoop]: Abstraction has 187817 states and 238847 transitions. [2018-11-10 02:24:45,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:24:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 187817 states and 238847 transitions. [2018-11-10 02:24:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 02:24:45,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:24:45,280 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 02:24:45,280 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:24:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1321590439, now seen corresponding path program 1 times [2018-11-10 02:24:45,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 02:24:45,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:24:45,355 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:24:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:45,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 02:24:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:24:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-10 02:24:45,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 02:24:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:24:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:24:45,498 INFO L87 Difference]: Start difference. First operand 187817 states and 238847 transitions. Second operand 10 states. [2018-11-10 02:24:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:54,406 INFO L93 Difference]: Finished difference Result 404714 states and 518687 transitions. [2018-11-10 02:24:54,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 02:24:54,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 192 [2018-11-10 02:24:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:24:55,056 INFO L225 Difference]: With dead ends: 404714 [2018-11-10 02:24:55,056 INFO L226 Difference]: Without dead ends: 216926 [2018-11-10 02:24:55,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-11-10 02:24:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216926 states. [2018-11-10 02:25:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216926 to 187700. [2018-11-10 02:25:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187700 states. [2018-11-10 02:25:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187700 states to 187700 states and 233931 transitions. [2018-11-10 02:25:02,855 INFO L78 Accepts]: Start accepts. Automaton has 187700 states and 233931 transitions. Word has length 192 [2018-11-10 02:25:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:25:02,855 INFO L481 AbstractCegarLoop]: Abstraction has 187700 states and 233931 transitions. [2018-11-10 02:25:02,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 02:25:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 187700 states and 233931 transitions. [2018-11-10 02:25:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-10 02:25:02,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:25:02,883 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:25:02,883 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:25:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:25:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1406148064, now seen corresponding path program 1 times [2018-11-10 02:25:02,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:25:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:25:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:25:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:25:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-10 02:25:02,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:25:02,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:25:02,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:25:02,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:25:02,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:25:02,973 INFO L87 Difference]: Start difference. First operand 187700 states and 233931 transitions. Second operand 4 states. [2018-11-10 02:25:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:25:12,116 INFO L93 Difference]: Finished difference Result 332610 states and 425435 transitions. [2018-11-10 02:25:12,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:25:12,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-11-10 02:25:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:25:12,586 INFO L225 Difference]: With dead ends: 332610 [2018-11-10 02:25:12,586 INFO L226 Difference]: Without dead ends: 151267 [2018-11-10 02:25:12,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 02:25:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151267 states. [2018-11-10 02:25:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151267 to 150474. [2018-11-10 02:25:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150474 states. [2018-11-10 02:25:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150474 states to 150474 states and 184742 transitions. [2018-11-10 02:25:18,738 INFO L78 Accepts]: Start accepts. Automaton has 150474 states and 184742 transitions. Word has length 217 [2018-11-10 02:25:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:25:18,738 INFO L481 AbstractCegarLoop]: Abstraction has 150474 states and 184742 transitions. [2018-11-10 02:25:18,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:25:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 150474 states and 184742 transitions. [2018-11-10 02:25:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 02:25:18,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:25:18,759 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:25:18,760 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:25:18,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:25:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 175325733, now seen corresponding path program 1 times [2018-11-10 02:25:18,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:25:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:25:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:18,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:25:18,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:25:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-10 02:25:18,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:25:18,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:25:18,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:25:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:25:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:25:18,816 INFO L87 Difference]: Start difference. First operand 150474 states and 184742 transitions. Second operand 4 states. [2018-11-10 02:25:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:25:24,741 INFO L93 Difference]: Finished difference Result 288509 states and 362720 transitions. [2018-11-10 02:25:24,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:25:24,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-11-10 02:25:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:25:25,175 INFO L225 Difference]: With dead ends: 288509 [2018-11-10 02:25:25,175 INFO L226 Difference]: Without dead ends: 138106 [2018-11-10 02:25:25,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 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 02:25:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138106 states. [2018-11-10 02:25:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138106 to 138106. [2018-11-10 02:25:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138106 states. [2018-11-10 02:25:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138106 states to 138106 states and 167015 transitions. [2018-11-10 02:25:31,314 INFO L78 Accepts]: Start accepts. Automaton has 138106 states and 167015 transitions. Word has length 218 [2018-11-10 02:25:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:25:31,314 INFO L481 AbstractCegarLoop]: Abstraction has 138106 states and 167015 transitions. [2018-11-10 02:25:31,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:25:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 138106 states and 167015 transitions. [2018-11-10 02:25:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 02:25:31,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:25:31,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:25:31,345 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:25:31,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:25:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash -455958204, now seen corresponding path program 1 times [2018-11-10 02:25:31,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:25:31,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:25:31,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:31,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:25:31,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:25:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-10 02:25:31,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:25:31,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:25:31,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:25:31,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:25:31,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:25:31,415 INFO L87 Difference]: Start difference. First operand 138106 states and 167015 transitions. Second operand 4 states. [2018-11-10 02:25:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:25:37,856 INFO L93 Difference]: Finished difference Result 289650 states and 360447 transitions. [2018-11-10 02:25:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:25:37,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2018-11-10 02:25:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:25:38,308 INFO L225 Difference]: With dead ends: 289650 [2018-11-10 02:25:38,308 INFO L226 Difference]: Without dead ends: 149583 [2018-11-10 02:25:38,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 02:25:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149583 states. [2018-11-10 02:25:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149583 to 149166. [2018-11-10 02:25:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149166 states. [2018-11-10 02:25:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149166 states to 149166 states and 177926 transitions. [2018-11-10 02:25:44,899 INFO L78 Accepts]: Start accepts. Automaton has 149166 states and 177926 transitions. Word has length 243 [2018-11-10 02:25:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:25:44,899 INFO L481 AbstractCegarLoop]: Abstraction has 149166 states and 177926 transitions. [2018-11-10 02:25:44,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:25:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 149166 states and 177926 transitions. [2018-11-10 02:25:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 02:25:44,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:25:44,917 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:25:44,917 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:25:44,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:25:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2011392991, now seen corresponding path program 1 times [2018-11-10 02:25:44,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:25:44,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:25:44,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:44,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:25:44,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:25:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:25:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 02:25:44,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:25:44,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:25:44,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:25:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:25:44,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:25:44,999 INFO L87 Difference]: Start difference. First operand 149166 states and 177926 transitions. Second operand 4 states. [2018-11-10 02:25:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:25:54,058 INFO L93 Difference]: Finished difference Result 280681 states and 340140 transitions. [2018-11-10 02:25:54,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:25:54,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2018-11-10 02:25:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:25:54,510 INFO L225 Difference]: With dead ends: 280681 [2018-11-10 02:25:54,510 INFO L226 Difference]: Without dead ends: 134928 [2018-11-10 02:25:54,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 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 02:25:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134928 states. [2018-11-10 02:26:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134928 to 134924. [2018-11-10 02:26:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134924 states. [2018-11-10 02:26:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134924 states to 134924 states and 158085 transitions. [2018-11-10 02:26:00,561 INFO L78 Accepts]: Start accepts. Automaton has 134924 states and 158085 transitions. Word has length 244 [2018-11-10 02:26:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:00,561 INFO L481 AbstractCegarLoop]: Abstraction has 134924 states and 158085 transitions. [2018-11-10 02:26:00,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:26:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 134924 states and 158085 transitions. [2018-11-10 02:26:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 02:26:00,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:00,577 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:26:00,577 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:00,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1383088872, now seen corresponding path program 1 times [2018-11-10 02:26:00,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:00,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:00,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:00,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:00,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 02:26:00,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:26:00,697 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:26:00,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:00,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:26:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 02:26:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:26:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2018-11-10 02:26:00,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 02:26:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:26:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:26:00,868 INFO L87 Difference]: Start difference. First operand 134924 states and 158085 transitions. Second operand 8 states. [2018-11-10 02:26:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:06,272 INFO L93 Difference]: Finished difference Result 215094 states and 255615 transitions. [2018-11-10 02:26:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 02:26:06,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 260 [2018-11-10 02:26:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:06,570 INFO L225 Difference]: With dead ends: 215094 [2018-11-10 02:26:06,570 INFO L226 Difference]: Without dead ends: 98426 [2018-11-10 02:26:06,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 258 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:26:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98426 states. [2018-11-10 02:26:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98426 to 98157. [2018-11-10 02:26:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98157 states. [2018-11-10 02:26:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98157 states to 98157 states and 114447 transitions. [2018-11-10 02:26:11,309 INFO L78 Accepts]: Start accepts. Automaton has 98157 states and 114447 transitions. Word has length 260 [2018-11-10 02:26:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:11,309 INFO L481 AbstractCegarLoop]: Abstraction has 98157 states and 114447 transitions. [2018-11-10 02:26:11,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 02:26:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 98157 states and 114447 transitions. [2018-11-10 02:26:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-10 02:26:11,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:11,321 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:26:11,322 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:11,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1883291430, now seen corresponding path program 1 times [2018-11-10 02:26:11,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:11,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 02:26:11,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:26:11,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:26:11,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 02:26:11,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:26:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:26:11,388 INFO L87 Difference]: Start difference. First operand 98157 states and 114447 transitions. Second operand 4 states. [2018-11-10 02:26:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:15,476 INFO L93 Difference]: Finished difference Result 105850 states and 122852 transitions. [2018-11-10 02:26:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:26:15,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-11-10 02:26:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:15,660 INFO L225 Difference]: With dead ends: 105850 [2018-11-10 02:26:15,660 INFO L226 Difference]: Without dead ends: 97929 [2018-11-10 02:26:15,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 02:26:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97929 states. [2018-11-10 02:26:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97929 to 89982. [2018-11-10 02:26:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89982 states. [2018-11-10 02:26:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89982 states to 89982 states and 105435 transitions. [2018-11-10 02:26:19,984 INFO L78 Accepts]: Start accepts. Automaton has 89982 states and 105435 transitions. Word has length 260 [2018-11-10 02:26:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:19,984 INFO L481 AbstractCegarLoop]: Abstraction has 89982 states and 105435 transitions. [2018-11-10 02:26:19,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 02:26:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89982 states and 105435 transitions. [2018-11-10 02:26:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 02:26:19,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:19,994 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:26:19,994 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:19,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1194398283, now seen corresponding path program 1 times [2018-11-10 02:26:19,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-10 02:26:20,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:26:20,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 02:26:20,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 02:26:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 02:26:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 02:26:20,108 INFO L87 Difference]: Start difference. First operand 89982 states and 105435 transitions. Second operand 5 states. [2018-11-10 02:26:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:24,504 INFO L93 Difference]: Finished difference Result 173548 states and 204334 transitions. [2018-11-10 02:26:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:26:24,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-11-10 02:26:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:24,807 INFO L225 Difference]: With dead ends: 173548 [2018-11-10 02:26:24,807 INFO L226 Difference]: Without dead ends: 85772 [2018-11-10 02:26:24,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:26:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85772 states. [2018-11-10 02:26:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85772 to 85339. [2018-11-10 02:26:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85339 states. [2018-11-10 02:26:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85339 states to 85339 states and 98717 transitions. [2018-11-10 02:26:29,402 INFO L78 Accepts]: Start accepts. Automaton has 85339 states and 98717 transitions. Word has length 269 [2018-11-10 02:26:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:29,402 INFO L481 AbstractCegarLoop]: Abstraction has 85339 states and 98717 transitions. [2018-11-10 02:26:29,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 02:26:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 85339 states and 98717 transitions. [2018-11-10 02:26:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-10 02:26:29,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:29,411 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:26:29,411 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:29,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash -381045038, now seen corresponding path program 1 times [2018-11-10 02:26:29,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:29,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-10 02:26:29,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:26:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:26:29,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 02:26:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:26:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:26:29,499 INFO L87 Difference]: Start difference. First operand 85339 states and 98717 transitions. Second operand 3 states. [2018-11-10 02:26:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:32,814 INFO L93 Difference]: Finished difference Result 134101 states and 156990 transitions. [2018-11-10 02:26:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:26:32,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2018-11-10 02:26:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:33,008 INFO L225 Difference]: With dead ends: 134101 [2018-11-10 02:26:33,009 INFO L226 Difference]: Without dead ends: 57093 [2018-11-10 02:26:33,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:26:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57093 states. [2018-11-10 02:26:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57093 to 56970. [2018-11-10 02:26:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56970 states. [2018-11-10 02:26:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56970 states to 56970 states and 65585 transitions. [2018-11-10 02:26:36,318 INFO L78 Accepts]: Start accepts. Automaton has 56970 states and 65585 transitions. Word has length 284 [2018-11-10 02:26:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:36,319 INFO L481 AbstractCegarLoop]: Abstraction has 56970 states and 65585 transitions. [2018-11-10 02:26:36,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 02:26:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56970 states and 65585 transitions. [2018-11-10 02:26:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-10 02:26:36,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:36,327 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:26:36,327 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:36,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1113012464, now seen corresponding path program 1 times [2018-11-10 02:26:36,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 46 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 02:26:36,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:26:36,422 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:26:36,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:36,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:26:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 02:26:36,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 02:26:36,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-11-10 02:26:36,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 02:26:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:26:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:26:36,598 INFO L87 Difference]: Start difference. First operand 56970 states and 65585 transitions. Second operand 13 states. [2018-11-10 02:26:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:40,509 INFO L93 Difference]: Finished difference Result 98025 states and 113545 transitions. [2018-11-10 02:26:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 02:26:40,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2018-11-10 02:26:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:40,663 INFO L225 Difference]: With dead ends: 98025 [2018-11-10 02:26:40,663 INFO L226 Difference]: Without dead ends: 47848 [2018-11-10 02:26:40,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-11-10 02:26:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47848 states. [2018-11-10 02:26:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47848 to 46662. [2018-11-10 02:26:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46662 states. [2018-11-10 02:26:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46662 states to 46662 states and 53628 transitions. [2018-11-10 02:26:43,197 INFO L78 Accepts]: Start accepts. Automaton has 46662 states and 53628 transitions. Word has length 284 [2018-11-10 02:26:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:43,198 INFO L481 AbstractCegarLoop]: Abstraction has 46662 states and 53628 transitions. [2018-11-10 02:26:43,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 02:26:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 46662 states and 53628 transitions. [2018-11-10 02:26:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 02:26:43,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:43,203 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:26:43,203 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:43,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:43,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1141958359, now seen corresponding path program 1 times [2018-11-10 02:26:43,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:43,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:43,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-10 02:26:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:26:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:26:43,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 02:26:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 02:26:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 02:26:43,297 INFO L87 Difference]: Start difference. First operand 46662 states and 53628 transitions. Second operand 6 states. [2018-11-10 02:26:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:45,533 INFO L93 Difference]: Finished difference Result 73820 states and 84828 transitions. [2018-11-10 02:26:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 02:26:45,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 285 [2018-11-10 02:26:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:45,634 INFO L225 Difference]: With dead ends: 73820 [2018-11-10 02:26:45,634 INFO L226 Difference]: Without dead ends: 46417 [2018-11-10 02:26:45,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:26:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2018-11-10 02:26:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 46361. [2018-11-10 02:26:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46361 states. [2018-11-10 02:26:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46361 states to 46361 states and 53132 transitions. [2018-11-10 02:26:47,921 INFO L78 Accepts]: Start accepts. Automaton has 46361 states and 53132 transitions. Word has length 285 [2018-11-10 02:26:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:47,921 INFO L481 AbstractCegarLoop]: Abstraction has 46361 states and 53132 transitions. [2018-11-10 02:26:47,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 02:26:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 46361 states and 53132 transitions. [2018-11-10 02:26:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 02:26:47,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:47,927 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:26:47,927 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:47,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -748871650, now seen corresponding path program 1 times [2018-11-10 02:26:47,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:47,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 47 proven. 17 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-10 02:26:48,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:26:48,027 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:26:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:48,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:26:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 02:26:48,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:26:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-11-10 02:26:48,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 02:26:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 02:26:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-10 02:26:48,220 INFO L87 Difference]: Start difference. First operand 46361 states and 53132 transitions. Second operand 13 states. [2018-11-10 02:26:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:26:53,292 INFO L93 Difference]: Finished difference Result 106072 states and 125583 transitions. [2018-11-10 02:26:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 02:26:53,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 286 [2018-11-10 02:26:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:26:53,547 INFO L225 Difference]: With dead ends: 106072 [2018-11-10 02:26:53,547 INFO L226 Difference]: Without dead ends: 80550 [2018-11-10 02:26:53,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 02:26:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80550 states. [2018-11-10 02:26:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80550 to 73820. [2018-11-10 02:26:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73820 states. [2018-11-10 02:26:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73820 states to 73820 states and 86355 transitions. [2018-11-10 02:26:57,757 INFO L78 Accepts]: Start accepts. Automaton has 73820 states and 86355 transitions. Word has length 286 [2018-11-10 02:26:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:26:57,757 INFO L481 AbstractCegarLoop]: Abstraction has 73820 states and 86355 transitions. [2018-11-10 02:26:57,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 02:26:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 73820 states and 86355 transitions. [2018-11-10 02:26:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-10 02:26:57,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:26:57,762 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:26:57,762 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:26:57,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:26:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 920103264, now seen corresponding path program 1 times [2018-11-10 02:26:57,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:26:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:26:57,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:57,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:57,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:26:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-10 02:26:57,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:26:57,873 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:26:57,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:26:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:26:57,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:26:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 35 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 02:26:58,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:26:58,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2018-11-10 02:26:58,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 02:26:58,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 02:26:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 02:26:58,065 INFO L87 Difference]: Start difference. First operand 73820 states and 86355 transitions. Second operand 12 states. [2018-11-10 02:27:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:05,758 INFO L93 Difference]: Finished difference Result 166094 states and 206070 transitions. [2018-11-10 02:27:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 02:27:05,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 289 [2018-11-10 02:27:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 02:27:06,301 INFO L225 Difference]: With dead ends: 166094 [2018-11-10 02:27:06,301 INFO L226 Difference]: Without dead ends: 97881 [2018-11-10 02:27:06,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-11-10 02:27:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97881 states. [2018-11-10 02:27:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97881 to 85554. [2018-11-10 02:27:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85554 states. [2018-11-10 02:27:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85554 states to 85554 states and 99791 transitions. [2018-11-10 02:27:11,994 INFO L78 Accepts]: Start accepts. Automaton has 85554 states and 99791 transitions. Word has length 289 [2018-11-10 02:27:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 02:27:11,994 INFO L481 AbstractCegarLoop]: Abstraction has 85554 states and 99791 transitions. [2018-11-10 02:27:11,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 02:27:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 85554 states and 99791 transitions. [2018-11-10 02:27:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-10 02:27:11,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 02:27:11,999 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:27:12,000 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 02:27:12,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:12,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1598104973, now seen corresponding path program 1 times [2018-11-10 02:27:12,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:12,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:12,136 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 02:27:12,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:27:12 BoogieIcfgContainer [2018-11-10 02:27:12,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 02:27:12,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:27:12,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:27:12,259 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:27:12,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:22:40" (3/4) ... [2018-11-10 02:27:12,262 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 02:27:12,400 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_45dbd53e-0abb-45e8-aa67-ebbe7bbe2d9b/bin-2019/uautomizer/witness.graphml [2018-11-10 02:27:12,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:27:12,401 INFO L168 Benchmark]: Toolchain (without parser) took 272786.83 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.5 GB). Free memory was 960.3 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,402 INFO L168 Benchmark]: CDTParser took 0.10 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 02:27:12,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,402 INFO L168 Benchmark]: Boogie Preprocessor took 81.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,403 INFO L168 Benchmark]: RCFGBuilder took 458.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,404 INFO L168 Benchmark]: TraceAbstraction took 271888.85 ms. Allocated memory was 1.1 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,404 INFO L168 Benchmark]: Witness Printer took 141.12 ms. Allocated memory is still 7.5 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:27:12,405 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.10 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 213.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -159.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 458.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 271888.85 ms. Allocated memory was 1.1 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 141.12 ms. Allocated memory is still 7.5 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; VAL [\old(C_1_ev)=80, \old(C_1_i)=69, \old(C_1_pc)=85, \old(C_1_pr)=82, \old(C_1_st)=84, \old(data_0)=77, \old(data_1)=68, \old(e)=67, \old(i)=71, \old(max_loop)=83, \old(num)=70, \old(P_1_ev)=72, \old(P_1_i)=81, \old(P_1_pc)=74, \old(P_1_st)=78, \old(P_2_ev)=73, \old(P_2_i)=86, \old(P_2_pc)=76, \old(P_2_st)=79, \old(timer)=75, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L608] CALL init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=0, P_2_pc=0, P_2_st=0, timer=0] [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] RET C_1_i = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L608] init_model() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, count=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L609] CALL start_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L530] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] CALL init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L304] COND TRUE (int )C_1_i == 1 [L305] RET C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L531] init_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L532] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L533] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L107] COND FALSE !((int )P_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L119] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L175] COND FALSE !((int )P_2_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L187] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L473] EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_P_2_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L267] COND FALSE !((int )C_1_pc == 2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L279] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L481] EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, is_C_1_triggered()=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE, RET !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L533] activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L534] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L335] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, exists_runnable_thread()=1, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L72] COND TRUE (int )P_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L49] COND TRUE i___0 == 0 [L50] RET data_0 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L86] write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] RET P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0] [L363] P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L130] COND TRUE (int )P_2_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=0, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L52] COND TRUE i___0 == 1 [L53] RET data_1 = c VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L144] write_data(num, 'B') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L145] num += 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L147] COND FALSE !(\read(timer)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=0, P_2_st=1, timer=0] [L157] P_2_pc = 1 [L158] RET P_2_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=1, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L378] P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND TRUE \read(tmp___1) [L392] C_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L393] CALL C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L196] char c ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L199] COND TRUE (int )C_1_pc == 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L214] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L216] COND FALSE !(num == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L227] num -= 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L228] COND FALSE !(! (num >= 0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] CALL, EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L23] char c ; [L24] char __retres3 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L27] COND FALSE !(i___0 == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L31] COND TRUE i___0 == 1 [L32] __retres3 = data_1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L42] RET return (__retres3); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(i___0)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=66, __retres3=66, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, i___0=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L236] EXPR read_data(num) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=65, data_1=66, e=0, i=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, read_data(num)=66, timer=0] [L236] c = read_data(num) [L237] i += 1 [L238] C_1_pc = 2 [L239] RET C_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=1, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, c=66, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L393] C_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L349] EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1] [L349] tmp___2 = exists_runnable_thread() [L351] COND FALSE, RET !(\read(tmp___2)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1, tmp___0=1, tmp___1=1, tmp___2=0] [L541] eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L544] kernel_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L545] FCALL update_channels() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=2, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L548] kernel_st = 3 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L549] FCALL fire_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L550] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND FALSE !((int )P_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L117] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND FALSE !((int )P_2_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L185] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L268] COND FALSE !((int )C_1_ev == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L277] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L279] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L481] EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=0, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0] [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE, RET !(\read(tmp___1)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0, tmp___0=0, tmp___1=0] [L550] activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L551] FCALL reset_delta_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L317] COND FALSE !((int )P_1_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L321] COND FALSE !((int )P_2_st == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L325] COND FALSE !((int )C_1_st == 0) [L333] __retres1 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L335] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, exists_runnable_thread()=0, i=1, kernel_st=3, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L554] tmp = exists_runnable_thread() [L556] COND TRUE tmp == 0 [L558] kernel_st = 4 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L559] CALL fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=0, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=0, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L428] C_1_ev = 1 [L429] P_1_ev = 1 [L430] RET P_2_ev = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L559] fire_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=0] [L560] CALL activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] CALL, EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L104] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L107] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L108] COND TRUE (int )P_1_ev == 1 [L109] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L119] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] EXPR is_P_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L465] tmp = is_P_1_triggered() [L467] COND TRUE \read(tmp) [L468] P_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] CALL, EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L172] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L175] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L176] COND TRUE (int )P_2_ev == 1 [L177] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L187] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0] [L473] EXPR is_P_2_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_P_2_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=2, timer=0, tmp=1] [L473] tmp___0 = is_P_2_triggered() [L475] COND TRUE \read(tmp___0) [L476] P_2_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] CALL, EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L254] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L257] COND FALSE !((int )C_1_pc == 1) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L267] COND TRUE (int )C_1_pc == 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L268] COND TRUE (int )C_1_ev == 1 [L269] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L279] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, \result=1, __retres1=1, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L481] EXPR is_C_1_triggered() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=2, data_0=65, data_1=66, e=0, i=1, is_C_1_triggered()=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1] [L481] tmp___1 = is_C_1_triggered() [L483] COND TRUE \read(tmp___1) [L484] RET C_1_st = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=2, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=2, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___0=1, tmp___1=1] [L560] activate_threads() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L561] CALL reset_time_events() VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L439] COND TRUE (int )P_1_ev == 1 [L440] P_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=1, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L444] COND TRUE (int )P_2_ev == 1 [L445] P_2_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=1, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L449] COND TRUE (int )C_1_ev == 1 [L450] RET C_1_ev = 2 VAL [\old(C_1_ev)=1, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=1, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=1, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L561] reset_time_events() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0] [L567] CALL, EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L504] int tmp ; [L505] int __retres2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L509] tmp = exists_runnable_thread() [L511] COND TRUE \read(tmp) [L512] __retres2 = 0 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L519] RET return (__retres2); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, \result=0, __retres2=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1] [L567] EXPR stop_simulation() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, stop_simulation()=0, timer=0, tmp=0] [L567] tmp___0 = stop_simulation() [L569] COND FALSE !(\read(tmp___0)) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L537] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=4, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L540] kernel_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=0, \old(C_1_st)=0, \old(data_0)=0, \old(data_1)=0, \old(e)=0, \old(i)=0, \old(max_loop)=0, \old(num)=0, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=0, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=0, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, kernel_st=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=0, tmp___0=0] [L541] CALL eval() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L346] COND TRUE 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] CALL, EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L314] int __retres1 ; VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L335] RET return (__retres1); VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, \result=1, __retres1=1, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] EXPR exists_runnable_thread() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, exists_runnable_thread()=1, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp___2=1] [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp) [L362] P_1_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L363] CALL P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L72] COND FALSE !((int )P_1_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L75] COND TRUE (int )P_1_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L83] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] CALL write_data(num, 'A') VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=66, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L52] COND TRUE i___0 == 1 [L53] RET data_1 = c VAL [\old(c)=65, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(i___0)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, c=65, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L86] write_data(num, 'A') VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L87] num += 1 [L88] P_1_pc = 1 [L89] RET P_1_st = 2 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=1, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0] [L363] P_1() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=0, timer=0, tmp=1, tmp___2=1] [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND TRUE \read(tmp___0) [L377] P_2_st = 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=66, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=1, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=0, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=0, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0, tmp=1, tmp___0=1, tmp___2=1] [L378] CALL P_2() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L130] COND FALSE !((int )P_2_pc == 0) VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L133] COND TRUE (int )P_2_pc == 1 VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L141] COND TRUE i < max_loop VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L144] CALL write_data(num, 'B') VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L49] COND FALSE !(i___0 == 0) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L52] COND FALSE !(i___0 == 1) VAL [\old(c)=66, \old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(i___0)=2, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, c=66, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L56] CALL error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] [L9] __VERIFIER_error() VAL [\old(C_1_ev)=0, \old(C_1_i)=0, \old(C_1_pc)=2, \old(C_1_st)=0, \old(data_0)=65, \old(data_1)=65, \old(e)=0, \old(i)=1, \old(max_loop)=0, \old(num)=2, \old(P_1_ev)=0, \old(P_1_i)=0, \old(P_1_pc)=1, \old(P_1_st)=2, \old(P_2_ev)=0, \old(P_2_i)=0, \old(P_2_pc)=1, \old(P_2_st)=1, \old(timer)=0, C_1_ev=2, C_1_i=1, C_1_pc=2, C_1_pr=0, C_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, P_2_ev=2, P_2_i=1, P_2_pc=1, P_2_st=1, timer=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 186 locations, 1 error locations. UNSAFE Result, 271.8s OverallTime, 34 OverallIterations, 6 TraceHistogramMax, 157.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11824 SDtfs, 17056 SDslu, 24672 SDs, 0 SdLazy, 24519 SolverSat, 5849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2303 GetRequests, 1962 SyntacticMatches, 28 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187817occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 108.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 94029 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 7651 NumberOfCodeBlocks, 7651 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 7313 ConstructedInterpolants, 0 QuantifiedInterpolants, 2594228 SizeOfPredicates, 14 NumberOfNonLiveVariables, 8022 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 42 InterpolantComputations, 31 PerfectInterpolantSequences, 3198/3421 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...