./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.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_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:09:59,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:09:59,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:09:59,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:09:59,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:09:59,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:09:59,524 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:09:59,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:09:59,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:09:59,526 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:09:59,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:09:59,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:09:59,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:09:59,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:09:59,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:09:59,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:09:59,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:09:59,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:09:59,533 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:09:59,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:09:59,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:09:59,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:09:59,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:09:59,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:09:59,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:09:59,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:09:59,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:09:59,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:09:59,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:09:59,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:09:59,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:09:59,541 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:09:59,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:09:59,541 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:09:59,542 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:09:59,543 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:09:59,543 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 01:09:59,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:09:59,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:09:59,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:09:59,553 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 01:09:59,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:09:59,554 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:09:59,554 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:09:59,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:09:59,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:09:59,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:09:59,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:09:59,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:09:59,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:09:59,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:09:59,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:09:59,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:09:59,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:09:59,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:09:59,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:09:59,558 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_567d64ef-a982-43f1-a211-2d12b4f126ce/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 -> 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e [2018-11-10 01:09:59,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:09:59,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:09:59,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:09:59,591 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:09:59,591 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:09:59,591 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-10 01:09:59,629 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/data/346a2415a/7935e785dc00454d921bd908da478065/FLAG3ad877f8f [2018-11-10 01:10:00,042 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:10:00,043 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-10 01:10:00,050 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/data/346a2415a/7935e785dc00454d921bd908da478065/FLAG3ad877f8f [2018-11-10 01:10:00,058 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/data/346a2415a/7935e785dc00454d921bd908da478065 [2018-11-10 01:10:00,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:10:00,061 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:10:00,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:10:00,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:10:00,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:10:00,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00, skipping insertion in model container [2018-11-10 01:10:00,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:10:00,098 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:10:00,229 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:10:00,233 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:10:00,270 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:10:00,284 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:10:00,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00 WrapperNode [2018-11-10 01:10:00,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:10:00,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:10:00,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:10:00,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:10:00,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... [2018-11-10 01:10:00,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:10:00,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:10:00,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:10:00,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:10:00,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:00,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:10:00,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:10:00,406 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2018-11-10 01:10:00,407 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2018-11-10 01:10:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2018-11-10 01:10:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:10:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2018-11-10 01:10:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 01:10:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 01:10:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-10 01:10:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure read [2018-11-10 01:10:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure write [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-10 01:10:00,409 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:10:00,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:10:00,904 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:10:00,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:00 BoogieIcfgContainer [2018-11-10 01:10:00,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:10:00,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:10:00,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:10:00,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:10:00,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:10:00" (1/3) ... [2018-11-10 01:10:00,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331899e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:10:00, skipping insertion in model container [2018-11-10 01:10:00,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:00" (2/3) ... [2018-11-10 01:10:00,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331899e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:10:00, skipping insertion in model container [2018-11-10 01:10:00,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:00" (3/3) ... [2018-11-10 01:10:00,911 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-10 01:10:00,919 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:10:00,926 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:10:00,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:10:00,966 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:10:00,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:10:00,967 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:10:00,967 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:10:00,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:10:00,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:10:00,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:10:00,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:10:00,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:10:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-11-10 01:10:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 01:10:00,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:00,992 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] [2018-11-10 01:10:00,994 INFO L424 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:00,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:00,999 INFO L82 PathProgramCache]: Analyzing trace with hash 825444053, now seen corresponding path program 1 times [2018-11-10 01:10:01,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,194 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 01:10:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:01,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:01,209 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-11-10 01:10:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,289 INFO L93 Difference]: Finished difference Result 414 states and 673 transitions. [2018-11-10 01:10:01,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:01,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-10 01:10:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,301 INFO L225 Difference]: With dead ends: 414 [2018-11-10 01:10:01,301 INFO L226 Difference]: Without dead ends: 213 [2018-11-10 01:10:01,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-10 01:10:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-11-10 01:10:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-10 01:10:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 313 transitions. [2018-11-10 01:10:01,349 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 313 transitions. Word has length 22 [2018-11-10 01:10:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,350 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 313 transitions. [2018-11-10 01:10:01,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 313 transitions. [2018-11-10 01:10:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 01:10:01,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,351 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] [2018-11-10 01:10:01,352 INFO L424 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1849404687, now seen corresponding path program 1 times [2018-11-10 01:10:01,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,427 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 01:10:01,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:01,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:01,430 INFO L87 Difference]: Start difference. First operand 211 states and 313 transitions. Second operand 4 states. [2018-11-10 01:10:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,470 INFO L93 Difference]: Finished difference Result 431 states and 645 transitions. [2018-11-10 01:10:01,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:01,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-10 01:10:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,473 INFO L225 Difference]: With dead ends: 431 [2018-11-10 01:10:01,473 INFO L226 Difference]: Without dead ends: 229 [2018-11-10 01:10:01,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-10 01:10:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-11-10 01:10:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 01:10:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2018-11-10 01:10:01,492 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 23 [2018-11-10 01:10:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,493 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2018-11-10 01:10:01,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2018-11-10 01:10:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 01:10:01,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,494 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] [2018-11-10 01:10:01,494 INFO L424 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1652791322, now seen corresponding path program 1 times [2018-11-10 01:10:01,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:01,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:10:01,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:10:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:10:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:10:01,569 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand 3 states. [2018-11-10 01:10:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,599 INFO L93 Difference]: Finished difference Result 466 states and 694 transitions. [2018-11-10 01:10:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:10:01,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 01:10:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,601 INFO L225 Difference]: With dead ends: 466 [2018-11-10 01:10:01,601 INFO L226 Difference]: Without dead ends: 257 [2018-11-10 01:10:01,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:10:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-10 01:10:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 230. [2018-11-10 01:10:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 01:10:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 335 transitions. [2018-11-10 01:10:01,618 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 335 transitions. Word has length 32 [2018-11-10 01:10:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,618 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 335 transitions. [2018-11-10 01:10:01,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:10:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 335 transitions. [2018-11-10 01:10:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 01:10:01,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,620 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 01:10:01,620 INFO L424 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1730126729, now seen corresponding path program 1 times [2018-11-10 01:10:01,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:01,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:10:01,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:10:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:10:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:01,681 INFO L87 Difference]: Start difference. First operand 230 states and 335 transitions. Second operand 5 states. [2018-11-10 01:10:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,717 INFO L93 Difference]: Finished difference Result 444 states and 653 transitions. [2018-11-10 01:10:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:01,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-10 01:10:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,720 INFO L225 Difference]: With dead ends: 444 [2018-11-10 01:10:01,720 INFO L226 Difference]: Without dead ends: 238 [2018-11-10 01:10:01,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-10 01:10:01,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2018-11-10 01:10:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-10 01:10:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2018-11-10 01:10:01,734 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 40 [2018-11-10 01:10:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,734 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2018-11-10 01:10:01,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:10:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2018-11-10 01:10:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 01:10:01,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,736 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] [2018-11-10 01:10:01,736 INFO L424 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash -622392820, now seen corresponding path program 1 times [2018-11-10 01:10:01,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,794 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 01:10:01,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:01,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:01,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:01,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:01,796 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand 4 states. [2018-11-10 01:10:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,817 INFO L93 Difference]: Finished difference Result 402 states and 589 transitions. [2018-11-10 01:10:01,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:01,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-10 01:10:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,819 INFO L225 Difference]: With dead ends: 402 [2018-11-10 01:10:01,819 INFO L226 Difference]: Without dead ends: 230 [2018-11-10 01:10:01,820 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 01:10:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-10 01:10:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-11-10 01:10:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 01:10:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2018-11-10 01:10:01,829 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 41 [2018-11-10 01:10:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,829 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2018-11-10 01:10:01,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2018-11-10 01:10:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 01:10:01,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,830 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-10 01:10:01,830 INFO L424 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash -120920810, now seen corresponding path program 1 times [2018-11-10 01:10:01,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:10:01,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:01,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:01,873 INFO L87 Difference]: Start difference. First operand 230 states and 330 transitions. Second operand 4 states. [2018-11-10 01:10:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:01,922 INFO L93 Difference]: Finished difference Result 457 states and 665 transitions. [2018-11-10 01:10:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:01,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-10 01:10:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:01,924 INFO L225 Difference]: With dead ends: 457 [2018-11-10 01:10:01,924 INFO L226 Difference]: Without dead ends: 252 [2018-11-10 01:10:01,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:01,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-10 01:10:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2018-11-10 01:10:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-10 01:10:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 352 transitions. [2018-11-10 01:10:01,937 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 352 transitions. Word has length 44 [2018-11-10 01:10:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:01,938 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 352 transitions. [2018-11-10 01:10:01,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 352 transitions. [2018-11-10 01:10:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 01:10:01,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:01,940 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-10 01:10:01,940 INFO L424 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:01,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 647292807, now seen corresponding path program 1 times [2018-11-10 01:10:01,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:01,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 01:10:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:01,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:01,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:01,990 INFO L87 Difference]: Start difference. First operand 249 states and 352 transitions. Second operand 4 states. [2018-11-10 01:10:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,041 INFO L93 Difference]: Finished difference Result 479 states and 695 transitions. [2018-11-10 01:10:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:02,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-10 01:10:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,043 INFO L225 Difference]: With dead ends: 479 [2018-11-10 01:10:02,043 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 01:10:02,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 01:10:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-10 01:10:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 01:10:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 360 transitions. [2018-11-10 01:10:02,054 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 360 transitions. Word has length 44 [2018-11-10 01:10:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,055 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 360 transitions. [2018-11-10 01:10:02,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 360 transitions. [2018-11-10 01:10:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 01:10:02,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,056 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-11-10 01:10:02,059 INFO L424 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1137107395, now seen corresponding path program 1 times [2018-11-10 01:10:02,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 01:10:02,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:02,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:10:02,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:10:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:10:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,107 INFO L87 Difference]: Start difference. First operand 256 states and 360 transitions. Second operand 5 states. [2018-11-10 01:10:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,132 INFO L93 Difference]: Finished difference Result 477 states and 681 transitions. [2018-11-10 01:10:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:02,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-10 01:10:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,134 INFO L225 Difference]: With dead ends: 477 [2018-11-10 01:10:02,134 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 01:10:02,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 01:10:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-10 01:10:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 01:10:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 359 transitions. [2018-11-10 01:10:02,144 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 359 transitions. Word has length 63 [2018-11-10 01:10:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,145 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 359 transitions. [2018-11-10 01:10:02,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:10:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 359 transitions. [2018-11-10 01:10:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 01:10:02,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,146 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2018-11-10 01:10:02,146 INFO L424 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1665225692, now seen corresponding path program 1 times [2018-11-10 01:10:02,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 01:10:02,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:02,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:02,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:02,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:02,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:02,197 INFO L87 Difference]: Start difference. First operand 256 states and 359 transitions. Second operand 4 states. [2018-11-10 01:10:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,240 INFO L93 Difference]: Finished difference Result 494 states and 706 transitions. [2018-11-10 01:10:02,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:02,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-11-10 01:10:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,242 INFO L225 Difference]: With dead ends: 494 [2018-11-10 01:10:02,242 INFO L226 Difference]: Without dead ends: 280 [2018-11-10 01:10:02,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-11-10 01:10:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-11-10 01:10:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-10 01:10:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 383 transitions. [2018-11-10 01:10:02,252 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 383 transitions. Word has length 67 [2018-11-10 01:10:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,252 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 383 transitions. [2018-11-10 01:10:02,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 383 transitions. [2018-11-10 01:10:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 01:10:02,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,253 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 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] [2018-11-10 01:10:02,253 INFO L424 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash 433458435, now seen corresponding path program 1 times [2018-11-10 01:10:02,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 01:10:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:02,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:02,294 INFO L87 Difference]: Start difference. First operand 277 states and 383 transitions. Second operand 4 states. [2018-11-10 01:10:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,336 INFO L93 Difference]: Finished difference Result 503 states and 712 transitions. [2018-11-10 01:10:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:02,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-11-10 01:10:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,338 INFO L225 Difference]: With dead ends: 503 [2018-11-10 01:10:02,338 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 01:10:02,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 01:10:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-11-10 01:10:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 01:10:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2018-11-10 01:10:02,348 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 68 [2018-11-10 01:10:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,348 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2018-11-10 01:10:02,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2018-11-10 01:10:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 01:10:02,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,349 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 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] [2018-11-10 01:10:02,349 INFO L424 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1440948971, now seen corresponding path program 1 times [2018-11-10 01:10:02,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 01:10:02,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:02,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:10:02,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:10:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:10:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,404 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand 5 states. [2018-11-10 01:10:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,429 INFO L93 Difference]: Finished difference Result 489 states and 678 transitions. [2018-11-10 01:10:02,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:02,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2018-11-10 01:10:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,431 INFO L225 Difference]: With dead ends: 489 [2018-11-10 01:10:02,431 INFO L226 Difference]: Without dead ends: 273 [2018-11-10 01:10:02,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-10 01:10:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-11-10 01:10:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 01:10:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 368 transitions. [2018-11-10 01:10:02,439 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 368 transitions. Word has length 88 [2018-11-10 01:10:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,440 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 368 transitions. [2018-11-10 01:10:02,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:10:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 368 transitions. [2018-11-10 01:10:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 01:10:02,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,441 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 01:10:02,441 INFO L424 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 830072500, now seen corresponding path program 1 times [2018-11-10 01:10:02,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-10 01:10:02,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:02,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:02,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:02,506 INFO L87 Difference]: Start difference. First operand 271 states and 368 transitions. Second operand 4 states. [2018-11-10 01:10:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:02,563 INFO L93 Difference]: Finished difference Result 477 states and 675 transitions. [2018-11-10 01:10:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:02,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 01:10:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:02,565 INFO L225 Difference]: With dead ends: 477 [2018-11-10 01:10:02,565 INFO L226 Difference]: Without dead ends: 269 [2018-11-10 01:10:02,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-10 01:10:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-10 01:10:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-10 01:10:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 364 transitions. [2018-11-10 01:10:02,577 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 364 transitions. Word has length 92 [2018-11-10 01:10:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:02,577 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 364 transitions. [2018-11-10 01:10:02,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 364 transitions. [2018-11-10 01:10:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 01:10:02,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:02,581 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-10 01:10:02,581 INFO L424 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1270772888, now seen corresponding path program 1 times [2018-11-10 01:10:02,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:02,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:02,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 01:10:02,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:02,629 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:02,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:02,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 01:10:02,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:02,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-10 01:10:02,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:10:02,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:10:02,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:10:02,804 INFO L87 Difference]: Start difference. First operand 269 states and 364 transitions. Second operand 6 states. [2018-11-10 01:10:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,004 INFO L93 Difference]: Finished difference Result 641 states and 879 transitions. [2018-11-10 01:10:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:10:03,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-11-10 01:10:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,007 INFO L225 Difference]: With dead ends: 641 [2018-11-10 01:10:03,007 INFO L226 Difference]: Without dead ends: 309 [2018-11-10 01:10:03,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:10:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-10 01:10:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-11-10 01:10:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-10 01:10:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 366 transitions. [2018-11-10 01:10:03,018 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 366 transitions. Word has length 109 [2018-11-10 01:10:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,019 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 366 transitions. [2018-11-10 01:10:03,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:10:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 366 transitions. [2018-11-10 01:10:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 01:10:03,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,020 INFO L375 BasicCegarLoop]: trace histogram [10, 7, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:10:03,020 INFO L424 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921050, now seen corresponding path program 1 times [2018-11-10 01:10:03,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-11-10 01:10:03,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:10:03,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:10:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:10:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,111 INFO L87 Difference]: Start difference. First operand 279 states and 366 transitions. Second operand 5 states. [2018-11-10 01:10:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,130 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2018-11-10 01:10:03,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:03,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2018-11-10 01:10:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,132 INFO L225 Difference]: With dead ends: 450 [2018-11-10 01:10:03,132 INFO L226 Difference]: Without dead ends: 279 [2018-11-10 01:10:03,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-10 01:10:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-10 01:10:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-10 01:10:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 364 transitions. [2018-11-10 01:10:03,144 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 364 transitions. Word has length 155 [2018-11-10 01:10:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,144 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 364 transitions. [2018-11-10 01:10:03,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:10:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 364 transitions. [2018-11-10 01:10:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 01:10:03,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,146 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:03,146 INFO L424 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1789641909, now seen corresponding path program 1 times [2018-11-10 01:10:03,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-10 01:10:03,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:03,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:03,209 INFO L87 Difference]: Start difference. First operand 279 states and 364 transitions. Second operand 4 states. [2018-11-10 01:10:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,256 INFO L93 Difference]: Finished difference Result 449 states and 610 transitions. [2018-11-10 01:10:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:03,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-11-10 01:10:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,259 INFO L225 Difference]: With dead ends: 449 [2018-11-10 01:10:03,259 INFO L226 Difference]: Without dead ends: 285 [2018-11-10 01:10:03,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-10 01:10:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-11-10 01:10:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-10 01:10:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 367 transitions. [2018-11-10 01:10:03,270 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 367 transitions. Word has length 174 [2018-11-10 01:10:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,271 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 367 transitions. [2018-11-10 01:10:03,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2018-11-10 01:10:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 01:10:03,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,273 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:03,274 INFO L424 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1471229060, now seen corresponding path program 1 times [2018-11-10 01:10:03,274 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-10 01:10:03,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:03,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:03,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:03,346 INFO L87 Difference]: Start difference. First operand 283 states and 367 transitions. Second operand 4 states. [2018-11-10 01:10:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,374 INFO L93 Difference]: Finished difference Result 458 states and 617 transitions. [2018-11-10 01:10:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:03,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 01:10:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,376 INFO L225 Difference]: With dead ends: 458 [2018-11-10 01:10:03,376 INFO L226 Difference]: Without dead ends: 290 [2018-11-10 01:10:03,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-11-10 01:10:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-11-10 01:10:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-10 01:10:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 371 transitions. [2018-11-10 01:10:03,387 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 371 transitions. Word has length 186 [2018-11-10 01:10:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,388 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 371 transitions. [2018-11-10 01:10:03,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 371 transitions. [2018-11-10 01:10:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 01:10:03,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,390 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:10:03,390 INFO L424 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 770249110, now seen corresponding path program 1 times [2018-11-10 01:10:03,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-10 01:10:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:03,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:03,485 INFO L87 Difference]: Start difference. First operand 288 states and 371 transitions. Second operand 4 states. [2018-11-10 01:10:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,517 INFO L93 Difference]: Finished difference Result 460 states and 615 transitions. [2018-11-10 01:10:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:03,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-10 01:10:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,520 INFO L225 Difference]: With dead ends: 460 [2018-11-10 01:10:03,520 INFO L226 Difference]: Without dead ends: 287 [2018-11-10 01:10:03,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-10 01:10:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-10 01:10:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-10 01:10:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 366 transitions. [2018-11-10 01:10:03,531 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 366 transitions. Word has length 199 [2018-11-10 01:10:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,532 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 366 transitions. [2018-11-10 01:10:03,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 366 transitions. [2018-11-10 01:10:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 01:10:03,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,535 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:03,535 INFO L424 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1766087054, now seen corresponding path program 1 times [2018-11-10 01:10:03,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-10 01:10:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:03,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:03,647 INFO L87 Difference]: Start difference. First operand 287 states and 366 transitions. Second operand 4 states. [2018-11-10 01:10:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:03,679 INFO L93 Difference]: Finished difference Result 458 states and 605 transitions. [2018-11-10 01:10:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:03,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-10 01:10:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:03,681 INFO L225 Difference]: With dead ends: 458 [2018-11-10 01:10:03,681 INFO L226 Difference]: Without dead ends: 286 [2018-11-10 01:10:03,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-10 01:10:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-11-10 01:10:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-10 01:10:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 363 transitions. [2018-11-10 01:10:03,691 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 363 transitions. Word has length 213 [2018-11-10 01:10:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:03,691 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 363 transitions. [2018-11-10 01:10:03,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2018-11-10 01:10:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 01:10:03,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:03,693 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:03,694 INFO L424 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:03,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 615007881, now seen corresponding path program 1 times [2018-11-10 01:10:03,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-10 01:10:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:03,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:03,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:03,768 INFO L87 Difference]: Start difference. First operand 286 states and 363 transitions. Second operand 4 states. [2018-11-10 01:10:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:04,051 INFO L93 Difference]: Finished difference Result 778 states and 1041 transitions. [2018-11-10 01:10:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:04,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-11-10 01:10:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:04,055 INFO L225 Difference]: With dead ends: 778 [2018-11-10 01:10:04,055 INFO L226 Difference]: Without dead ends: 607 [2018-11-10 01:10:04,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-10 01:10:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 469. [2018-11-10 01:10:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-10 01:10:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 623 transitions. [2018-11-10 01:10:04,074 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 623 transitions. Word has length 213 [2018-11-10 01:10:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:04,075 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 623 transitions. [2018-11-10 01:10:04,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 623 transitions. [2018-11-10 01:10:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 01:10:04,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:04,078 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:04,078 INFO L424 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:04,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -82635610, now seen corresponding path program 1 times [2018-11-10 01:10:04,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-10 01:10:04,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:04,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:04,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:04,177 INFO L87 Difference]: Start difference. First operand 469 states and 623 transitions. Second operand 4 states. [2018-11-10 01:10:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:04,381 INFO L93 Difference]: Finished difference Result 1188 states and 1631 transitions. [2018-11-10 01:10:04,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:04,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-11-10 01:10:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:04,386 INFO L225 Difference]: With dead ends: 1188 [2018-11-10 01:10:04,386 INFO L226 Difference]: Without dead ends: 834 [2018-11-10 01:10:04,388 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 01:10:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-11-10 01:10:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 818. [2018-11-10 01:10:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-10 01:10:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1101 transitions. [2018-11-10 01:10:04,426 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1101 transitions. Word has length 250 [2018-11-10 01:10:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:04,426 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1101 transitions. [2018-11-10 01:10:04,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1101 transitions. [2018-11-10 01:10:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-10 01:10:04,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:04,430 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:04,430 INFO L424 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:04,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1187847361, now seen corresponding path program 1 times [2018-11-10 01:10:04,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-10 01:10:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:04,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:04,561 INFO L87 Difference]: Start difference. First operand 818 states and 1101 transitions. Second operand 4 states. [2018-11-10 01:10:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:04,820 INFO L93 Difference]: Finished difference Result 2163 states and 2988 transitions. [2018-11-10 01:10:04,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:04,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-11-10 01:10:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:04,826 INFO L225 Difference]: With dead ends: 2163 [2018-11-10 01:10:04,826 INFO L226 Difference]: Without dead ends: 1487 [2018-11-10 01:10:04,829 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 01:10:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-10 01:10:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1124. [2018-11-10 01:10:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-11-10 01:10:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1527 transitions. [2018-11-10 01:10:04,885 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1527 transitions. Word has length 251 [2018-11-10 01:10:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:04,886 INFO L481 AbstractCegarLoop]: Abstraction has 1124 states and 1527 transitions. [2018-11-10 01:10:04,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1527 transitions. [2018-11-10 01:10:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-10 01:10:04,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:04,890 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:04,890 INFO L424 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:04,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -257180575, now seen corresponding path program 1 times [2018-11-10 01:10:04,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:04,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:04,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-11-10 01:10:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:10:04,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:04,986 INFO L87 Difference]: Start difference. First operand 1124 states and 1527 transitions. Second operand 4 states. [2018-11-10 01:10:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:05,256 INFO L93 Difference]: Finished difference Result 3108 states and 4305 transitions. [2018-11-10 01:10:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:05,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-11-10 01:10:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:05,269 INFO L225 Difference]: With dead ends: 3108 [2018-11-10 01:10:05,270 INFO L226 Difference]: Without dead ends: 2126 [2018-11-10 01:10:05,273 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 01:10:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2018-11-10 01:10:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1413. [2018-11-10 01:10:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2018-11-10 01:10:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1931 transitions. [2018-11-10 01:10:05,366 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1931 transitions. Word has length 252 [2018-11-10 01:10:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:05,367 INFO L481 AbstractCegarLoop]: Abstraction has 1413 states and 1931 transitions. [2018-11-10 01:10:05,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1931 transitions. [2018-11-10 01:10:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-10 01:10:05,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:05,371 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 01:10:05,372 INFO L424 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:05,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:05,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1793803423, now seen corresponding path program 1 times [2018-11-10 01:10:05,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:05,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:05,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:05,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2018-11-10 01:10:05,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:05,500 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:05,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 123 proven. 11 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-10 01:10:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-10 01:10:05,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:10:05,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:10:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:10:05,771 INFO L87 Difference]: Start difference. First operand 1413 states and 1931 transitions. Second operand 10 states. [2018-11-10 01:10:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:06,081 INFO L93 Difference]: Finished difference Result 2915 states and 4019 transitions. [2018-11-10 01:10:06,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:10:06,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 252 [2018-11-10 01:10:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:06,088 INFO L225 Difference]: With dead ends: 2915 [2018-11-10 01:10:06,088 INFO L226 Difference]: Without dead ends: 1444 [2018-11-10 01:10:06,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:10:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-11-10 01:10:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2018-11-10 01:10:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-11-10 01:10:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1924 transitions. [2018-11-10 01:10:06,167 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1924 transitions. Word has length 252 [2018-11-10 01:10:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:06,167 INFO L481 AbstractCegarLoop]: Abstraction has 1444 states and 1924 transitions. [2018-11-10 01:10:06,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:10:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1924 transitions. [2018-11-10 01:10:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-11-10 01:10:06,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:06,173 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 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 01:10:06,173 INFO L424 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:06,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:06,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1864646498, now seen corresponding path program 1 times [2018-11-10 01:10:06,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:06,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:06,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-10 01:10:06,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:06,286 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:06,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:06,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2018-11-10 01:10:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 01:10:06,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:10:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:10:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:10:06,558 INFO L87 Difference]: Start difference. First operand 1444 states and 1924 transitions. Second operand 9 states. [2018-11-10 01:10:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:06,701 INFO L93 Difference]: Finished difference Result 2813 states and 3889 transitions. [2018-11-10 01:10:06,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:10:06,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 310 [2018-11-10 01:10:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:06,708 INFO L225 Difference]: With dead ends: 2813 [2018-11-10 01:10:06,708 INFO L226 Difference]: Without dead ends: 1503 [2018-11-10 01:10:06,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:10:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-11-10 01:10:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2018-11-10 01:10:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-11-10 01:10:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1969 transitions. [2018-11-10 01:10:06,787 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1969 transitions. Word has length 310 [2018-11-10 01:10:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:06,787 INFO L481 AbstractCegarLoop]: Abstraction has 1503 states and 1969 transitions. [2018-11-10 01:10:06,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:10:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1969 transitions. [2018-11-10 01:10:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-10 01:10:06,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:06,793 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 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, 3, 3, 3, 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] [2018-11-10 01:10:06,793 INFO L424 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:06,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2094689355, now seen corresponding path program 1 times [2018-11-10 01:10:06,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:06,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:06,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:06,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-10 01:10:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:06,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:10:06,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:10:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:10:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:10:06,911 INFO L87 Difference]: Start difference. First operand 1503 states and 1969 transitions. Second operand 3 states. [2018-11-10 01:10:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:06,981 INFO L93 Difference]: Finished difference Result 2582 states and 3405 transitions. [2018-11-10 01:10:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:10:06,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-11-10 01:10:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:06,988 INFO L225 Difference]: With dead ends: 2582 [2018-11-10 01:10:06,988 INFO L226 Difference]: Without dead ends: 1197 [2018-11-10 01:10:06,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:10:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-10 01:10:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2018-11-10 01:10:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2018-11-10 01:10:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1556 transitions. [2018-11-10 01:10:07,062 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1556 transitions. Word has length 311 [2018-11-10 01:10:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:07,063 INFO L481 AbstractCegarLoop]: Abstraction has 1197 states and 1556 transitions. [2018-11-10 01:10:07,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:10:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1556 transitions. [2018-11-10 01:10:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-10 01:10:07,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:07,069 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 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, 3, 3, 3, 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] [2018-11-10 01:10:07,069 INFO L424 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:07,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 668357316, now seen corresponding path program 1 times [2018-11-10 01:10:07,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:07,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2018-11-10 01:10:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:07,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:07,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2018-11-10 01:10:07,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:07,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-10 01:10:07,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:10:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:10:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:10:07,636 INFO L87 Difference]: Start difference. First operand 1197 states and 1556 transitions. Second operand 14 states. [2018-11-10 01:10:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:07,862 INFO L93 Difference]: Finished difference Result 1259 states and 1664 transitions. [2018-11-10 01:10:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:10:07,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-11-10 01:10:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:07,868 INFO L225 Difference]: With dead ends: 1259 [2018-11-10 01:10:07,868 INFO L226 Difference]: Without dead ends: 1257 [2018-11-10 01:10:07,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-10 01:10:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2018-11-10 01:10:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1221. [2018-11-10 01:10:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2018-11-10 01:10:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1583 transitions. [2018-11-10 01:10:07,932 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1583 transitions. Word has length 311 [2018-11-10 01:10:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:07,932 INFO L481 AbstractCegarLoop]: Abstraction has 1221 states and 1583 transitions. [2018-11-10 01:10:07,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:10:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1583 transitions. [2018-11-10 01:10:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-10 01:10:07,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:07,936 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2018-11-10 01:10:07,936 INFO L424 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:07,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -623564782, now seen corresponding path program 1 times [2018-11-10 01:10:07,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:07,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:07,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:07,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 190 proven. 30 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2018-11-10 01:10:08,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:08,184 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:08,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:08,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 299 proven. 36 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-11-10 01:10:08,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:08,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-11-10 01:10:08,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 01:10:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 01:10:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:10:08,638 INFO L87 Difference]: Start difference. First operand 1221 states and 1583 transitions. Second operand 21 states. [2018-11-10 01:10:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:11,738 INFO L93 Difference]: Finished difference Result 4400 states and 5870 transitions. [2018-11-10 01:10:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 01:10:11,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 319 [2018-11-10 01:10:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:11,751 INFO L225 Difference]: With dead ends: 4400 [2018-11-10 01:10:11,752 INFO L226 Difference]: Without dead ends: 3351 [2018-11-10 01:10:11,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 321 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 01:10:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2018-11-10 01:10:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 2918. [2018-11-10 01:10:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2918 states. [2018-11-10 01:10:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 3866 transitions. [2018-11-10 01:10:11,918 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 3866 transitions. Word has length 319 [2018-11-10 01:10:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:11,919 INFO L481 AbstractCegarLoop]: Abstraction has 2918 states and 3866 transitions. [2018-11-10 01:10:11,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 01:10:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3866 transitions. [2018-11-10 01:10:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-11-10 01:10:11,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:11,923 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2018-11-10 01:10:11,923 INFO L424 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:11,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:11,924 INFO L82 PathProgramCache]: Analyzing trace with hash 69536915, now seen corresponding path program 1 times [2018-11-10 01:10:11,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:11,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:11,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-11-10 01:10:12,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:12,034 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:12,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:12,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2018-11-10 01:10:12,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:12,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 01:10:12,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:12,222 INFO L87 Difference]: Start difference. First operand 2918 states and 3866 transitions. Second operand 4 states. [2018-11-10 01:10:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:12,343 INFO L93 Difference]: Finished difference Result 4624 states and 6009 transitions. [2018-11-10 01:10:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:12,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-11-10 01:10:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:12,350 INFO L225 Difference]: With dead ends: 4624 [2018-11-10 01:10:12,350 INFO L226 Difference]: Without dead ends: 2405 [2018-11-10 01:10:12,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2018-11-10 01:10:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2018-11-10 01:10:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2018-11-10 01:10:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3035 transitions. [2018-11-10 01:10:12,428 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3035 transitions. Word has length 319 [2018-11-10 01:10:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:12,428 INFO L481 AbstractCegarLoop]: Abstraction has 2405 states and 3035 transitions. [2018-11-10 01:10:12,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3035 transitions. [2018-11-10 01:10:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-10 01:10:12,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:12,431 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 3, 3, 3, 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 01:10:12,431 INFO L424 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:12,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1387885378, now seen corresponding path program 1 times [2018-11-10 01:10:12,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-10 01:10:12,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:12,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:10:12,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:10:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:10:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:10:12,537 INFO L87 Difference]: Start difference. First operand 2405 states and 3035 transitions. Second operand 10 states. [2018-11-10 01:10:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:12,931 INFO L93 Difference]: Finished difference Result 5147 states and 6581 transitions. [2018-11-10 01:10:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:10:12,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 334 [2018-11-10 01:10:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:12,969 INFO L225 Difference]: With dead ends: 5147 [2018-11-10 01:10:12,969 INFO L226 Difference]: Without dead ends: 3660 [2018-11-10 01:10:12,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-10 01:10:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2018-11-10 01:10:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3320. [2018-11-10 01:10:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3320 states. [2018-11-10 01:10:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4232 transitions. [2018-11-10 01:10:13,090 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4232 transitions. Word has length 334 [2018-11-10 01:10:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:13,091 INFO L481 AbstractCegarLoop]: Abstraction has 3320 states and 4232 transitions. [2018-11-10 01:10:13,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:10:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4232 transitions. [2018-11-10 01:10:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-10 01:10:13,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:13,094 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 3, 3, 3, 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 01:10:13,094 INFO L424 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:13,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash 520572412, now seen corresponding path program 1 times [2018-11-10 01:10:13,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:13,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:13,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:13,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:13,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-10 01:10:13,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:13,212 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:13,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:13,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-10 01:10:13,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:13,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-10 01:10:13,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:10:13,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:10:13,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:10:13,421 INFO L87 Difference]: Start difference. First operand 3320 states and 4232 transitions. Second operand 14 states. [2018-11-10 01:10:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:15,369 INFO L93 Difference]: Finished difference Result 5918 states and 7493 transitions. [2018-11-10 01:10:15,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 01:10:15,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 334 [2018-11-10 01:10:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:15,380 INFO L225 Difference]: With dead ends: 5918 [2018-11-10 01:10:15,380 INFO L226 Difference]: Without dead ends: 3345 [2018-11-10 01:10:15,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:10:15,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2018-11-10 01:10:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 2681. [2018-11-10 01:10:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2681 states. [2018-11-10 01:10:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3296 transitions. [2018-11-10 01:10:15,467 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3296 transitions. Word has length 334 [2018-11-10 01:10:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:15,467 INFO L481 AbstractCegarLoop]: Abstraction has 2681 states and 3296 transitions. [2018-11-10 01:10:15,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:10:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3296 transitions. [2018-11-10 01:10:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-10 01:10:15,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:15,470 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 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, 3, 3, 3, 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 01:10:15,470 INFO L424 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:15,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1787398270, now seen corresponding path program 1 times [2018-11-10 01:10:15,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:15,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:15,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:15,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:15,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2018-11-10 01:10:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:15,572 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:15,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:15,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-10 01:10:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:15,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-10 01:10:15,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:10:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:10:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:10:15,809 INFO L87 Difference]: Start difference. First operand 2681 states and 3296 transitions. Second operand 14 states. [2018-11-10 01:10:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:17,627 INFO L93 Difference]: Finished difference Result 4935 states and 6081 transitions. [2018-11-10 01:10:17,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 01:10:17,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 335 [2018-11-10 01:10:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:17,635 INFO L225 Difference]: With dead ends: 4935 [2018-11-10 01:10:17,635 INFO L226 Difference]: Without dead ends: 2797 [2018-11-10 01:10:17,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 01:10:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2018-11-10 01:10:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2432. [2018-11-10 01:10:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2018-11-10 01:10:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 2957 transitions. [2018-11-10 01:10:17,762 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 2957 transitions. Word has length 335 [2018-11-10 01:10:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:17,763 INFO L481 AbstractCegarLoop]: Abstraction has 2432 states and 2957 transitions. [2018-11-10 01:10:17,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:10:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 2957 transitions. [2018-11-10 01:10:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-10 01:10:17,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:17,765 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:10:17,766 INFO L424 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:17,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1325466038, now seen corresponding path program 1 times [2018-11-10 01:10:17,766 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:17,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:17,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:17,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2018-11-10 01:10:17,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:17,931 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/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 01:10:17,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-10 01:10:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-11-10 01:10:18,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 01:10:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 01:10:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:10:18,255 INFO L87 Difference]: Start difference. First operand 2432 states and 2957 transitions. Second operand 21 states. [2018-11-10 01:10:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:23,796 INFO L93 Difference]: Finished difference Result 7706 states and 9626 transitions. [2018-11-10 01:10:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-10 01:10:23,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 340 [2018-11-10 01:10:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:23,811 INFO L225 Difference]: With dead ends: 7706 [2018-11-10 01:10:23,811 INFO L226 Difference]: Without dead ends: 5721 [2018-11-10 01:10:23,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=4254, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 01:10:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2018-11-10 01:10:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 2678. [2018-11-10 01:10:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2018-11-10 01:10:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 3206 transitions. [2018-11-10 01:10:23,999 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 3206 transitions. Word has length 340 [2018-11-10 01:10:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:23,999 INFO L481 AbstractCegarLoop]: Abstraction has 2678 states and 3206 transitions. [2018-11-10 01:10:23,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 01:10:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3206 transitions. [2018-11-10 01:10:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-10 01:10:24,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:24,002 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:10:24,002 INFO L424 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:24,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:24,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1263426424, now seen corresponding path program 1 times [2018-11-10 01:10:24,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:24,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:24,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-11-10 01:10:24,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:24,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:10:24,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:10:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:10:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:10:24,152 INFO L87 Difference]: Start difference. First operand 2678 states and 3206 transitions. Second operand 10 states. [2018-11-10 01:10:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:25,076 INFO L93 Difference]: Finished difference Result 6524 states and 7889 transitions. [2018-11-10 01:10:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:10:25,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 340 [2018-11-10 01:10:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:25,088 INFO L225 Difference]: With dead ends: 6524 [2018-11-10 01:10:25,089 INFO L226 Difference]: Without dead ends: 4317 [2018-11-10 01:10:25,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:10:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2018-11-10 01:10:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 2645. [2018-11-10 01:10:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-11-10 01:10:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3146 transitions. [2018-11-10 01:10:25,261 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3146 transitions. Word has length 340 [2018-11-10 01:10:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:25,261 INFO L481 AbstractCegarLoop]: Abstraction has 2645 states and 3146 transitions. [2018-11-10 01:10:25,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:10:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3146 transitions. [2018-11-10 01:10:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-10 01:10:25,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:25,264 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:10:25,264 INFO L424 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:25,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1656453434, now seen corresponding path program 1 times [2018-11-10 01:10:25,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:25,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:25,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2018-11-10 01:10:25,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:25,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:10:25,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:10:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:10:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:10:25,408 INFO L87 Difference]: Start difference. First operand 2645 states and 3146 transitions. Second operand 6 states. [2018-11-10 01:10:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:25,794 INFO L93 Difference]: Finished difference Result 5962 states and 7548 transitions. [2018-11-10 01:10:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:10:25,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2018-11-10 01:10:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:25,803 INFO L225 Difference]: With dead ends: 5962 [2018-11-10 01:10:25,803 INFO L226 Difference]: Without dead ends: 3869 [2018-11-10 01:10:25,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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 01:10:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2018-11-10 01:10:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 2774. [2018-11-10 01:10:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-11-10 01:10:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3338 transitions. [2018-11-10 01:10:25,918 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3338 transitions. Word has length 340 [2018-11-10 01:10:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:25,918 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 3338 transitions. [2018-11-10 01:10:25,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:10:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3338 transitions. [2018-11-10 01:10:25,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-10 01:10:25,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:25,923 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 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, 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] [2018-11-10 01:10:25,923 INFO L424 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:25,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:25,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1749362312, now seen corresponding path program 1 times [2018-11-10 01:10:25,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:25,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-11-10 01:10:26,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:26,098 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:10:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:26,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 229 proven. 96 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-11-10 01:10:26,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:26,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-10 01:10:26,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 01:10:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 01:10:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-11-10 01:10:26,497 INFO L87 Difference]: Start difference. First operand 2774 states and 3338 transitions. Second operand 24 states. [2018-11-10 01:10:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:34,066 INFO L93 Difference]: Finished difference Result 10303 states and 12909 transitions. [2018-11-10 01:10:34,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-11-10 01:10:34,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 413 [2018-11-10 01:10:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:34,083 INFO L225 Difference]: With dead ends: 10303 [2018-11-10 01:10:34,083 INFO L226 Difference]: Without dead ends: 8081 [2018-11-10 01:10:34,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2231, Invalid=17229, Unknown=0, NotChecked=0, Total=19460 [2018-11-10 01:10:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8081 states. [2018-11-10 01:10:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8081 to 6710. [2018-11-10 01:10:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-10 01:10:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8111 transitions. [2018-11-10 01:10:34,417 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8111 transitions. Word has length 413 [2018-11-10 01:10:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:34,417 INFO L481 AbstractCegarLoop]: Abstraction has 6710 states and 8111 transitions. [2018-11-10 01:10:34,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 01:10:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8111 transitions. [2018-11-10 01:10:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-11-10 01:10:34,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:34,425 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 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, 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] [2018-11-10 01:10:34,425 INFO L424 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:34,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1040973977, now seen corresponding path program 1 times [2018-11-10 01:10:34,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:34,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:34,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2018-11-10 01:10:34,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:34,524 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:10:34,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:34,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1021 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2018-11-10 01:10:34,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:34,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-10 01:10:34,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:10:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:34,762 INFO L87 Difference]: Start difference. First operand 6710 states and 8111 transitions. Second operand 4 states. [2018-11-10 01:10:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:35,143 INFO L93 Difference]: Finished difference Result 13328 states and 16127 transitions. [2018-11-10 01:10:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:35,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2018-11-10 01:10:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:35,154 INFO L225 Difference]: With dead ends: 13328 [2018-11-10 01:10:35,154 INFO L226 Difference]: Without dead ends: 6646 [2018-11-10 01:10:35,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2018-11-10 01:10:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 6646. [2018-11-10 01:10:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6646 states. [2018-11-10 01:10:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 7827 transitions. [2018-11-10 01:10:35,530 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 7827 transitions. Word has length 413 [2018-11-10 01:10:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:35,531 INFO L481 AbstractCegarLoop]: Abstraction has 6646 states and 7827 transitions. [2018-11-10 01:10:35,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:10:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 7827 transitions. [2018-11-10 01:10:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-10 01:10:35,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:35,540 INFO L375 BasicCegarLoop]: trace histogram [16, 12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:10:35,540 INFO L424 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:35,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1273878881, now seen corresponding path program 1 times [2018-11-10 01:10:35,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:35,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2018-11-10 01:10:35,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:35,828 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:10:35,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:36,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 195 proven. 120 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-10 01:10:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2018-11-10 01:10:36,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-10 01:10:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 01:10:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-11-10 01:10:36,268 INFO L87 Difference]: Start difference. First operand 6646 states and 7827 transitions. Second operand 28 states. [2018-11-10 01:10:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:47,768 INFO L93 Difference]: Finished difference Result 18792 states and 22308 transitions. [2018-11-10 01:10:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-11-10 01:10:47,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 414 [2018-11-10 01:10:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:47,785 INFO L225 Difference]: With dead ends: 18792 [2018-11-10 01:10:47,785 INFO L226 Difference]: Without dead ends: 12826 [2018-11-10 01:10:47,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17344 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4499, Invalid=42373, Unknown=0, NotChecked=0, Total=46872 [2018-11-10 01:10:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12826 states. [2018-11-10 01:10:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12826 to 10073. [2018-11-10 01:10:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10073 states. [2018-11-10 01:10:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10073 states to 10073 states and 11864 transitions. [2018-11-10 01:10:48,321 INFO L78 Accepts]: Start accepts. Automaton has 10073 states and 11864 transitions. Word has length 414 [2018-11-10 01:10:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:48,322 INFO L481 AbstractCegarLoop]: Abstraction has 10073 states and 11864 transitions. [2018-11-10 01:10:48,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-10 01:10:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 10073 states and 11864 transitions. [2018-11-10 01:10:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-11-10 01:10:48,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:48,334 INFO L375 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 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, 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] [2018-11-10 01:10:48,334 INFO L424 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:48,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash -837886977, now seen corresponding path program 1 times [2018-11-10 01:10:48,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 34 proven. 280 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2018-11-10 01:10:48,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:48,651 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:10:48,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:48,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2018-11-10 01:10:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:10:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2018-11-10 01:10:48,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 01:10:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 01:10:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:10:48,995 INFO L87 Difference]: Start difference. First operand 10073 states and 11864 transitions. Second operand 21 states. [2018-11-10 01:10:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:52,191 INFO L93 Difference]: Finished difference Result 21510 states and 25292 transitions. [2018-11-10 01:10:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 01:10:52,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 423 [2018-11-10 01:10:52,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:10:52,215 INFO L225 Difference]: With dead ends: 21510 [2018-11-10 01:10:52,215 INFO L226 Difference]: Without dead ends: 11945 [2018-11-10 01:10:52,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 01:10:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-11-10 01:10:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 10132. [2018-11-10 01:10:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2018-11-10 01:10:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 11910 transitions. [2018-11-10 01:10:52,795 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 11910 transitions. Word has length 423 [2018-11-10 01:10:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:10:52,795 INFO L481 AbstractCegarLoop]: Abstraction has 10132 states and 11910 transitions. [2018-11-10 01:10:52,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 01:10:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 11910 transitions. [2018-11-10 01:10:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-10 01:10:52,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:10:52,805 INFO L375 BasicCegarLoop]: trace histogram [16, 14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 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, 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] [2018-11-10 01:10:52,805 INFO L424 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:10:52,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1992317665, now seen corresponding path program 1 times [2018-11-10 01:10:52,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-10 01:10:53,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:53,005 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:10:53,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:53,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 523 proven. 208 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-11-10 01:10:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25] total 36 [2018-11-10 01:10:53,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 01:10:53,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 01:10:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 01:10:53,826 INFO L87 Difference]: Start difference. First operand 10132 states and 11910 transitions. Second operand 36 states. [2018-11-10 01:11:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:01,539 INFO L93 Difference]: Finished difference Result 23503 states and 27771 transitions. [2018-11-10 01:11:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-11-10 01:11:01,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 434 [2018-11-10 01:11:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:01,560 INFO L225 Difference]: With dead ends: 23503 [2018-11-10 01:11:01,560 INFO L226 Difference]: Without dead ends: 14115 [2018-11-10 01:11:01,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 442 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4604 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1468, Invalid=13294, Unknown=0, NotChecked=0, Total=14762 [2018-11-10 01:11:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14115 states. [2018-11-10 01:11:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14115 to 10138. [2018-11-10 01:11:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10138 states. [2018-11-10 01:11:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10138 states to 10138 states and 11909 transitions. [2018-11-10 01:11:02,211 INFO L78 Accepts]: Start accepts. Automaton has 10138 states and 11909 transitions. Word has length 434 [2018-11-10 01:11:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:02,211 INFO L481 AbstractCegarLoop]: Abstraction has 10138 states and 11909 transitions. [2018-11-10 01:11:02,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 01:11:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 10138 states and 11909 transitions. [2018-11-10 01:11:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-11-10 01:11:02,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:02,224 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:11:02,224 INFO L424 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:02,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1067504032, now seen corresponding path program 1 times [2018-11-10 01:11:02,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:02,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:02,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:02,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-10 01:11:02,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:11:02,522 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:11:02,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:02,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:11:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 627 proven. 238 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-11-10 01:11:03,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:11:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24] total 35 [2018-11-10 01:11:03,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 01:11:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 01:11:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:11:03,291 INFO L87 Difference]: Start difference. First operand 10138 states and 11909 transitions. Second operand 35 states. [2018-11-10 01:11:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:10,992 INFO L93 Difference]: Finished difference Result 23494 states and 27753 transitions. [2018-11-10 01:11:10,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-10 01:11:10,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 446 [2018-11-10 01:11:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:11,012 INFO L225 Difference]: With dead ends: 23494 [2018-11-10 01:11:11,012 INFO L226 Difference]: Without dead ends: 14106 [2018-11-10 01:11:11,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 452 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1412, Invalid=13594, Unknown=0, NotChecked=0, Total=15006 [2018-11-10 01:11:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14106 states. [2018-11-10 01:11:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14106 to 10133. [2018-11-10 01:11:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10133 states. [2018-11-10 01:11:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10133 states to 10133 states and 11897 transitions. [2018-11-10 01:11:11,754 INFO L78 Accepts]: Start accepts. Automaton has 10133 states and 11897 transitions. Word has length 446 [2018-11-10 01:11:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:11,754 INFO L481 AbstractCegarLoop]: Abstraction has 10133 states and 11897 transitions. [2018-11-10 01:11:11,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 01:11:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 10133 states and 11897 transitions. [2018-11-10 01:11:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-10 01:11:11,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:11,762 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 01:11:11,762 INFO L424 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:11,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash -183645274, now seen corresponding path program 1 times [2018-11-10 01:11:11,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:11,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:11,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:11,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:11,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2018-11-10 01:11:11,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:11:11,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:11:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:12,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:11:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 409 proven. 63 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2018-11-10 01:11:12,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:11:12,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2018-11-10 01:11:12,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:11:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:11:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:11:12,249 INFO L87 Difference]: Start difference. First operand 10133 states and 11897 transitions. Second operand 11 states. [2018-11-10 01:11:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:13,057 INFO L93 Difference]: Finished difference Result 14645 states and 17200 transitions. [2018-11-10 01:11:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:11:13,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 472 [2018-11-10 01:11:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:13,065 INFO L225 Difference]: With dead ends: 14645 [2018-11-10 01:11:13,066 INFO L226 Difference]: Without dead ends: 5177 [2018-11-10 01:11:13,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:11:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2018-11-10 01:11:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 5177. [2018-11-10 01:11:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5177 states. [2018-11-10 01:11:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 6035 transitions. [2018-11-10 01:11:13,396 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 6035 transitions. Word has length 472 [2018-11-10 01:11:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:13,397 INFO L481 AbstractCegarLoop]: Abstraction has 5177 states and 6035 transitions. [2018-11-10 01:11:13,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:11:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 6035 transitions. [2018-11-10 01:11:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-10 01:11:13,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:13,402 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:11:13,402 INFO L424 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:13,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash 134301807, now seen corresponding path program 1 times [2018-11-10 01:11:13,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:13,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:13,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-11-10 01:11:13,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:11:13,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 01:11:13,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 01:11:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:11:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:11:13,611 INFO L87 Difference]: Start difference. First operand 5177 states and 6035 transitions. Second operand 10 states. [2018-11-10 01:11:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:14,572 INFO L93 Difference]: Finished difference Result 11328 states and 13529 transitions. [2018-11-10 01:11:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 01:11:14,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 470 [2018-11-10 01:11:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:14,580 INFO L225 Difference]: With dead ends: 11328 [2018-11-10 01:11:14,580 INFO L226 Difference]: Without dead ends: 6879 [2018-11-10 01:11:14,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:11:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6879 states. [2018-11-10 01:11:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6879 to 5229. [2018-11-10 01:11:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5229 states. [2018-11-10 01:11:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5229 states to 5229 states and 6143 transitions. [2018-11-10 01:11:14,928 INFO L78 Accepts]: Start accepts. Automaton has 5229 states and 6143 transitions. Word has length 470 [2018-11-10 01:11:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:14,928 INFO L481 AbstractCegarLoop]: Abstraction has 5229 states and 6143 transitions. [2018-11-10 01:11:14,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 01:11:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5229 states and 6143 transitions. [2018-11-10 01:11:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-10 01:11:14,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:14,933 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:11:14,933 INFO L424 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1584804319, now seen corresponding path program 1 times [2018-11-10 01:11:14,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2018-11-10 01:11:15,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:11:15,296 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:11:15,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:15,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:11:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 409 proven. 4 refuted. 0 times theorem prover too weak. 913 trivial. 0 not checked. [2018-11-10 01:11:15,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:11:15,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2018-11-10 01:11:15,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 01:11:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 01:11:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:11:15,630 INFO L87 Difference]: Start difference. First operand 5229 states and 6143 transitions. Second operand 22 states. [2018-11-10 01:11:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:17,250 INFO L93 Difference]: Finished difference Result 10025 states and 11822 transitions. [2018-11-10 01:11:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 01:11:17,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 471 [2018-11-10 01:11:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:17,259 INFO L225 Difference]: With dead ends: 10025 [2018-11-10 01:11:17,259 INFO L226 Difference]: Without dead ends: 5285 [2018-11-10 01:11:17,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 475 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 01:11:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2018-11-10 01:11:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 5245. [2018-11-10 01:11:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5245 states. [2018-11-10 01:11:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 6155 transitions. [2018-11-10 01:11:17,691 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 6155 transitions. Word has length 471 [2018-11-10 01:11:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:17,692 INFO L481 AbstractCegarLoop]: Abstraction has 5245 states and 6155 transitions. [2018-11-10 01:11:17,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 01:11:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 6155 transitions. [2018-11-10 01:11:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-10 01:11:17,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:17,696 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:11:17,696 INFO L424 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:17,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1060778943, now seen corresponding path program 1 times [2018-11-10 01:11:17,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:17,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2018-11-10 01:11:17,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:11:17,968 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:11:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:18,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:11:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 404 proven. 162 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-10 01:11:18,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:11:18,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-11-10 01:11:18,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 01:11:18,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 01:11:18,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:11:18,425 INFO L87 Difference]: Start difference. First operand 5245 states and 6155 transitions. Second operand 35 states. [2018-11-10 01:11:44,680 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-10 01:11:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:52,420 INFO L93 Difference]: Finished difference Result 40973 states and 49223 transitions. [2018-11-10 01:11:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 558 states. [2018-11-10 01:11:52,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 472 [2018-11-10 01:11:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:52,466 INFO L225 Difference]: With dead ends: 40973 [2018-11-10 01:11:52,466 INFO L226 Difference]: Without dead ends: 36460 [2018-11-10 01:11:52,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1207 GetRequests, 616 SyntacticMatches, 2 SemanticMatches, 589 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153092 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=17779, Invalid=330911, Unknown=0, NotChecked=0, Total=348690 [2018-11-10 01:11:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36460 states. [2018-11-10 01:11:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36460 to 12933. [2018-11-10 01:11:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12933 states. [2018-11-10 01:11:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12933 states to 12933 states and 15098 transitions. [2018-11-10 01:11:53,659 INFO L78 Accepts]: Start accepts. Automaton has 12933 states and 15098 transitions. Word has length 472 [2018-11-10 01:11:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:11:53,660 INFO L481 AbstractCegarLoop]: Abstraction has 12933 states and 15098 transitions. [2018-11-10 01:11:53,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 01:11:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 12933 states and 15098 transitions. [2018-11-10 01:11:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-10 01:11:53,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:11:53,676 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:11:53,676 INFO L424 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:11:53,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:11:53,676 INFO L82 PathProgramCache]: Analyzing trace with hash -307675348, now seen corresponding path program 1 times [2018-11-10 01:11:53,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:11:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:11:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:11:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2018-11-10 01:11:53,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:11:53,944 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:11:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:11:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:11:54,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:11:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 519 proven. 36 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-10 01:11:54,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:11:54,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2018-11-10 01:11:54,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 01:11:54,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 01:11:54,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:11:54,467 INFO L87 Difference]: Start difference. First operand 12933 states and 15098 transitions. Second operand 25 states. [2018-11-10 01:11:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:11:58,915 INFO L93 Difference]: Finished difference Result 31795 states and 37308 transitions. [2018-11-10 01:11:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 01:11:58,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 472 [2018-11-10 01:11:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:11:58,950 INFO L225 Difference]: With dead ends: 31795 [2018-11-10 01:11:58,950 INFO L226 Difference]: Without dead ends: 19799 [2018-11-10 01:11:58,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=492, Invalid=2588, Unknown=0, NotChecked=0, Total=3080 [2018-11-10 01:11:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19799 states. [2018-11-10 01:12:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19799 to 12933. [2018-11-10 01:12:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12933 states. [2018-11-10 01:12:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12933 states to 12933 states and 15098 transitions. [2018-11-10 01:12:00,075 INFO L78 Accepts]: Start accepts. Automaton has 12933 states and 15098 transitions. Word has length 472 [2018-11-10 01:12:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:00,075 INFO L481 AbstractCegarLoop]: Abstraction has 12933 states and 15098 transitions. [2018-11-10 01:12:00,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 01:12:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 12933 states and 15098 transitions. [2018-11-10 01:12:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-10 01:12:00,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:00,086 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:12:00,086 INFO L424 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:00,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -349803106, now seen corresponding path program 1 times [2018-11-10 01:12:00,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2018-11-10 01:12:00,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:00,298 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:00,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 519 proven. 36 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-10 01:12:00,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:00,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-10 01:12:00,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 01:12:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 01:12:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:12:00,887 INFO L87 Difference]: Start difference. First operand 12933 states and 15098 transitions. Second operand 26 states. [2018-11-10 01:12:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:05,140 INFO L93 Difference]: Finished difference Result 31775 states and 37288 transitions. [2018-11-10 01:12:05,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 01:12:05,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 473 [2018-11-10 01:12:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:05,169 INFO L225 Difference]: With dead ends: 31775 [2018-11-10 01:12:05,169 INFO L226 Difference]: Without dead ends: 19779 [2018-11-10 01:12:05,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2018-11-10 01:12:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19779 states. [2018-11-10 01:12:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19779 to 12919. [2018-11-10 01:12:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12919 states. [2018-11-10 01:12:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12919 states to 12919 states and 15084 transitions. [2018-11-10 01:12:06,429 INFO L78 Accepts]: Start accepts. Automaton has 12919 states and 15084 transitions. Word has length 473 [2018-11-10 01:12:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:06,430 INFO L481 AbstractCegarLoop]: Abstraction has 12919 states and 15084 transitions. [2018-11-10 01:12:06,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 01:12:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 12919 states and 15084 transitions. [2018-11-10 01:12:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-11-10 01:12:06,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:06,439 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:12:06,439 INFO L424 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:06,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1452332764, now seen corresponding path program 1 times [2018-11-10 01:12:06,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:06,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:06,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:06,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2018-11-10 01:12:06,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:06,572 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:06,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:06,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 428 proven. 67 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-10 01:12:06,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:06,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-10 01:12:06,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:12:06,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:12:06,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:12:06,897 INFO L87 Difference]: Start difference. First operand 12919 states and 15084 transitions. Second operand 13 states. [2018-11-10 01:12:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:08,461 INFO L93 Difference]: Finished difference Result 19654 states and 22988 transitions. [2018-11-10 01:12:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 01:12:08,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 473 [2018-11-10 01:12:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:08,472 INFO L225 Difference]: With dead ends: 19654 [2018-11-10 01:12:08,472 INFO L226 Difference]: Without dead ends: 7289 [2018-11-10 01:12:08,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-10 01:12:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7289 states. [2018-11-10 01:12:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7289 to 7237. [2018-11-10 01:12:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7237 states. [2018-11-10 01:12:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7237 states to 7237 states and 8432 transitions. [2018-11-10 01:12:09,159 INFO L78 Accepts]: Start accepts. Automaton has 7237 states and 8432 transitions. Word has length 473 [2018-11-10 01:12:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:09,160 INFO L481 AbstractCegarLoop]: Abstraction has 7237 states and 8432 transitions. [2018-11-10 01:12:09,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:12:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7237 states and 8432 transitions. [2018-11-10 01:12:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-11-10 01:12:09,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:09,166 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 10, 10, 10, 9, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-11-10 01:12:09,166 INFO L424 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:09,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1289918935, now seen corresponding path program 1 times [2018-11-10 01:12:09,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:09,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:09,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:09,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1293 trivial. 0 not checked. [2018-11-10 01:12:09,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:12:09,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:12:09,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:12:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:12:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:12:09,387 INFO L87 Difference]: Start difference. First operand 7237 states and 8432 transitions. Second operand 11 states. [2018-11-10 01:12:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:11,166 INFO L93 Difference]: Finished difference Result 15959 states and 19002 transitions. [2018-11-10 01:12:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 01:12:11,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 472 [2018-11-10 01:12:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:11,179 INFO L225 Difference]: With dead ends: 15959 [2018-11-10 01:12:11,179 INFO L226 Difference]: Without dead ends: 9431 [2018-11-10 01:12:11,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 01:12:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9431 states. [2018-11-10 01:12:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9431 to 5342. [2018-11-10 01:12:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5342 states. [2018-11-10 01:12:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 6149 transitions. [2018-11-10 01:12:11,772 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 6149 transitions. Word has length 472 [2018-11-10 01:12:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:11,772 INFO L481 AbstractCegarLoop]: Abstraction has 5342 states and 6149 transitions. [2018-11-10 01:12:11,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:12:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 6149 transitions. [2018-11-10 01:12:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-11-10 01:12:11,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:11,778 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:12:11,778 INFO L424 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:11,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash 842987676, now seen corresponding path program 1 times [2018-11-10 01:12:11,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:11,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2018-11-10 01:12:11,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:11,907 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:11,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:12,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2018-11-10 01:12:12,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:12:12,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-11-10 01:12:12,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:12:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:12:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:12:12,205 INFO L87 Difference]: Start difference. First operand 5342 states and 6149 transitions. Second operand 13 states. [2018-11-10 01:12:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:13,609 INFO L93 Difference]: Finished difference Result 12727 states and 14823 transitions. [2018-11-10 01:12:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:12:13,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 481 [2018-11-10 01:12:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:13,619 INFO L225 Difference]: With dead ends: 12727 [2018-11-10 01:12:13,620 INFO L226 Difference]: Without dead ends: 8094 [2018-11-10 01:12:13,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:12:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8094 states. [2018-11-10 01:12:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8094 to 5202. [2018-11-10 01:12:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2018-11-10 01:12:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 5925 transitions. [2018-11-10 01:12:14,278 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 5925 transitions. Word has length 481 [2018-11-10 01:12:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:14,278 INFO L481 AbstractCegarLoop]: Abstraction has 5202 states and 5925 transitions. [2018-11-10 01:12:14,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:12:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 5925 transitions. [2018-11-10 01:12:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-11-10 01:12:14,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:14,283 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:12:14,283 INFO L424 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:14,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 780948062, now seen corresponding path program 1 times [2018-11-10 01:12:14,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:14,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-11-10 01:12:14,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:14,415 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:14,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:14,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-11-10 01:12:14,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:12:14,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2018-11-10 01:12:14,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:12:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:12:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:12:14,662 INFO L87 Difference]: Start difference. First operand 5202 states and 5925 transitions. Second operand 14 states. [2018-11-10 01:12:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:16,765 INFO L93 Difference]: Finished difference Result 14791 states and 17177 transitions. [2018-11-10 01:12:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 01:12:16,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 481 [2018-11-10 01:12:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:16,779 INFO L225 Difference]: With dead ends: 14791 [2018-11-10 01:12:16,779 INFO L226 Difference]: Without dead ends: 10318 [2018-11-10 01:12:16,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 482 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-11-10 01:12:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10318 states. [2018-11-10 01:12:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10318 to 5294. [2018-11-10 01:12:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2018-11-10 01:12:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 5921 transitions. [2018-11-10 01:12:17,394 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 5921 transitions. Word has length 481 [2018-11-10 01:12:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:17,394 INFO L481 AbstractCegarLoop]: Abstraction has 5294 states and 5921 transitions. [2018-11-10 01:12:17,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:12:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 5921 transitions. [2018-11-10 01:12:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-10 01:12:17,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:17,399 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-10 01:12:17,399 INFO L424 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:17,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1703524186, now seen corresponding path program 1 times [2018-11-10 01:12:17,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:17,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:17,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2018-11-10 01:12:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:17,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:17,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:17,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 471 proven. 9 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-10 01:12:18,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:18,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 25 [2018-11-10 01:12:18,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-10 01:12:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 01:12:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:12:18,357 INFO L87 Difference]: Start difference. First operand 5294 states and 5921 transitions. Second operand 25 states. [2018-11-10 01:12:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:20,698 INFO L93 Difference]: Finished difference Result 10269 states and 11521 transitions. [2018-11-10 01:12:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 01:12:20,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 483 [2018-11-10 01:12:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:20,707 INFO L225 Difference]: With dead ends: 10269 [2018-11-10 01:12:20,708 INFO L226 Difference]: Without dead ends: 5394 [2018-11-10 01:12:20,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 485 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2465, Unknown=0, NotChecked=0, Total=3080 [2018-11-10 01:12:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2018-11-10 01:12:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 5324. [2018-11-10 01:12:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2018-11-10 01:12:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 5946 transitions. [2018-11-10 01:12:21,310 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 5946 transitions. Word has length 483 [2018-11-10 01:12:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:21,311 INFO L481 AbstractCegarLoop]: Abstraction has 5324 states and 5946 transitions. [2018-11-10 01:12:21,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-10 01:12:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 5946 transitions. [2018-11-10 01:12:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-10 01:12:21,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:21,315 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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 01:12:21,315 INFO L424 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:21,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1292886379, now seen corresponding path program 1 times [2018-11-10 01:12:21,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:21,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:21,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 59 proven. 72 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2018-11-10 01:12:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:21,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:21,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:21,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 533 proven. 98 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-11-10 01:12:21,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:21,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-10 01:12:21,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 01:12:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 01:12:21,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:12:21,963 INFO L87 Difference]: Start difference. First operand 5324 states and 5946 transitions. Second operand 18 states. [2018-11-10 01:12:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:24,965 INFO L93 Difference]: Finished difference Result 8515 states and 9569 transitions. [2018-11-10 01:12:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-10 01:12:24,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 483 [2018-11-10 01:12:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:24,970 INFO L225 Difference]: With dead ends: 8515 [2018-11-10 01:12:24,970 INFO L226 Difference]: Without dead ends: 3946 [2018-11-10 01:12:24,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 490 SyntacticMatches, 22 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2018-11-10 01:12:24,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2018-11-10 01:12:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3623. [2018-11-10 01:12:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2018-11-10 01:12:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4021 transitions. [2018-11-10 01:12:25,439 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4021 transitions. Word has length 483 [2018-11-10 01:12:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:25,439 INFO L481 AbstractCegarLoop]: Abstraction has 3623 states and 4021 transitions. [2018-11-10 01:12:25,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 01:12:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4021 transitions. [2018-11-10 01:12:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-10 01:12:25,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:25,443 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-10 01:12:25,443 INFO L424 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:25,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1331666820, now seen corresponding path program 1 times [2018-11-10 01:12:25,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:25,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:25,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2018-11-10 01:12:25,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:25,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:25,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:25,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 538 proven. 89 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2018-11-10 01:12:26,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:26,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-10 01:12:26,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 01:12:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 01:12:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 01:12:26,303 INFO L87 Difference]: Start difference. First operand 3623 states and 4021 transitions. Second operand 39 states. [2018-11-10 01:12:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:38,244 INFO L93 Difference]: Finished difference Result 14943 states and 17514 transitions. [2018-11-10 01:12:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-10 01:12:38,245 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 484 [2018-11-10 01:12:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:38,261 INFO L225 Difference]: With dead ends: 14943 [2018-11-10 01:12:38,261 INFO L226 Difference]: Without dead ends: 12075 [2018-11-10 01:12:38,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10188 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-10 01:12:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12075 states. [2018-11-10 01:12:38,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12075 to 4996. [2018-11-10 01:12:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2018-11-10 01:12:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 5569 transitions. [2018-11-10 01:12:38,966 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 5569 transitions. Word has length 484 [2018-11-10 01:12:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:38,967 INFO L481 AbstractCegarLoop]: Abstraction has 4996 states and 5569 transitions. [2018-11-10 01:12:38,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 01:12:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 5569 transitions. [2018-11-10 01:12:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-10 01:12:38,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:38,971 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-10 01:12:38,971 INFO L424 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:38,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash 404915651, now seen corresponding path program 1 times [2018-11-10 01:12:38,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:38,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 1361 trivial. 0 not checked. [2018-11-10 01:12:39,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:39,283 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:39,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:39,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 538 proven. 89 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2018-11-10 01:12:39,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:39,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-10 01:12:39,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 01:12:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 01:12:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 01:12:39,993 INFO L87 Difference]: Start difference. First operand 4996 states and 5569 transitions. Second operand 39 states. [2018-11-10 01:12:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:53,974 INFO L93 Difference]: Finished difference Result 19208 states and 22556 transitions. [2018-11-10 01:12:53,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-10 01:12:53,974 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 485 [2018-11-10 01:12:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:53,993 INFO L225 Difference]: With dead ends: 19208 [2018-11-10 01:12:53,993 INFO L226 Difference]: Without dead ends: 15080 [2018-11-10 01:12:53,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10186 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-10 01:12:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15080 states. [2018-11-10 01:12:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15080 to 6098. [2018-11-10 01:12:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6098 states. [2018-11-10 01:12:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 6796 transitions. [2018-11-10 01:12:54,854 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 6796 transitions. Word has length 485 [2018-11-10 01:12:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:54,855 INFO L481 AbstractCegarLoop]: Abstraction has 6098 states and 6796 transitions. [2018-11-10 01:12:54,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 01:12:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 6796 transitions. [2018-11-10 01:12:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-11-10 01:12:54,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:54,860 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-10 01:12:54,860 INFO L424 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2029135489, now seen corresponding path program 1 times [2018-11-10 01:12:54,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:54,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:54,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:54,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-11-10 01:12:54,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:12:54,958 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:12:54,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:55,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:12:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 490 proven. 71 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2018-11-10 01:12:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:12:55,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-10 01:12:55,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:12:55,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:12:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:12:55,308 INFO L87 Difference]: Start difference. First operand 6098 states and 6796 transitions. Second operand 13 states. [2018-11-10 01:12:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:56,762 INFO L93 Difference]: Finished difference Result 10182 states and 11382 transitions. [2018-11-10 01:12:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-10 01:12:56,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 485 [2018-11-10 01:12:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:56,768 INFO L225 Difference]: With dead ends: 10182 [2018-11-10 01:12:56,769 INFO L226 Difference]: Without dead ends: 4710 [2018-11-10 01:12:56,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-10 01:12:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2018-11-10 01:12:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 2375. [2018-11-10 01:12:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-11-10 01:12:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 2612 transitions. [2018-11-10 01:12:57,250 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 2612 transitions. Word has length 485 [2018-11-10 01:12:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:57,251 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 2612 transitions. [2018-11-10 01:12:57,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:12:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2612 transitions. [2018-11-10 01:12:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-10 01:12:57,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:57,253 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:12:57,253 INFO L424 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:57,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1632332447, now seen corresponding path program 1 times [2018-11-10 01:12:57,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:57,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:57,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:57,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2018-11-10 01:12:57,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:12:57,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:12:57,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:12:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:12:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:12:57,372 INFO L87 Difference]: Start difference. First operand 2375 states and 2612 transitions. Second operand 11 states. [2018-11-10 01:12:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:12:59,244 INFO L93 Difference]: Finished difference Result 7370 states and 8366 transitions. [2018-11-10 01:12:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 01:12:59,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 483 [2018-11-10 01:12:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:12:59,252 INFO L225 Difference]: With dead ends: 7370 [2018-11-10 01:12:59,252 INFO L226 Difference]: Without dead ends: 5631 [2018-11-10 01:12:59,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-11-10 01:12:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2018-11-10 01:12:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 2747. [2018-11-10 01:12:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-11-10 01:12:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3026 transitions. [2018-11-10 01:12:59,764 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3026 transitions. Word has length 483 [2018-11-10 01:12:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:12:59,765 INFO L481 AbstractCegarLoop]: Abstraction has 2747 states and 3026 transitions. [2018-11-10 01:12:59,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:12:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3026 transitions. [2018-11-10 01:12:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-10 01:12:59,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:12:59,767 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:12:59,768 INFO L424 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:12:59,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:12:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1804999007, now seen corresponding path program 1 times [2018-11-10 01:12:59,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:12:59,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:12:59,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:59,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:12:59,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:12:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:12:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2018-11-10 01:12:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:12:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:12:59,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:12:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:12:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:12:59,860 INFO L87 Difference]: Start difference. First operand 2747 states and 3026 transitions. Second operand 4 states. [2018-11-10 01:13:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:13:00,820 INFO L93 Difference]: Finished difference Result 6214 states and 6948 transitions. [2018-11-10 01:13:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:13:00,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2018-11-10 01:13:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:13:00,826 INFO L225 Difference]: With dead ends: 6214 [2018-11-10 01:13:00,826 INFO L226 Difference]: Without dead ends: 4103 [2018-11-10 01:13:00,828 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 01:13:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2018-11-10 01:13:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2699. [2018-11-10 01:13:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-11-10 01:13:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 2951 transitions. [2018-11-10 01:13:01,322 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 2951 transitions. Word has length 483 [2018-11-10 01:13:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:13:01,323 INFO L481 AbstractCegarLoop]: Abstraction has 2699 states and 2951 transitions. [2018-11-10 01:13:01,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:13:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 2951 transitions. [2018-11-10 01:13:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-10 01:13:01,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:13:01,326 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:13:01,326 INFO L424 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:13:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:13:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1767689676, now seen corresponding path program 1 times [2018-11-10 01:13:01,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:13:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:13:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-11-10 01:13:01,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:13:01,459 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:13:01,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:01,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:13:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-11-10 01:13:01,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:13:01,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 14 [2018-11-10 01:13:01,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:13:01,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:13:01,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:13:01,751 INFO L87 Difference]: Start difference. First operand 2699 states and 2951 transitions. Second operand 14 states. [2018-11-10 01:13:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:13:03,473 INFO L93 Difference]: Finished difference Result 6805 states and 7656 transitions. [2018-11-10 01:13:03,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 01:13:03,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 484 [2018-11-10 01:13:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:13:03,479 INFO L225 Difference]: With dead ends: 6805 [2018-11-10 01:13:03,480 INFO L226 Difference]: Without dead ends: 4742 [2018-11-10 01:13:03,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 479 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:13:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2018-11-10 01:13:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 2690. [2018-11-10 01:13:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2018-11-10 01:13:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 2930 transitions. [2018-11-10 01:13:03,985 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 2930 transitions. Word has length 484 [2018-11-10 01:13:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:13:03,985 INFO L481 AbstractCegarLoop]: Abstraction has 2690 states and 2930 transitions. [2018-11-10 01:13:03,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:13:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 2930 transitions. [2018-11-10 01:13:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-10 01:13:03,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:13:03,990 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:13:03,990 INFO L424 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:13:03,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:13:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash -123053085, now seen corresponding path program 1 times [2018-11-10 01:13:03,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:13:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:13:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-11-10 01:13:04,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:13:04,205 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:13:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:04,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:13:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1405 backedges. 545 proven. 98 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2018-11-10 01:13:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:13:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-10 01:13:04,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 01:13:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 01:13:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:13:04,560 INFO L87 Difference]: Start difference. First operand 2690 states and 2930 transitions. Second operand 18 states. [2018-11-10 01:13:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:13:07,941 INFO L93 Difference]: Finished difference Result 7163 states and 7867 transitions. [2018-11-10 01:13:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-10 01:13:07,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 484 [2018-11-10 01:13:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:13:07,947 INFO L225 Difference]: With dead ends: 7163 [2018-11-10 01:13:07,947 INFO L226 Difference]: Without dead ends: 5085 [2018-11-10 01:13:07,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 518 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2018-11-10 01:13:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2018-11-10 01:13:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4365. [2018-11-10 01:13:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4365 states. [2018-11-10 01:13:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 4748 transitions. [2018-11-10 01:13:08,801 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 4748 transitions. Word has length 484 [2018-11-10 01:13:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:13:08,801 INFO L481 AbstractCegarLoop]: Abstraction has 4365 states and 4748 transitions. [2018-11-10 01:13:08,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 01:13:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 4748 transitions. [2018-11-10 01:13:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-11-10 01:13:08,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:13:08,805 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:13:08,805 INFO L424 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:13:08,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:13:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2110120939, now seen corresponding path program 1 times [2018-11-10 01:13:08,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:13:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:13:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:08,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-11-10 01:13:09,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:13:09,016 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:13:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:09,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:13:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 537 proven. 92 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2018-11-10 01:13:09,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:13:09,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-11-10 01:13:09,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 01:13:09,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 01:13:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-11-10 01:13:09,421 INFO L87 Difference]: Start difference. First operand 4365 states and 4748 transitions. Second operand 27 states. [2018-11-10 01:13:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:13:31,728 INFO L93 Difference]: Finished difference Result 30007 states and 33581 transitions. [2018-11-10 01:13:31,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2018-11-10 01:13:31,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 486 [2018-11-10 01:13:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:13:31,761 INFO L225 Difference]: With dead ends: 30007 [2018-11-10 01:13:31,761 INFO L226 Difference]: Without dead ends: 26298 [2018-11-10 01:13:31,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60138 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11148, Invalid=132114, Unknown=0, NotChecked=0, Total=143262 [2018-11-10 01:13:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26298 states. [2018-11-10 01:13:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26298 to 9222. [2018-11-10 01:13:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2018-11-10 01:13:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 10022 transitions. [2018-11-10 01:13:34,118 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 10022 transitions. Word has length 486 [2018-11-10 01:13:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:13:34,118 INFO L481 AbstractCegarLoop]: Abstraction has 9222 states and 10022 transitions. [2018-11-10 01:13:34,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 01:13:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 10022 transitions. [2018-11-10 01:13:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-11-10 01:13:34,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:13:34,126 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:13:34,127 INFO L424 AbstractCegarLoop]: === Iteration 61 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:13:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:13:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1278637677, now seen corresponding path program 1 times [2018-11-10 01:13:34,127 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:13:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:13:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2018-11-10 01:13:34,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:13:34,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:13:34,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:34,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:13:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 538 proven. 153 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2018-11-10 01:13:34,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:13:34,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 35 [2018-11-10 01:13:34,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 01:13:34,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 01:13:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 01:13:34,906 INFO L87 Difference]: Start difference. First operand 9222 states and 10022 transitions. Second operand 35 states. [2018-11-10 01:13:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:13:53,248 INFO L93 Difference]: Finished difference Result 33586 states and 37844 transitions. [2018-11-10 01:13:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-11-10 01:13:53,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 488 [2018-11-10 01:13:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:13:53,285 INFO L225 Difference]: With dead ends: 33586 [2018-11-10 01:13:53,286 INFO L226 Difference]: Without dead ends: 25477 [2018-11-10 01:13:53,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 541 SyntacticMatches, 3 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18050 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3468, Invalid=43838, Unknown=0, NotChecked=0, Total=47306 [2018-11-10 01:13:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25477 states. [2018-11-10 01:13:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25477 to 12878. [2018-11-10 01:13:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12878 states. [2018-11-10 01:13:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12878 states to 12878 states and 14054 transitions. [2018-11-10 01:13:56,680 INFO L78 Accepts]: Start accepts. Automaton has 12878 states and 14054 transitions. Word has length 488 [2018-11-10 01:13:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:13:56,681 INFO L481 AbstractCegarLoop]: Abstraction has 12878 states and 14054 transitions. [2018-11-10 01:13:56,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 01:13:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12878 states and 14054 transitions. [2018-11-10 01:13:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-11-10 01:13:56,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:13:56,691 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:13:56,691 INFO L424 AbstractCegarLoop]: === Iteration 62 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:13:56,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:13:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1025123977, now seen corresponding path program 1 times [2018-11-10 01:13:56,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:13:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:13:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:13:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1377 trivial. 0 not checked. [2018-11-10 01:13:56,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:13:56,877 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:13:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:13:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:13:57,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:13:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 391 proven. 305 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-10 01:13:57,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:13:57,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 38 [2018-11-10 01:13:57,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-10 01:13:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-10 01:13:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 01:13:57,511 INFO L87 Difference]: Start difference. First operand 12878 states and 14054 transitions. Second operand 38 states. [2018-11-10 01:15:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:15:13,026 INFO L93 Difference]: Finished difference Result 70301 states and 80587 transitions. [2018-11-10 01:15:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 703 states. [2018-11-10 01:15:13,026 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 489 [2018-11-10 01:15:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:15:13,113 INFO L225 Difference]: With dead ends: 70301 [2018-11-10 01:15:13,113 INFO L226 Difference]: Without dead ends: 58860 [2018-11-10 01:15:13,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1471 GetRequests, 722 SyntacticMatches, 22 SemanticMatches, 727 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239563 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=22598, Invalid=508114, Unknown=0, NotChecked=0, Total=530712 [2018-11-10 01:15:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58860 states. [2018-11-10 01:15:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58860 to 23031. [2018-11-10 01:15:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23031 states. [2018-11-10 01:15:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23031 states to 23031 states and 25053 transitions. [2018-11-10 01:15:18,991 INFO L78 Accepts]: Start accepts. Automaton has 23031 states and 25053 transitions. Word has length 489 [2018-11-10 01:15:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:15:18,992 INFO L481 AbstractCegarLoop]: Abstraction has 23031 states and 25053 transitions. [2018-11-10 01:15:18,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-10 01:15:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 23031 states and 25053 transitions. [2018-11-10 01:15:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-11-10 01:15:19,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:15:19,009 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 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, 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, 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] [2018-11-10 01:15:19,009 INFO L424 AbstractCegarLoop]: === Iteration 63 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:15:19,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:15:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash 566410454, now seen corresponding path program 1 times [2018-11-10 01:15:19,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:15:19,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:15:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:15:19,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:15:19,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:15:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:15:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:15:19,189 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:15:19,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:15:19 BoogieIcfgContainer [2018-11-10 01:15:19,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:15:19,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:15:19,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:15:19,367 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:15:19,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:00" (3/4) ... [2018-11-10 01:15:19,369 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:15:19,696 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_567d64ef-a982-43f1-a211-2d12b4f126ce/bin-2019/uautomizer/witness.graphml [2018-11-10 01:15:19,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:15:19,697 INFO L168 Benchmark]: Toolchain (without parser) took 319636.72 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 958.0 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,697 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:15:19,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.50 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 939.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,698 INFO L168 Benchmark]: Boogie Preprocessor took 81.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,698 INFO L168 Benchmark]: RCFGBuilder took 537.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,698 INFO L168 Benchmark]: TraceAbstraction took 318461.36 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 629.9 MB in the end (delta: 447.5 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,698 INFO L168 Benchmark]: Witness Printer took 329.20 ms. Allocated memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 12.1 MB). Free memory was 629.9 MB in the beginning and 3.4 GB in the end (delta: -2.7 GB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:15:19,700 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.50 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 939.3 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.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 537.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 318461.36 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 629.9 MB in the end (delta: 447.5 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 329.20 ms. Allocated memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 12.1 MB). Free memory was 629.9 MB in the beginning and 3.4 GB in the end (delta: -2.7 GB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 576]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L88] _Bool gate1Failed_History_0 ; [L89] _Bool gate1Failed_History_1 ; [L90] _Bool gate1Failed_History_2 ; [L91] _Bool gate2Failed_History_0 ; [L92] _Bool gate2Failed_History_1 ; [L93] _Bool gate2Failed_History_2 ; [L94] _Bool gate3Failed_History_0 ; [L95] _Bool gate3Failed_History_1 ; [L96] _Bool gate3Failed_History_2 ; [L68] msg_t nomsg = (msg_t )-1; [L69] port_t g1v ; [L70] int8_t g1v_old ; [L71] int8_t g1v_new ; [L72] port_t g2v ; [L73] int8_t g2v_old ; [L74] int8_t g2v_new ; [L75] port_t g3v ; [L76] int8_t g3v_old ; [L77] int8_t g3v_new ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L515] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [\old(g1v)=548, \old(g1v_new)=544, \old(g1v_old)=537, \old(g2v)=523, \old(g2v_new)=517, \old(g2v_old)=543, \old(g3v)=528, \old(g3v_new)=535, \old(g3v_old)=531, \old(gate1Failed)=20, \old(gate1Failed_History_0)=30, \old(gate1Failed_History_1)=6, \old(gate1Failed_History_2)=4, \old(gate2Failed)=15, \old(gate2Failed_History_0)=18, \old(gate2Failed_History_1)=9, \old(gate2Failed_History_2)=35, \old(gate3Failed)=38, \old(gate3Failed_History_0)=33, \old(gate3Failed_History_1)=22, \old(gate3Failed_History_2)=12, \old(nomsg)=529, \old(VALUE1)=539, \old(VALUE2)=514, \old(VALUE3)=520, \old(votedValue_History_0)=519, \old(votedValue_History_1)=546, \old(votedValue_History_2)=525, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] gate1Failed = __VERIFIER_nondet_bool() [L524] gate2Failed = __VERIFIER_nondet_bool() [L525] gate3Failed = __VERIFIER_nondet_bool() [L526] VALUE1 = __VERIFIER_nondet_char() [L527] VALUE2 = __VERIFIER_nondet_char() [L528] VALUE3 = __VERIFIER_nondet_char() [L529] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L530] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L531] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L532] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L533] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L534] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L535] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L536] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L537] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L538] votedValue_History_0 = __VERIFIER_nondet_char() [L539] votedValue_History_1 = __VERIFIER_nondet_char() [L540] votedValue_History_2 = __VERIFIER_nondet_char() [L541] CALL, EXPR init() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L248] int tmp ; [L249] int tmp___0 ; [L250] int tmp___1 ; [L251] int tmp___2 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] CALL, EXPR add_history_type(0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] CALL, EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L172] COND TRUE historyIndex == 0 [L173] RET return (gate1Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] EXPR read_history_bool(0, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L118] tmp = (int )read_history_bool(0, 0) [L119] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] EXPR add_history_type(0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L254] tmp = add_history_type(0) [L255] COND FALSE !(! tmp) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] CALL, EXPR add_history_type(1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] CALL, EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L182] COND TRUE historyIndex == 0 [L183] RET return (gate2Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] EXPR read_history_bool(1, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L124] tmp___0 = (int )read_history_bool(1, 0) [L125] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] EXPR add_history_type(1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L258] tmp___0 = add_history_type(1) [L259] COND FALSE !(! tmp___0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] CALL, EXPR add_history_type(2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] CALL, EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L192] COND TRUE historyIndex == 0 [L193] RET return (gate3Failed_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] EXPR read_history_bool(2, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] tmp___1 = (int )read_history_bool(2, 0) [L131] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] EXPR add_history_type(2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L262] tmp___1 = add_history_type(2) [L263] COND FALSE !(! tmp___1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] CALL, EXPR add_history_type(3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L104] _Bool ini_bool ; [L105] int8_t ini_int ; [L106] int var ; [L107] int tmp ; [L108] int tmp___0 ; [L109] int tmp___1 ; [L110] int tmp___2 ; [L113] ini_bool = (_Bool)0 [L114] ini_int = (int8_t )-2 [L115] var = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND TRUE var < 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L117] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L123] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L135] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] tmp___2 = (int )read_history_int8(3, 0) [L137] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L141] var ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L116] COND FALSE !(var < 3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L143] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] EXPR add_history_type(3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L266] tmp___2 = add_history_type(3) [L267] COND FALSE !(! tmp___2) [L270] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] EXPR init() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, init()=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] i2 = init() [L543] g1v_old = nomsg [L544] g1v_new = nomsg [L545] g2v_old = nomsg [L546] g2v_new = nomsg [L547] g3v_old = nomsg [L548] g3v_new = nomsg [L549] i2 = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L550] COND TRUE 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L552] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=29, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L389] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=28, gate1Failed_History_2=26, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] RET gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L389] write_history_bool(0, gate1Failed) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L396] COND FALSE !((int )next_state == 0) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L399] COND TRUE (int )next_state == 1 [L400] tmp___0 = 1 VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] COND TRUE, EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=29, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=28, \old(gate1Failed_History_2)=26, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=1, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] RET g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L552] gate1_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L553] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=24, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L420] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=37, gate2Failed_History_2=3, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] RET gate2Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L420] write_history_bool(1, gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND FALSE !(\read(gate2Failed)) [L425] tmp = __VERIFIER_nondet_char() [L426] next_state = tmp VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] COND TRUE (int )next_state == 0 [L428] tmp___0 = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] COND TRUE, EXPR next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=24, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=37, \old(gate2Failed_History_2)=3, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, next_state=0, next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] RET g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L553] gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=21, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L451] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=10, gate3Failed_History_2=14, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] RET gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L451] write_history_bool(2, gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L452] COND FALSE !(\read(gate3Failed)) [L456] tmp = __VERIFIER_nondet_char() [L457] next_state = tmp VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L458] COND TRUE (int )next_state == 0 [L459] tmp___0 = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] COND TRUE, EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=21, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=10, \old(gate3Failed_History_2)=14, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] RET g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L554] gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L555] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L487] COND TRUE (int )VALUE1 == (int )nomsg [L488] voted_value = VALUE3 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] CALL write_history_int8(3, voted_value) VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] RET votedValue_History_0 = buf VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=255, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L555] voter() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L562] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L175] COND TRUE historyIndex == 1 [L176] RET return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] CALL, EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L182] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L185] COND TRUE historyIndex == 1 [L186] RET return (gate2Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] CALL, EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L192] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L195] COND TRUE historyIndex == 1 [L196] RET return (gate3Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND TRUE (int )VALUE2 == (int )tmp___1 [L319] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND TRUE (int )VALUE3 == (int )tmp___2 [L323] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L325] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L339] COND FALSE !(! (temp_count > 1)) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] CALL, EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L155] COND TRUE historyIndex == 1 [L156] RET return (votedValue_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] EXPR read_history_int8(3, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND FALSE !((int )tmp___10 > -2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] tmp___11 = read_history_int8(3, 0) [L366] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET return (1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L562] EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, check()=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L562] c1 = check() [L563] CALL assert(c1) VAL [\old(arg)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L574] COND FALSE, RET !(! arg) VAL [\old(arg)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L563] assert(c1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L550] COND TRUE 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L552] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L389] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=28, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND TRUE history_id == 0 [L227] gate1Failed_History_2 = gate1Failed_History_1 [L228] gate1Failed_History_1 = gate1Failed_History_0 [L229] RET gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L389] write_history_bool(0, gate1Failed) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L396] COND TRUE (int )next_state == 0 [L397] tmp___0 = 1 VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] COND TRUE, EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=28, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] RET g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L552] gate1_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L553] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L420] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=37, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND TRUE history_id == 1 [L232] gate2Failed_History_2 = gate2Failed_History_1 [L233] gate2Failed_History_1 = gate2Failed_History_0 [L234] RET gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L420] write_history_bool(1, gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L421] COND TRUE \read(gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] COND FALSE, EXPR !(nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=37, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] RET g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L553] gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L554] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L451] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=10, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L236] COND TRUE history_id == 2 [L237] gate3Failed_History_2 = gate3Failed_History_1 [L238] gate3Failed_History_1 = gate3Failed_History_0 [L239] RET gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L451] write_history_bool(2, gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L452] COND TRUE \read(gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] COND FALSE, EXPR !(nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=10, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] RET g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L554] gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L555] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L493] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L500] COND TRUE (int )VALUE1 != (int )nomsg [L501] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] CALL write_history_int8(3, voted_value) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] RET votedValue_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L511] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L555] voter() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] RET return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L182] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] RET return (gate2Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] CALL, EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L192] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] RET return (gate3Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] RET return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L325] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L326] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L327] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L339] COND TRUE ! (temp_count > 1) [L340] RET return (0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, check()=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] c1 = check() [L563] CALL assert(c1) VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L574] COND TRUE ! arg VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L576] __VERIFIER_error() VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 210 locations, 1 error locations. UNSAFE Result, 318.4s OverallTime, 63 OverallIterations, 16 TraceHistogramMax, 265.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31078 SDtfs, 54067 SDslu, 86873 SDs, 0 SdLazy, 427362 SolverSat, 28824 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 119.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18461 GetRequests, 14604 SyntacticMatches, 94 SemanticMatches, 3763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532758 ImplicationChecksByTransitivity, 67.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23031occurred in iteration=62, 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: 29.0s AutomataMinimizationTime, 62 MinimizatonAttempts, 165200 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 33875 NumberOfCodeBlocks, 33875 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 33291 ConstructedInterpolants, 0 QuantifiedInterpolants, 31322058 SizeOfPredicates, 111 NumberOfNonLiveVariables, 61929 ConjunctsInSsa, 1039 ConjunctsInUnsatCore, 95 InterpolantComputations, 40 PerfectInterpolantSequences, 84428/87189 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...