./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:41:44,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:41:44,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:41:44,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:41:44,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:41:44,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:41:44,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:41:44,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:41:44,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:41:44,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:41:44,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:41:44,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:41:44,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:41:44,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:41:44,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:41:44,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:41:44,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:41:44,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:41:44,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:41:44,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:41:44,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:41:44,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:41:44,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:41:44,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:41:44,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:41:44,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:41:44,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:41:44,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:41:44,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:41:44,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:41:44,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:41:44,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:41:44,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:41:44,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:41:44,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:41:44,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:41:44,179 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 02:41:44,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:41:44,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:41:44,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:41:44,190 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:41:44,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:41:44,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:41:44,191 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:41:44,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:41:44,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:41:44,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:41:44,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:41:44,192 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:41:44,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:41:44,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:41:44,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:41:44,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:41:44,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:41:44,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:41:44,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:41:44,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:41:44,194 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:41:44,194 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:41:44,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:41:44,194 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_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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 -> 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c [2018-12-02 02:41:44,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:41:44,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:41:44,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:41:44,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:41:44,226 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:41:44,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:41:44,260 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/data/97e7c50cd/55fbac615d2f4e8397255fade3366c55/FLAGde2544ef4 [2018-12-02 02:41:44,648 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:41:44,649 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:41:44,654 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/data/97e7c50cd/55fbac615d2f4e8397255fade3366c55/FLAGde2544ef4 [2018-12-02 02:41:44,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/data/97e7c50cd/55fbac615d2f4e8397255fade3366c55 [2018-12-02 02:41:44,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:41:44,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:41:44,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:41:44,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:41:44,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:41:44,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354f5439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44, skipping insertion in model container [2018-12-02 02:41:44,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:41:44,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:41:44,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:41:44,820 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:41:44,883 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:41:44,894 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:41:44,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44 WrapperNode [2018-12-02 02:41:44,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:41:44,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:41:44,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:41:44,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:41:44,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:41:44,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:41:44,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:41:44,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:41:44,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... [2018-12-02 02:41:44,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:41:44,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:41:44,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:41:44,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:41:44,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:44,967 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2018-12-02 02:41:44,967 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2018-12-02 02:41:44,967 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-02 02:41:44,967 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-02 02:41:44,968 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-02 02:41:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2018-12-02 02:41:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2018-12-02 02:41:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2018-12-02 02:41:45,294 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:41:45,294 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 02:41:45,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:41:45 BoogieIcfgContainer [2018-12-02 02:41:45,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:41:45,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:41:45,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:41:45,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:41:45,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:41:44" (1/3) ... [2018-12-02 02:41:45,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162dc336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:41:45, skipping insertion in model container [2018-12-02 02:41:45,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:41:44" (2/3) ... [2018-12-02 02:41:45,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162dc336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:41:45, skipping insertion in model container [2018-12-02 02:41:45,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:41:45" (3/3) ... [2018-12-02 02:41:45,300 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.1.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 02:41:45,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:41:45,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:41:45,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:41:45,337 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:41:45,337 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:41:45,337 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:41:45,337 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:41:45,337 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:41:45,337 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:41:45,337 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:41:45,337 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:41:45,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:41:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2018-12-02 02:41:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:41:45,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2018-12-02 02:41:45,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:41:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:45,516 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2018-12-02 02:41:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:45,588 INFO L93 Difference]: Finished difference Result 419 states and 679 transitions. [2018-12-02 02:41:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:45,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 02:41:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:45,597 INFO L225 Difference]: With dead ends: 419 [2018-12-02 02:41:45,597 INFO L226 Difference]: Without dead ends: 213 [2018-12-02 02:41:45,600 INFO L631 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-12-02 02:41:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-02 02:41:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-12-02 02:41:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-02 02:41:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2018-12-02 02:41:45,636 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2018-12-02 02:41:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:45,637 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2018-12-02 02:41:45,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2018-12-02 02:41:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:41:45,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2018-12-02 02:41:45,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:41:45,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:45,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:45,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:45,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:45,681 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2018-12-02 02:41:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:45,717 INFO L93 Difference]: Finished difference Result 429 states and 645 transitions. [2018-12-02 02:41:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:45,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 02:41:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:45,720 INFO L225 Difference]: With dead ends: 429 [2018-12-02 02:41:45,720 INFO L226 Difference]: Without dead ends: 227 [2018-12-02 02:41:45,722 INFO L631 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-12-02 02:41:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-02 02:41:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-12-02 02:41:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-02 02:41:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2018-12-02 02:41:45,739 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2018-12-02 02:41:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:45,739 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2018-12-02 02:41:45,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2018-12-02 02:41:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 02:41:45,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,741 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,741 INFO L423 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2018-12-02 02:41:45,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:41:45,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:41:45,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:41:45,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:41:45,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:41:45,775 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2018-12-02 02:41:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:45,792 INFO L93 Difference]: Finished difference Result 461 states and 691 transitions. [2018-12-02 02:41:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:41:45,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 02:41:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:45,794 INFO L225 Difference]: With dead ends: 461 [2018-12-02 02:41:45,794 INFO L226 Difference]: Without dead ends: 253 [2018-12-02 02:41:45,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:41:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-02 02:41:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2018-12-02 02:41:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 02:41:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2018-12-02 02:41:45,805 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2018-12-02 02:41:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:45,806 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2018-12-02 02:41:45,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:41:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2018-12-02 02:41:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 02:41:45,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,807 INFO L423 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2018-12-02 02:41:45,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:41:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:41:45,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:41:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:41:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:41:45,853 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2018-12-02 02:41:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:45,877 INFO L93 Difference]: Finished difference Result 438 states and 649 transitions. [2018-12-02 02:41:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:45,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 02:41:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:45,879 INFO L225 Difference]: With dead ends: 438 [2018-12-02 02:41:45,879 INFO L226 Difference]: Without dead ends: 234 [2018-12-02 02:41:45,880 INFO L631 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-12-02 02:41:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-02 02:41:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-12-02 02:41:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-02 02:41:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2018-12-02 02:41:45,889 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2018-12-02 02:41:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:45,889 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2018-12-02 02:41:45,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:41:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2018-12-02 02:41:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 02:41:45,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2018-12-02 02:41:45,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:41:45,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:45,932 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2018-12-02 02:41:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:45,944 INFO L93 Difference]: Finished difference Result 399 states and 588 transitions. [2018-12-02 02:41:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:45,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-02 02:41:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:45,946 INFO L225 Difference]: With dead ends: 399 [2018-12-02 02:41:45,946 INFO L226 Difference]: Without dead ends: 226 [2018-12-02 02:41:45,947 INFO L631 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-12-02 02:41:45,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-02 02:41:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-02 02:41:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 02:41:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2018-12-02 02:41:45,954 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2018-12-02 02:41:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:45,955 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2018-12-02 02:41:45,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2018-12-02 02:41:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 02:41:45,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:45,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:41:45,956 INFO L423 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:45,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:45,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2018-12-02 02:41:45,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:45,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:45,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:41:45,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:45,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:45,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:45,995 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2018-12-02 02:41:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,028 INFO L93 Difference]: Finished difference Result 448 states and 658 transitions. [2018-12-02 02:41:46,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-02 02:41:46,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,031 INFO L225 Difference]: With dead ends: 448 [2018-12-02 02:41:46,031 INFO L226 Difference]: Without dead ends: 245 [2018-12-02 02:41:46,032 INFO L631 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-12-02 02:41:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-02 02:41:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-12-02 02:41:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-02 02:41:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2018-12-02 02:41:46,043 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2018-12-02 02:41:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,044 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2018-12-02 02:41:46,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2018-12-02 02:41:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 02:41:46,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,045 INFO L402 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, 1] [2018-12-02 02:41:46,045 INFO L423 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2018-12-02 02:41:46,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:41:46,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:46,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:46,072 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2018-12-02 02:41:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,114 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2018-12-02 02:41:46,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-02 02:41:46,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,116 INFO L225 Difference]: With dead ends: 468 [2018-12-02 02:41:46,116 INFO L226 Difference]: Without dead ends: 251 [2018-12-02 02:41:46,117 INFO L631 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-12-02 02:41:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-02 02:41:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-12-02 02:41:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 02:41:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2018-12-02 02:41:46,129 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2018-12-02 02:41:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,129 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2018-12-02 02:41:46,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2018-12-02 02:41:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 02:41:46,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,131 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:46,131 INFO L423 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,131 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2018-12-02 02:41:46,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 02:41:46,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:41:46,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:41:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:41:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:41:46,179 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2018-12-02 02:41:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,202 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2018-12-02 02:41:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-02 02:41:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,204 INFO L225 Difference]: With dead ends: 467 [2018-12-02 02:41:46,204 INFO L226 Difference]: Without dead ends: 251 [2018-12-02 02:41:46,205 INFO L631 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-12-02 02:41:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-02 02:41:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-12-02 02:41:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 02:41:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2018-12-02 02:41:46,216 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2018-12-02 02:41:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2018-12-02 02:41:46,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:41:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2018-12-02 02:41:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 02:41:46,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,217 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:46,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2018-12-02 02:41:46,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 02:41:46,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:46,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:46,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:46,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:46,260 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2018-12-02 02:41:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,315 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2018-12-02 02:41:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 02:41:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,317 INFO L225 Difference]: With dead ends: 481 [2018-12-02 02:41:46,317 INFO L226 Difference]: Without dead ends: 270 [2018-12-02 02:41:46,318 INFO L631 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-12-02 02:41:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-02 02:41:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-12-02 02:41:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-02 02:41:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2018-12-02 02:41:46,326 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2018-12-02 02:41:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,326 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2018-12-02 02:41:46,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2018-12-02 02:41:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 02:41:46,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,327 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:46,327 INFO L423 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2018-12-02 02:41:46,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-02 02:41:46,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:46,355 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2018-12-02 02:41:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,389 INFO L93 Difference]: Finished difference Result 488 states and 699 transitions. [2018-12-02 02:41:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:46,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 02:41:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,391 INFO L225 Difference]: With dead ends: 488 [2018-12-02 02:41:46,391 INFO L226 Difference]: Without dead ends: 261 [2018-12-02 02:41:46,392 INFO L631 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-12-02 02:41:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-12-02 02:41:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-12-02 02:41:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-02 02:41:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2018-12-02 02:41:46,400 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2018-12-02 02:41:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,400 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2018-12-02 02:41:46,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2018-12-02 02:41:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 02:41:46,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,401 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:46,402 INFO L423 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2018-12-02 02:41:46,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 02:41:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:41:46,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:41:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:41:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:41:46,442 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2018-12-02 02:41:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,460 INFO L93 Difference]: Finished difference Result 475 states and 666 transitions. [2018-12-02 02:41:46,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-02 02:41:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,461 INFO L225 Difference]: With dead ends: 475 [2018-12-02 02:41:46,462 INFO L226 Difference]: Without dead ends: 263 [2018-12-02 02:41:46,462 INFO L631 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-12-02 02:41:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-02 02:41:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-12-02 02:41:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-02 02:41:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2018-12-02 02:41:46,471 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2018-12-02 02:41:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,471 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2018-12-02 02:41:46,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:41:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2018-12-02 02:41:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 02:41:46,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,472 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:46,472 INFO L423 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2018-12-02 02:41:46,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 02:41:46,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:46,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:46,510 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2018-12-02 02:41:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,552 INFO L93 Difference]: Finished difference Result 464 states and 664 transitions. [2018-12-02 02:41:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:46,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-02 02:41:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,553 INFO L225 Difference]: With dead ends: 464 [2018-12-02 02:41:46,553 INFO L226 Difference]: Without dead ends: 259 [2018-12-02 02:41:46,554 INFO L631 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-12-02 02:41:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-02 02:41:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-12-02 02:41:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-02 02:41:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2018-12-02 02:41:46,559 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2018-12-02 02:41:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,559 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2018-12-02 02:41:46,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2018-12-02 02:41:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 02:41:46,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,560 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:46,560 INFO L423 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2018-12-02 02:41:46,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-02 02:41:46,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:46,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-02 02:41:46,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:41:46,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-02 02:41:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:41:46,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:41:46,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:41:46,730 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 6 states. [2018-12-02 02:41:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,860 INFO L93 Difference]: Finished difference Result 614 states and 854 transitions. [2018-12-02 02:41:46,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 02:41:46,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-02 02:41:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,861 INFO L225 Difference]: With dead ends: 614 [2018-12-02 02:41:46,862 INFO L226 Difference]: Without dead ends: 298 [2018-12-02 02:41:46,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 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-12-02 02:41:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-02 02:41:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 268. [2018-12-02 02:41:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-02 02:41:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 356 transitions. [2018-12-02 02:41:46,873 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 356 transitions. Word has length 100 [2018-12-02 02:41:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,874 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 356 transitions. [2018-12-02 02:41:46,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:41:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 356 transitions. [2018-12-02 02:41:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 02:41:46,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,875 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:46,875 INFO L423 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2018-12-02 02:41:46,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-02 02:41:46,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:46,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 02:41:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 02:41:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 02:41:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 02:41:46,926 INFO L87 Difference]: Start difference. First operand 268 states and 356 transitions. Second operand 5 states. [2018-12-02 02:41:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:46,944 INFO L93 Difference]: Finished difference Result 440 states and 602 transitions. [2018-12-02 02:41:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:46,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-12-02 02:41:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:46,946 INFO L225 Difference]: With dead ends: 440 [2018-12-02 02:41:46,946 INFO L226 Difference]: Without dead ends: 268 [2018-12-02 02:41:46,947 INFO L631 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-12-02 02:41:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-02 02:41:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-12-02 02:41:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-02 02:41:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2018-12-02 02:41:46,956 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 144 [2018-12-02 02:41:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:46,956 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2018-12-02 02:41:46,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 02:41:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2018-12-02 02:41:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 02:41:46,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:46,958 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:46,958 INFO L423 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:46,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1947418555, now seen corresponding path program 1 times [2018-12-02 02:41:46,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:46,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:46,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-02 02:41:47,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,021 INFO L87 Difference]: Start difference. First operand 268 states and 354 transitions. Second operand 4 states. [2018-12-02 02:41:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,046 INFO L93 Difference]: Finished difference Result 439 states and 602 transitions. [2018-12-02 02:41:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:47,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 02:41:47,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,048 INFO L225 Difference]: With dead ends: 439 [2018-12-02 02:41:47,048 INFO L226 Difference]: Without dead ends: 274 [2018-12-02 02:41:47,048 INFO L631 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-12-02 02:41:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-02 02:41:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-12-02 02:41:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-12-02 02:41:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 357 transitions. [2018-12-02 02:41:47,055 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 357 transitions. Word has length 161 [2018-12-02 02:41:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,055 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 357 transitions. [2018-12-02 02:41:47,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 357 transitions. [2018-12-02 02:41:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 02:41:47,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,057 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:47,057 INFO L423 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash -243298260, now seen corresponding path program 1 times [2018-12-02 02:41:47,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-02 02:41:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,106 INFO L87 Difference]: Start difference. First operand 272 states and 357 transitions. Second operand 4 states. [2018-12-02 02:41:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,137 INFO L93 Difference]: Finished difference Result 448 states and 609 transitions. [2018-12-02 02:41:47,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:47,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 02:41:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,138 INFO L225 Difference]: With dead ends: 448 [2018-12-02 02:41:47,139 INFO L226 Difference]: Without dead ends: 279 [2018-12-02 02:41:47,139 INFO L631 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-12-02 02:41:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-02 02:41:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-12-02 02:41:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-02 02:41:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 361 transitions. [2018-12-02 02:41:47,145 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 361 transitions. Word has length 173 [2018-12-02 02:41:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,145 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 361 transitions. [2018-12-02 02:41:47,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 361 transitions. [2018-12-02 02:41:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-02 02:41:47,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,147 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:47,147 INFO L423 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652604, now seen corresponding path program 1 times [2018-12-02 02:41:47,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-12-02 02:41:47,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,193 INFO L87 Difference]: Start difference. First operand 277 states and 361 transitions. Second operand 4 states. [2018-12-02 02:41:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,213 INFO L93 Difference]: Finished difference Result 450 states and 607 transitions. [2018-12-02 02:41:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:47,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-02 02:41:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,215 INFO L225 Difference]: With dead ends: 450 [2018-12-02 02:41:47,215 INFO L226 Difference]: Without dead ends: 276 [2018-12-02 02:41:47,215 INFO L631 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-12-02 02:41:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-02 02:41:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-12-02 02:41:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-02 02:41:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 356 transitions. [2018-12-02 02:41:47,221 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 356 transitions. Word has length 186 [2018-12-02 02:41:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,221 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 356 transitions. [2018-12-02 02:41:47,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 356 transitions. [2018-12-02 02:41:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 02:41:47,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,223 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:47,223 INFO L423 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash 507025156, now seen corresponding path program 1 times [2018-12-02 02:41:47,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-12-02 02:41:47,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,267 INFO L87 Difference]: Start difference. First operand 276 states and 356 transitions. Second operand 4 states. [2018-12-02 02:41:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,283 INFO L93 Difference]: Finished difference Result 448 states and 597 transitions. [2018-12-02 02:41:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:47,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-02 02:41:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,285 INFO L225 Difference]: With dead ends: 448 [2018-12-02 02:41:47,285 INFO L226 Difference]: Without dead ends: 275 [2018-12-02 02:41:47,286 INFO L631 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-12-02 02:41:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-02 02:41:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-12-02 02:41:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-02 02:41:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 353 transitions. [2018-12-02 02:41:47,295 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 353 transitions. Word has length 199 [2018-12-02 02:41:47,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,296 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 353 transitions. [2018-12-02 02:41:47,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 353 transitions. [2018-12-02 02:41:47,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-02 02:41:47,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,298 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:47,298 INFO L423 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1935753462, now seen corresponding path program 1 times [2018-12-02 02:41:47,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-12-02 02:41:47,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,375 INFO L87 Difference]: Start difference. First operand 275 states and 353 transitions. Second operand 4 states. [2018-12-02 02:41:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,662 INFO L93 Difference]: Finished difference Result 768 states and 1033 transitions. [2018-12-02 02:41:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:47,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-12-02 02:41:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,665 INFO L225 Difference]: With dead ends: 768 [2018-12-02 02:41:47,665 INFO L226 Difference]: Without dead ends: 596 [2018-12-02 02:41:47,666 INFO L631 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-12-02 02:41:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-12-02 02:41:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 458. [2018-12-02 02:41:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-12-02 02:41:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 613 transitions. [2018-12-02 02:41:47,677 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 613 transitions. Word has length 201 [2018-12-02 02:41:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,678 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 613 transitions. [2018-12-02 02:41:47,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 613 transitions. [2018-12-02 02:41:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-02 02:41:47,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,680 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:47,680 INFO L423 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -833946183, now seen corresponding path program 1 times [2018-12-02 02:41:47,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-02 02:41:47,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:47,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:47,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:47,757 INFO L87 Difference]: Start difference. First operand 458 states and 613 transitions. Second operand 4 states. [2018-12-02 02:41:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:47,922 INFO L93 Difference]: Finished difference Result 1178 states and 1624 transitions. [2018-12-02 02:41:47,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:47,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2018-12-02 02:41:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:47,925 INFO L225 Difference]: With dead ends: 1178 [2018-12-02 02:41:47,925 INFO L226 Difference]: Without dead ends: 823 [2018-12-02 02:41:47,926 INFO L631 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-12-02 02:41:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-02 02:41:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 808. [2018-12-02 02:41:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-02 02:41:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1093 transitions. [2018-12-02 02:41:47,948 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1093 transitions. Word has length 236 [2018-12-02 02:41:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:47,948 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 1093 transitions. [2018-12-02 02:41:47,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1093 transitions. [2018-12-02 02:41:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 02:41:47,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:47,951 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:47,951 INFO L423 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:47,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:47,951 INFO L82 PathProgramCache]: Analyzing trace with hash -758669803, now seen corresponding path program 1 times [2018-12-02 02:41:47,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:47,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:47,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:47,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-02 02:41:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:48,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:48,017 INFO L87 Difference]: Start difference. First operand 808 states and 1093 transitions. Second operand 4 states. [2018-12-02 02:41:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:48,196 INFO L93 Difference]: Finished difference Result 2156 states and 2987 transitions. [2018-12-02 02:41:48,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:48,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2018-12-02 02:41:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:48,202 INFO L225 Difference]: With dead ends: 2156 [2018-12-02 02:41:48,202 INFO L226 Difference]: Without dead ends: 1478 [2018-12-02 02:41:48,205 INFO L631 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-12-02 02:41:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2018-12-02 02:41:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1115. [2018-12-02 02:41:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-02 02:41:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1521 transitions. [2018-12-02 02:41:48,261 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1521 transitions. Word has length 237 [2018-12-02 02:41:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1521 transitions. [2018-12-02 02:41:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1521 transitions. [2018-12-02 02:41:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 02:41:48,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:48,265 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:48,265 INFO L423 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:48,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576620, now seen corresponding path program 1 times [2018-12-02 02:41:48,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:48,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:48,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-12-02 02:41:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 02:41:48,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:48,339 INFO L87 Difference]: Start difference. First operand 1115 states and 1521 transitions. Second operand 4 states. [2018-12-02 02:41:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:48,551 INFO L93 Difference]: Finished difference Result 3104 states and 4310 transitions. [2018-12-02 02:41:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 02:41:48,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-12-02 02:41:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:48,561 INFO L225 Difference]: With dead ends: 3104 [2018-12-02 02:41:48,561 INFO L226 Difference]: Without dead ends: 2119 [2018-12-02 02:41:48,564 INFO L631 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-12-02 02:41:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2018-12-02 02:41:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1405. [2018-12-02 02:41:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1405 states. [2018-12-02 02:41:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1927 transitions. [2018-12-02 02:41:48,630 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1927 transitions. Word has length 238 [2018-12-02 02:41:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:48,631 INFO L480 AbstractCegarLoop]: Abstraction has 1405 states and 1927 transitions. [2018-12-02 02:41:48,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1927 transitions. [2018-12-02 02:41:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 02:41:48,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:48,634 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:48,634 INFO L423 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:48,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash 163407378, now seen corresponding path program 1 times [2018-12-02 02:41:48,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:48,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:48,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-12-02 02:41:48,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:48,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:48,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:48,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-12-02 02:41:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:41:48,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-12-02 02:41:48,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:41:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:41:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:41:48,938 INFO L87 Difference]: Start difference. First operand 1405 states and 1927 transitions. Second operand 10 states. [2018-12-02 02:41:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:49,185 INFO L93 Difference]: Finished difference Result 2896 states and 4008 transitions. [2018-12-02 02:41:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 02:41:49,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 238 [2018-12-02 02:41:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:49,189 INFO L225 Difference]: With dead ends: 2896 [2018-12-02 02:41:49,189 INFO L226 Difference]: Without dead ends: 1432 [2018-12-02 02:41:49,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 238 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-12-02 02:41:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2018-12-02 02:41:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2018-12-02 02:41:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-12-02 02:41:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1916 transitions. [2018-12-02 02:41:49,236 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1916 transitions. Word has length 238 [2018-12-02 02:41:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 1916 transitions. [2018-12-02 02:41:49,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:41:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1916 transitions. [2018-12-02 02:41:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-02 02:41:49,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:49,239 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:49,240 INFO L423 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:49,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:49,240 INFO L82 PathProgramCache]: Analyzing trace with hash 236521027, now seen corresponding path program 1 times [2018-12-02 02:41:49,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:49,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:49,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:49,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-12-02 02:41:49,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:49,330 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:49,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:49,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-12-02 02:41:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:41:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-12-02 02:41:49,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 02:41:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 02:41:49,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 02:41:49,524 INFO L87 Difference]: Start difference. First operand 1432 states and 1916 transitions. Second operand 9 states. [2018-12-02 02:41:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:49,629 INFO L93 Difference]: Finished difference Result 2802 states and 3886 transitions. [2018-12-02 02:41:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:41:49,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2018-12-02 02:41:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:49,634 INFO L225 Difference]: With dead ends: 2802 [2018-12-02 02:41:49,634 INFO L226 Difference]: Without dead ends: 1491 [2018-12-02 02:41:49,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 293 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-12-02 02:41:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2018-12-02 02:41:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2018-12-02 02:41:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2018-12-02 02:41:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1961 transitions. [2018-12-02 02:41:49,679 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1961 transitions. Word has length 292 [2018-12-02 02:41:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:49,679 INFO L480 AbstractCegarLoop]: Abstraction has 1491 states and 1961 transitions. [2018-12-02 02:41:49,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 02:41:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1961 transitions. [2018-12-02 02:41:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-02 02:41:49,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:49,683 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:49,683 INFO L423 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:49,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -781172734, now seen corresponding path program 1 times [2018-12-02 02:41:49,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:49,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-12-02 02:41:49,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:41:49,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:41:49,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:41:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:41:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:41:49,756 INFO L87 Difference]: Start difference. First operand 1491 states and 1961 transitions. Second operand 3 states. [2018-12-02 02:41:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:49,786 INFO L93 Difference]: Finished difference Result 2574 states and 3405 transitions. [2018-12-02 02:41:49,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:41:49,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-12-02 02:41:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:49,792 INFO L225 Difference]: With dead ends: 2574 [2018-12-02 02:41:49,792 INFO L226 Difference]: Without dead ends: 1184 [2018-12-02 02:41:49,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:41:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-12-02 02:41:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2018-12-02 02:41:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-12-02 02:41:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1546 transitions. [2018-12-02 02:41:49,855 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1546 transitions. Word has length 293 [2018-12-02 02:41:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:49,855 INFO L480 AbstractCegarLoop]: Abstraction has 1184 states and 1546 transitions. [2018-12-02 02:41:49,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:41:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1546 transitions. [2018-12-02 02:41:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-02 02:41:49,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:49,859 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:49,859 INFO L423 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:49,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 88115105, now seen corresponding path program 1 times [2018-12-02 02:41:49,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-12-02 02:41:49,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:49,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:49,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:50,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-12-02 02:41:50,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:41:50,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-12-02 02:41:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 02:41:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 02:41:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:41:50,189 INFO L87 Difference]: Start difference. First operand 1184 states and 1546 transitions. Second operand 14 states. [2018-12-02 02:41:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:50,290 INFO L93 Difference]: Finished difference Result 1246 states and 1654 transitions. [2018-12-02 02:41:50,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 02:41:50,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 293 [2018-12-02 02:41:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:50,297 INFO L225 Difference]: With dead ends: 1246 [2018-12-02 02:41:50,297 INFO L226 Difference]: Without dead ends: 1244 [2018-12-02 02:41:50,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:41:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-12-02 02:41:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2018-12-02 02:41:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-12-02 02:41:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1573 transitions. [2018-12-02 02:41:50,367 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1573 transitions. Word has length 293 [2018-12-02 02:41:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:50,368 INFO L480 AbstractCegarLoop]: Abstraction has 1208 states and 1573 transitions. [2018-12-02 02:41:50,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 02:41:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1573 transitions. [2018-12-02 02:41:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-02 02:41:50,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:50,371 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:50,371 INFO L423 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:50,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:50,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1352778214, now seen corresponding path program 1 times [2018-12-02 02:41:50,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:50,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:50,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:50,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:50,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-12-02 02:41:50,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:50,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:50,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:50,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-12-02 02:41:50,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:41:50,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-12-02 02:41:50,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 02:41:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 02:41:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:41:50,896 INFO L87 Difference]: Start difference. First operand 1208 states and 1573 transitions. Second operand 21 states. [2018-12-02 02:41:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:53,568 INFO L93 Difference]: Finished difference Result 4398 states and 5883 transitions. [2018-12-02 02:41:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 02:41:53,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 301 [2018-12-02 02:41:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:53,580 INFO L225 Difference]: With dead ends: 4398 [2018-12-02 02:41:53,580 INFO L226 Difference]: Without dead ends: 3346 [2018-12-02 02:41:53,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 02:41:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2018-12-02 02:41:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2907. [2018-12-02 02:41:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2018-12-02 02:41:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3861 transitions. [2018-12-02 02:41:53,693 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3861 transitions. Word has length 301 [2018-12-02 02:41:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:53,693 INFO L480 AbstractCegarLoop]: Abstraction has 2907 states and 3861 transitions. [2018-12-02 02:41:53,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 02:41:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3861 transitions. [2018-12-02 02:41:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-02 02:41:53,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:53,696 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:53,696 INFO L423 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:53,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2045879911, now seen corresponding path program 1 times [2018-12-02 02:41:53,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:53,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:53,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:53,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-12-02 02:41:53,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:53,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:53,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:53,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-12-02 02:41:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:41:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-12-02 02:41:53,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:41:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:41:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:41:53,946 INFO L87 Difference]: Start difference. First operand 2907 states and 3861 transitions. Second operand 4 states. [2018-12-02 02:41:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:54,051 INFO L93 Difference]: Finished difference Result 4616 states and 6010 transitions. [2018-12-02 02:41:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:41:54,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2018-12-02 02:41:54,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:54,059 INFO L225 Difference]: With dead ends: 4616 [2018-12-02 02:41:54,059 INFO L226 Difference]: Without dead ends: 2394 [2018-12-02 02:41:54,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 303 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-12-02 02:41:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2018-12-02 02:41:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2018-12-02 02:41:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2018-12-02 02:41:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3030 transitions. [2018-12-02 02:41:54,134 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3030 transitions. Word has length 301 [2018-12-02 02:41:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:54,134 INFO L480 AbstractCegarLoop]: Abstraction has 2394 states and 3030 transitions. [2018-12-02 02:41:54,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:41:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3030 transitions. [2018-12-02 02:41:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-12-02 02:41:54,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:54,137 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:41:54,137 INFO L423 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:54,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash 396519050, now seen corresponding path program 1 times [2018-12-02 02:41:54,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:54,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:54,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-02 02:41:54,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:54,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:54,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:54,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-12-02 02:41:54,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:41:54,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-12-02 02:41:54,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:41:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:41:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:41:54,504 INFO L87 Difference]: Start difference. First operand 2394 states and 3030 transitions. Second operand 19 states. [2018-12-02 02:41:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:41:57,183 INFO L93 Difference]: Finished difference Result 4679 states and 5932 transitions. [2018-12-02 02:41:57,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 02:41:57,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 316 [2018-12-02 02:41:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:41:57,195 INFO L225 Difference]: With dead ends: 4679 [2018-12-02 02:41:57,195 INFO L226 Difference]: Without dead ends: 2991 [2018-12-02 02:41:57,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=2718, Unknown=0, NotChecked=0, Total=3080 [2018-12-02 02:41:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2018-12-02 02:41:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2376. [2018-12-02 02:41:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2376 states. [2018-12-02 02:41:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 2919 transitions. [2018-12-02 02:41:57,283 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 2919 transitions. Word has length 316 [2018-12-02 02:41:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:41:57,283 INFO L480 AbstractCegarLoop]: Abstraction has 2376 states and 2919 transitions. [2018-12-02 02:41:57,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:41:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2919 transitions. [2018-12-02 02:41:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-02 02:41:57,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:41:57,286 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 02:41:57,286 INFO L423 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:41:57,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:41:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1301738203, now seen corresponding path program 1 times [2018-12-02 02:41:57,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:41:57,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:41:57,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:57,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:57,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:41:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-02 02:41:57,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:41:57,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:41:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:41:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:41:57,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:41:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-12-02 02:41:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:41:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-12-02 02:41:57,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:41:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:41:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:41:57,706 INFO L87 Difference]: Start difference. First operand 2376 states and 2919 transitions. Second operand 19 states. [2018-12-02 02:42:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:00,013 INFO L93 Difference]: Finished difference Result 4671 states and 5775 transitions. [2018-12-02 02:42:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 02:42:00,014 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 318 [2018-12-02 02:42:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:00,019 INFO L225 Difference]: With dead ends: 4671 [2018-12-02 02:42:00,019 INFO L226 Difference]: Without dead ends: 3055 [2018-12-02 02:42:00,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=332, Invalid=2218, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 02:42:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2018-12-02 02:42:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2193. [2018-12-02 02:42:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2018-12-02 02:42:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 2667 transitions. [2018-12-02 02:42:00,094 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 2667 transitions. Word has length 318 [2018-12-02 02:42:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:00,095 INFO L480 AbstractCegarLoop]: Abstraction has 2193 states and 2667 transitions. [2018-12-02 02:42:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:42:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2667 transitions. [2018-12-02 02:42:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-12-02 02:42:00,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:00,097 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:42:00,097 INFO L423 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:00,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 448826342, now seen corresponding path program 1 times [2018-12-02 02:42:00,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:00,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-02 02:42:00,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:42:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 02:42:00,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:42:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:42:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:42:00,179 INFO L87 Difference]: Start difference. First operand 2193 states and 2667 transitions. Second operand 6 states. [2018-12-02 02:42:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:00,349 INFO L93 Difference]: Finished difference Result 5186 states and 6805 transitions. [2018-12-02 02:42:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 02:42:00,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-12-02 02:42:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:00,357 INFO L225 Difference]: With dead ends: 5186 [2018-12-02 02:42:00,357 INFO L226 Difference]: Without dead ends: 3639 [2018-12-02 02:42:00,360 INFO L631 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-12-02 02:42:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-12-02 02:42:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 2469. [2018-12-02 02:42:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2018-12-02 02:42:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3105 transitions. [2018-12-02 02:42:00,455 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3105 transitions. Word has length 322 [2018-12-02 02:42:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:00,455 INFO L480 AbstractCegarLoop]: Abstraction has 2469 states and 3105 transitions. [2018-12-02 02:42:00,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:42:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3105 transitions. [2018-12-02 02:42:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-12-02 02:42:00,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:00,457 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:42:00,457 INFO L423 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:00,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:00,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1938345374, now seen corresponding path program 1 times [2018-12-02 02:42:00,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:00,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:00,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-12-02 02:42:00,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:42:00,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:42:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:00,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-12-02 02:42:00,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:42:00,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-12-02 02:42:00,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 02:42:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 02:42:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-12-02 02:42:00,872 INFO L87 Difference]: Start difference. First operand 2469 states and 3105 transitions. Second operand 19 states. [2018-12-02 02:42:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:04,923 INFO L93 Difference]: Finished difference Result 6706 states and 8434 transitions. [2018-12-02 02:42:04,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-02 02:42:04,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 322 [2018-12-02 02:42:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:04,931 INFO L225 Difference]: With dead ends: 6706 [2018-12-02 02:42:04,931 INFO L226 Difference]: Without dead ends: 4856 [2018-12-02 02:42:04,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=3277, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 02:42:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2018-12-02 02:42:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 2889. [2018-12-02 02:42:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-12-02 02:42:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3525 transitions. [2018-12-02 02:42:05,049 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3525 transitions. Word has length 322 [2018-12-02 02:42:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 2889 states and 3525 transitions. [2018-12-02 02:42:05,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 02:42:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3525 transitions. [2018-12-02 02:42:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-12-02 02:42:05,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:05,052 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-12-02 02:42:05,052 INFO L423 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:05,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:05,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1834823465, now seen corresponding path program 1 times [2018-12-02 02:42:05,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:05,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-12-02 02:42:05,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:42:05,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 02:42:05,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 02:42:05,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 02:42:05,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-12-02 02:42:05,306 INFO L87 Difference]: Start difference. First operand 2889 states and 3525 transitions. Second operand 16 states. [2018-12-02 02:42:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:06,924 INFO L93 Difference]: Finished difference Result 4577 states and 5625 transitions. [2018-12-02 02:42:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 02:42:06,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 325 [2018-12-02 02:42:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:06,928 INFO L225 Difference]: With dead ends: 4577 [2018-12-02 02:42:06,929 INFO L226 Difference]: Without dead ends: 2253 [2018-12-02 02:42:06,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 02:42:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2018-12-02 02:42:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2220. [2018-12-02 02:42:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2018-12-02 02:42:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2706 transitions. [2018-12-02 02:42:07,067 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2706 transitions. Word has length 325 [2018-12-02 02:42:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:07,067 INFO L480 AbstractCegarLoop]: Abstraction has 2220 states and 2706 transitions. [2018-12-02 02:42:07,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 02:42:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2706 transitions. [2018-12-02 02:42:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-12-02 02:42:07,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:07,069 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:42:07,070 INFO L423 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:07,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash 70536021, now seen corresponding path program 1 times [2018-12-02 02:42:07,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:07,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2018-12-02 02:42:07,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:42:07,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:42:07,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:07,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 228 proven. 95 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-12-02 02:42:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:42:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-12-02 02:42:07,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-02 02:42:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 02:42:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 02:42:07,787 INFO L87 Difference]: Start difference. First operand 2220 states and 2706 transitions. Second operand 35 states. [2018-12-02 02:42:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:52,645 INFO L93 Difference]: Finished difference Result 12276 states and 15714 transitions. [2018-12-02 02:42:52,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 571 states. [2018-12-02 02:42:52,646 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 394 [2018-12-02 02:42:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:52,660 INFO L225 Difference]: With dead ends: 12276 [2018-12-02 02:42:52,660 INFO L226 Difference]: Without dead ends: 10621 [2018-12-02 02:42:52,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1117 GetRequests, 506 SyntacticMatches, 9 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162907 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=19574, Invalid=344638, Unknown=0, NotChecked=0, Total=364212 [2018-12-02 02:42:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2018-12-02 02:42:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 6893. [2018-12-02 02:42:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6893 states. [2018-12-02 02:42:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 8326 transitions. [2018-12-02 02:42:53,046 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 8326 transitions. Word has length 394 [2018-12-02 02:42:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:53,046 INFO L480 AbstractCegarLoop]: Abstraction has 6893 states and 8326 transitions. [2018-12-02 02:42:53,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-02 02:42:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 8326 transitions. [2018-12-02 02:42:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-12-02 02:42:53,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:53,051 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:42:53,051 INFO L423 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:53,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash -834000138, now seen corresponding path program 1 times [2018-12-02 02:42:53,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-12-02 02:42:53,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:42:53,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:42:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:53,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2018-12-02 02:42:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:42:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-12-02 02:42:53,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 02:42:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 02:42:53,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 02:42:53,387 INFO L87 Difference]: Start difference. First operand 6893 states and 8326 transitions. Second operand 4 states. [2018-12-02 02:42:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:42:53,710 INFO L93 Difference]: Finished difference Result 13651 states and 16506 transitions. [2018-12-02 02:42:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 02:42:53,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 394 [2018-12-02 02:42:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:42:53,721 INFO L225 Difference]: With dead ends: 13651 [2018-12-02 02:42:53,721 INFO L226 Difference]: Without dead ends: 6813 [2018-12-02 02:42:53,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 395 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-12-02 02:42:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6813 states. [2018-12-02 02:42:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6813 to 6813. [2018-12-02 02:42:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6813 states. [2018-12-02 02:42:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6813 states to 6813 states and 8046 transitions. [2018-12-02 02:42:54,057 INFO L78 Accepts]: Start accepts. Automaton has 6813 states and 8046 transitions. Word has length 394 [2018-12-02 02:42:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:42:54,057 INFO L480 AbstractCegarLoop]: Abstraction has 6813 states and 8046 transitions. [2018-12-02 02:42:54,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 02:42:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6813 states and 8046 transitions. [2018-12-02 02:42:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-12-02 02:42:54,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:42:54,062 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:42:54,062 INFO L423 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:42:54,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:42:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1924033091, now seen corresponding path program 1 times [2018-12-02 02:42:54,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:42:54,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:42:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:54,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:42:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2018-12-02 02:42:54,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:42:54,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:42:54,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:42:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:42:54,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:42:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 194 proven. 119 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-12-02 02:42:54,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:42:54,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13] total 39 [2018-12-02 02:42:54,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 02:42:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 02:42:54,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1404, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 02:42:54,869 INFO L87 Difference]: Start difference. First operand 6813 states and 8046 transitions. Second operand 39 states. [2018-12-02 02:44:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:05,868 INFO L93 Difference]: Finished difference Result 28567 states and 34532 transitions. [2018-12-02 02:44:05,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 814 states. [2018-12-02 02:44:05,869 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 395 [2018-12-02 02:44:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:05,915 INFO L225 Difference]: With dead ends: 28567 [2018-12-02 02:44:05,915 INFO L226 Difference]: Without dead ends: 22457 [2018-12-02 02:44:05,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1402 GetRequests, 548 SyntacticMatches, 5 SemanticMatches, 849 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328464 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=29230, Invalid=694120, Unknown=0, NotChecked=0, Total=723350 [2018-12-02 02:44:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22457 states. [2018-12-02 02:44:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22457 to 15931. [2018-12-02 02:44:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15931 states. [2018-12-02 02:44:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15931 states to 15931 states and 18831 transitions. [2018-12-02 02:44:06,870 INFO L78 Accepts]: Start accepts. Automaton has 15931 states and 18831 transitions. Word has length 395 [2018-12-02 02:44:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:06,870 INFO L480 AbstractCegarLoop]: Abstraction has 15931 states and 18831 transitions. [2018-12-02 02:44:06,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 02:44:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15931 states and 18831 transitions. [2018-12-02 02:44:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-12-02 02:44:06,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:06,882 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:06,882 INFO L423 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:06,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1840709700, now seen corresponding path program 1 times [2018-12-02 02:44:06,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:06,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:06,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:06,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 31 proven. 229 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-12-02 02:44:07,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:44:07,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:44:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:07,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:44:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-02 02:44:07,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:44:07,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2018-12-02 02:44:07,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 02:44:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 02:44:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-02 02:44:07,485 INFO L87 Difference]: Start difference. First operand 15931 states and 18831 transitions. Second operand 21 states. [2018-12-02 02:44:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:10,848 INFO L93 Difference]: Finished difference Result 33895 states and 39809 transitions. [2018-12-02 02:44:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 02:44:10,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 404 [2018-12-02 02:44:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:10,875 INFO L225 Difference]: With dead ends: 33895 [2018-12-02 02:44:10,875 INFO L226 Difference]: Without dead ends: 18600 [2018-12-02 02:44:10,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 02:44:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18600 states. [2018-12-02 02:44:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18600 to 15950. [2018-12-02 02:44:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15950 states. [2018-12-02 02:44:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15950 states to 15950 states and 18835 transitions. [2018-12-02 02:44:11,881 INFO L78 Accepts]: Start accepts. Automaton has 15950 states and 18835 transitions. Word has length 404 [2018-12-02 02:44:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:11,881 INFO L480 AbstractCegarLoop]: Abstraction has 15950 states and 18835 transitions. [2018-12-02 02:44:11,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 02:44:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15950 states and 18835 transitions. [2018-12-02 02:44:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-12-02 02:44:11,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:11,893 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:11,893 INFO L423 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:11,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1453997258, now seen corresponding path program 1 times [2018-12-02 02:44:11,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:11,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:11,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2018-12-02 02:44:12,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:44:12,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:44:12,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:12,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:44:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 484 proven. 183 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-12-02 02:44:13,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:44:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2018-12-02 02:44:13,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 02:44:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 02:44:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2053, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 02:44:13,116 INFO L87 Difference]: Start difference. First operand 15950 states and 18835 transitions. Second operand 47 states. [2018-12-02 02:44:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:44:41,438 INFO L93 Difference]: Finished difference Result 47390 states and 57016 transitions. [2018-12-02 02:44:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-12-02 02:44:41,438 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 415 [2018-12-02 02:44:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:44:41,483 INFO L225 Difference]: With dead ends: 47390 [2018-12-02 02:44:41,483 INFO L226 Difference]: Without dead ends: 32368 [2018-12-02 02:44:41,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 458 SyntacticMatches, 9 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29076 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4255, Invalid=73307, Unknown=0, NotChecked=0, Total=77562 [2018-12-02 02:44:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32368 states. [2018-12-02 02:44:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32368 to 20090. [2018-12-02 02:44:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-02 02:44:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 23796 transitions. [2018-12-02 02:44:42,971 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 23796 transitions. Word has length 415 [2018-12-02 02:44:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:44:42,971 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 23796 transitions. [2018-12-02 02:44:42,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 02:44:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 23796 transitions. [2018-12-02 02:44:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-12-02 02:44:42,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:44:42,986 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:44:42,986 INFO L423 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:44:42,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:44:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1477947797, now seen corresponding path program 1 times [2018-12-02 02:44:42,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:44:42,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:44:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:42,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:44:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2018-12-02 02:44:43,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:44:43,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:44:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:44:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:44:43,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:44:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 568 proven. 217 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-12-02 02:44:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:44:44,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-12-02 02:44:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-02 02:44:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-02 02:44:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1963, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 02:44:44,085 INFO L87 Difference]: Start difference. First operand 20090 states and 23796 transitions. Second operand 46 states. [2018-12-02 02:45:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:45:13,857 INFO L93 Difference]: Finished difference Result 59359 states and 71881 transitions. [2018-12-02 02:45:13,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-12-02 02:45:13,857 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 427 [2018-12-02 02:45:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:45:13,922 INFO L225 Difference]: With dead ends: 59359 [2018-12-02 02:45:13,922 INFO L226 Difference]: Without dead ends: 40420 [2018-12-02 02:45:13,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 472 SyntacticMatches, 9 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29066 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4103, Invalid=72903, Unknown=0, NotChecked=0, Total=77006 [2018-12-02 02:45:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40420 states. [2018-12-02 02:45:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40420 to 20079. [2018-12-02 02:45:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20079 states. [2018-12-02 02:45:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20079 states to 20079 states and 23775 transitions. [2018-12-02 02:45:15,540 INFO L78 Accepts]: Start accepts. Automaton has 20079 states and 23775 transitions. Word has length 427 [2018-12-02 02:45:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:45:15,541 INFO L480 AbstractCegarLoop]: Abstraction has 20079 states and 23775 transitions. [2018-12-02 02:45:15,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-02 02:45:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20079 states and 23775 transitions. [2018-12-02 02:45:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-12-02 02:45:15,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:45:15,556 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:45:15,556 INFO L423 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:45:15,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:45:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1732518901, now seen corresponding path program 1 times [2018-12-02 02:45:15,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:45:15,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:45:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:15,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2018-12-02 02:45:15,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:45:15,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:45:15,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:15,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:45:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 408 proven. 48 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2018-12-02 02:45:15,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:45:15,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2018-12-02 02:45:15,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 02:45:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 02:45:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:45:15,976 INFO L87 Difference]: Start difference. First operand 20079 states and 23775 transitions. Second operand 11 states. [2018-12-02 02:45:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:45:17,240 INFO L93 Difference]: Finished difference Result 31639 states and 37474 transitions. [2018-12-02 02:45:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 02:45:17,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 453 [2018-12-02 02:45:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:45:17,262 INFO L225 Difference]: With dead ends: 31639 [2018-12-02 02:45:17,262 INFO L226 Difference]: Without dead ends: 12633 [2018-12-02 02:45:17,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 446 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-12-02 02:45:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12633 states. [2018-12-02 02:45:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12633 to 12633. [2018-12-02 02:45:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12633 states. [2018-12-02 02:45:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 14879 transitions. [2018-12-02 02:45:18,201 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 14879 transitions. Word has length 453 [2018-12-02 02:45:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:45:18,201 INFO L480 AbstractCegarLoop]: Abstraction has 12633 states and 14879 transitions. [2018-12-02 02:45:18,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 02:45:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 14879 transitions. [2018-12-02 02:45:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-12-02 02:45:18,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:45:18,210 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:45:18,210 INFO L423 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:45:18,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:45:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1289120039, now seen corresponding path program 1 times [2018-12-02 02:45:18,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:45:18,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:45:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:18,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2018-12-02 02:45:18,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:45:18,691 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:45:18,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:18,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:45:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 408 proven. 4 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-12-02 02:45:19,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:45:19,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7] total 33 [2018-12-02 02:45:19,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 02:45:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 02:45:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 02:45:19,024 INFO L87 Difference]: Start difference. First operand 12633 states and 14879 transitions. Second operand 33 states. [2018-12-02 02:45:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:45:25,375 INFO L93 Difference]: Finished difference Result 28884 states and 34681 transitions. [2018-12-02 02:45:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-02 02:45:25,376 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 452 [2018-12-02 02:45:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:45:25,400 INFO L225 Difference]: With dead ends: 28884 [2018-12-02 02:45:25,400 INFO L226 Difference]: Without dead ends: 16978 [2018-12-02 02:45:25,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 466 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1328, Invalid=8974, Unknown=0, NotChecked=0, Total=10302 [2018-12-02 02:45:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16978 states. [2018-12-02 02:45:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16978 to 12675. [2018-12-02 02:45:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2018-12-02 02:45:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 14900 transitions. [2018-12-02 02:45:26,430 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 14900 transitions. Word has length 452 [2018-12-02 02:45:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:45:26,430 INFO L480 AbstractCegarLoop]: Abstraction has 12675 states and 14900 transitions. [2018-12-02 02:45:26,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 02:45:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 14900 transitions. [2018-12-02 02:45:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-12-02 02:45:26,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:45:26,439 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:45:26,439 INFO L423 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:45:26,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:45:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1686822436, now seen corresponding path program 1 times [2018-12-02 02:45:26,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:45:26,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:45:26,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:26,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:26,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 67 proven. 48 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2018-12-02 02:45:26,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:45:26,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:45:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:26,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:45:26,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 403 proven. 161 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-02 02:45:26,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:45:26,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-12-02 02:45:26,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 02:45:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 02:45:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 02:45:26,987 INFO L87 Difference]: Start difference. First operand 12675 states and 14900 transitions. Second operand 18 states. [2018-12-02 02:45:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:45:31,828 INFO L93 Difference]: Finished difference Result 38530 states and 45653 transitions. [2018-12-02 02:45:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-02 02:45:31,828 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 453 [2018-12-02 02:45:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:45:31,870 INFO L225 Difference]: With dead ends: 38530 [2018-12-02 02:45:31,870 INFO L226 Difference]: Without dead ends: 26940 [2018-12-02 02:45:31,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 487 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2018-12-02 02:45:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26940 states. [2018-12-02 02:45:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26940 to 23313. [2018-12-02 02:45:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23313 states. [2018-12-02 02:45:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23313 states to 23313 states and 27486 transitions. [2018-12-02 02:45:33,786 INFO L78 Accepts]: Start accepts. Automaton has 23313 states and 27486 transitions. Word has length 453 [2018-12-02 02:45:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:45:33,786 INFO L480 AbstractCegarLoop]: Abstraction has 23313 states and 27486 transitions. [2018-12-02 02:45:33,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 02:45:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23313 states and 27486 transitions. [2018-12-02 02:45:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-12-02 02:45:33,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:45:33,802 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:45:33,802 INFO L423 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:45:33,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:45:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1064620325, now seen corresponding path program 1 times [2018-12-02 02:45:33,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:45:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:45:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:45:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2018-12-02 02:45:34,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:45:34,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:45:34,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:45:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:45:34,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:45:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 454 proven. 111 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-12-02 02:45:34,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:45:34,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 43 [2018-12-02 02:45:34,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 02:45:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 02:45:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 02:45:34,771 INFO L87 Difference]: Start difference. First operand 23313 states and 27486 transitions. Second operand 43 states. [2018-12-02 02:45:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:45:59,030 INFO L93 Difference]: Finished difference Result 79028 states and 96146 transitions. [2018-12-02 02:45:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-12-02 02:45:59,031 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 453 [2018-12-02 02:45:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:45:59,122 INFO L225 Difference]: With dead ends: 79028 [2018-12-02 02:45:59,122 INFO L226 Difference]: Without dead ends: 57032 [2018-12-02 02:45:59,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 469 SyntacticMatches, 5 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20281 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4294, Invalid=52588, Unknown=0, NotChecked=0, Total=56882 [2018-12-02 02:45:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57032 states. [2018-12-02 02:46:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57032 to 34653. [2018-12-02 02:46:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34653 states. [2018-12-02 02:46:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34653 states to 34653 states and 40953 transitions. [2018-12-02 02:46:02,371 INFO L78 Accepts]: Start accepts. Automaton has 34653 states and 40953 transitions. Word has length 453 [2018-12-02 02:46:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:46:02,371 INFO L480 AbstractCegarLoop]: Abstraction has 34653 states and 40953 transitions. [2018-12-02 02:46:02,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 02:46:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34653 states and 40953 transitions. [2018-12-02 02:46:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-12-02 02:46:02,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:46:02,397 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:46:02,397 INFO L423 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:46:02,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:46:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2128295356, now seen corresponding path program 1 times [2018-12-02 02:46:02,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:46:02,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:46:02,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:02,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:02,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 34 proven. 16 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2018-12-02 02:46:02,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:46:02,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:46:02,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:02,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:46:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 454 proven. 111 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-12-02 02:46:03,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:46:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 43 [2018-12-02 02:46:03,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 02:46:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 02:46:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 02:46:03,351 INFO L87 Difference]: Start difference. First operand 34653 states and 40953 transitions. Second operand 43 states. [2018-12-02 02:46:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:46:28,170 INFO L93 Difference]: Finished difference Result 111059 states and 135263 transitions. [2018-12-02 02:46:28,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-12-02 02:46:28,171 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 454 [2018-12-02 02:46:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:46:28,300 INFO L225 Difference]: With dead ends: 111059 [2018-12-02 02:46:28,300 INFO L226 Difference]: Without dead ends: 78081 [2018-12-02 02:46:28,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 470 SyntacticMatches, 5 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20272 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4294, Invalid=52588, Unknown=0, NotChecked=0, Total=56882 [2018-12-02 02:46:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78081 states. [2018-12-02 02:46:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78081 to 46060. [2018-12-02 02:46:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46060 states. [2018-12-02 02:46:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46060 states to 46060 states and 54495 transitions. [2018-12-02 02:46:32,982 INFO L78 Accepts]: Start accepts. Automaton has 46060 states and 54495 transitions. Word has length 454 [2018-12-02 02:46:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:46:32,982 INFO L480 AbstractCegarLoop]: Abstraction has 46060 states and 54495 transitions. [2018-12-02 02:46:32,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 02:46:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 46060 states and 54495 transitions. [2018-12-02 02:46:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-12-02 02:46:33,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:46:33,016 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:46:33,017 INFO L423 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:46:33,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:46:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash -504075518, now seen corresponding path program 1 times [2018-12-02 02:46:33,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:46:33,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:46:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:33,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2018-12-02 02:46:33,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:46:33,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:46:33,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:33,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:46:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 427 proven. 52 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2018-12-02 02:46:33,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:46:33,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-12-02 02:46:33,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:46:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:46:33,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:46:33,375 INFO L87 Difference]: Start difference. First operand 46060 states and 54495 transitions. Second operand 13 states. [2018-12-02 02:46:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:46:37,187 INFO L93 Difference]: Finished difference Result 76147 states and 90125 transitions. [2018-12-02 02:46:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 02:46:37,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 454 [2018-12-02 02:46:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:46:37,243 INFO L225 Difference]: With dead ends: 76147 [2018-12-02 02:46:37,243 INFO L226 Difference]: Without dead ends: 31702 [2018-12-02 02:46:37,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 448 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-12-02 02:46:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31702 states. [2018-12-02 02:46:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31702 to 31295. [2018-12-02 02:46:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31295 states. [2018-12-02 02:46:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31295 states to 31295 states and 36838 transitions. [2018-12-02 02:46:40,306 INFO L78 Accepts]: Start accepts. Automaton has 31295 states and 36838 transitions. Word has length 454 [2018-12-02 02:46:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:46:40,306 INFO L480 AbstractCegarLoop]: Abstraction has 31295 states and 36838 transitions. [2018-12-02 02:46:40,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:46:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 31295 states and 36838 transitions. [2018-12-02 02:46:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-12-02 02:46:40,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:46:40,326 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:46:40,326 INFO L423 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:46:40,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:46:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash -76685598, now seen corresponding path program 1 times [2018-12-02 02:46:40,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:46:40,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:46:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:40,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1213 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2018-12-02 02:46:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:46:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 02:46:40,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 02:46:40,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 02:46:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:46:40,455 INFO L87 Difference]: Start difference. First operand 31295 states and 36838 transitions. Second operand 11 states. [2018-12-02 02:46:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:46:48,022 INFO L93 Difference]: Finished difference Result 88981 states and 107521 transitions. [2018-12-02 02:46:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 02:46:48,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2018-12-02 02:46:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:46:48,118 INFO L225 Difference]: With dead ends: 88981 [2018-12-02 02:46:48,118 INFO L226 Difference]: Without dead ends: 59355 [2018-12-02 02:46:48,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 02:46:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59355 states. [2018-12-02 02:46:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59355 to 27595. [2018-12-02 02:46:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27595 states. [2018-12-02 02:46:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27595 states to 27595 states and 32567 transitions. [2018-12-02 02:46:51,314 INFO L78 Accepts]: Start accepts. Automaton has 27595 states and 32567 transitions. Word has length 454 [2018-12-02 02:46:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:46:51,315 INFO L480 AbstractCegarLoop]: Abstraction has 27595 states and 32567 transitions. [2018-12-02 02:46:51,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 02:46:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27595 states and 32567 transitions. [2018-12-02 02:46:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-02 02:46:51,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:46:51,335 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 02:46:51,335 INFO L423 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:46:51,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:46:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1240116528, now seen corresponding path program 1 times [2018-12-02 02:46:51,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:46:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:46:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:46:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-02 02:46:51,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:46:51,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/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-12-02 02:46:51,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:46:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:46:51,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:46:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 938 trivial. 0 not checked. [2018-12-02 02:46:51,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:46:51,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-12-02 02:46:51,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 02:46:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 02:46:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 02:46:51,672 INFO L87 Difference]: Start difference. First operand 27595 states and 32567 transitions. Second operand 13 states. [2018-12-02 02:46:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:46:57,077 INFO L93 Difference]: Finished difference Result 73577 states and 86829 transitions. [2018-12-02 02:46:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 02:46:57,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 463 [2018-12-02 02:46:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:46:57,153 INFO L225 Difference]: With dead ends: 73577 [2018-12-02 02:46:57,153 INFO L226 Difference]: Without dead ends: 47099 [2018-12-02 02:46:57,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 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-12-02 02:46:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47099 states. [2018-12-02 02:47:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47099 to 28183. [2018-12-02 02:47:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28183 states. [2018-12-02 02:47:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28183 states to 28183 states and 32387 transitions. [2018-12-02 02:47:00,339 INFO L78 Accepts]: Start accepts. Automaton has 28183 states and 32387 transitions. Word has length 463 [2018-12-02 02:47:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:47:00,340 INFO L480 AbstractCegarLoop]: Abstraction has 28183 states and 32387 transitions. [2018-12-02 02:47:00,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 02:47:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28183 states and 32387 transitions. [2018-12-02 02:47:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-12-02 02:47:00,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:47:00,360 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:47:00,360 INFO L423 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:47:00,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:47:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1787798829, now seen corresponding path program 1 times [2018-12-02 02:47:00,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:47:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:47:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:47:00,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:47:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:47:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:47:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:47:00,516 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:47:00,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:47:00 BoogieIcfgContainer [2018-12-02 02:47:00,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:47:00,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:47:00,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:47:00,719 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:47:00,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:41:45" (3/4) ... [2018-12-02 02:47:00,721 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 02:47:00,907 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a73c7222-cb33-4234-9cdc-ccbb57ccc780/bin-2019/uautomizer/witness.graphml [2018-12-02 02:47:00,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:47:00,907 INFO L168 Benchmark]: Toolchain (without parser) took 316242.86 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 954.4 MB in the beginning and 1.8 GB in the end (delta: -871.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,908 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:47:00,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:47:00,909 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,909 INFO L168 Benchmark]: RCFGBuilder took 358.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,909 INFO L168 Benchmark]: TraceAbstraction took 315423.68 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -922.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,910 INFO L168 Benchmark]: Witness Printer took 187.79 ms. Allocated memory is still 4.5 GB. Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 11.5 GB. [2018-12-02 02:47:00,911 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 228.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 358.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 315423.68 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -922.1 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 187.79 ms. Allocated memory is still 4.5 GB. Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 133.1 MB). Peak memory consumption was 133.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 ; [L81] _Bool gate1Failed ; [L82] _Bool gate2Failed ; [L83] _Bool gate3Failed ; [L84] msg_t VALUE1 ; [L85] msg_t VALUE2 ; [L86] msg_t VALUE3 ; [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 ; [L97] int8_t votedValue_History_0 ; [L98] int8_t votedValue_History_1 ; [L99] int8_t votedValue_History_2 ; [L519] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [\old(g1v)=293, \old(g1v_new)=288, \old(g1v_old)=280, \old(g2v)=267, \old(g2v_new)=260, \old(g2v_old)=287, \old(g3v)=273, \old(g3v_new)=279, \old(g3v_old)=276, \old(gate1Failed)=21, \old(gate1Failed_History_0)=30, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=3, \old(gate2Failed)=16, \old(gate2Failed_History_0)=19, \old(gate2Failed_History_1)=10, \old(gate2Failed_History_2)=36, \old(gate3Failed)=38, \old(gate3Failed_History_0)=34, \old(gate3Failed_History_1)=22, \old(gate3Failed_History_2)=14, \old(nomsg)=274, \old(VALUE1)=284, \old(VALUE2)=258, \old(VALUE3)=265, \old(votedValue_History_0)=264, \old(votedValue_History_1)=291, \old(votedValue_History_2)=271, 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] [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] gate1Failed = __VERIFIER_nondet_bool() [L528] gate2Failed = __VERIFIER_nondet_bool() [L529] gate3Failed = __VERIFIER_nondet_bool() [L530] VALUE1 = __VERIFIER_nondet_char() [L531] VALUE2 = __VERIFIER_nondet_char() [L532] VALUE3 = __VERIFIER_nondet_char() [L533] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L534] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L535] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L536] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L537] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L538] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L539] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L540] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L541] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L542] votedValue_History_0 = __VERIFIER_nondet_char() [L543] votedValue_History_1 = __VERIFIER_nondet_char() [L544] votedValue_History_2 = __VERIFIER_nondet_char() [L545] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] [L545] RET, 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, init()=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L545] i2 = init() [L547] g1v_old = nomsg [L548] g1v_new = nomsg [L549] g2v_old = nomsg [L550] g2v_new = nomsg [L551] g3v_old = nomsg [L552] g3v_new = nomsg [L553] 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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] COND TRUE i2 < 10 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L556] 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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=27, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=1, \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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=0, gate1Failed_History_1=25, gate1Failed_History_2=29, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] gate1Failed_History_0 = buf VAL [\old(buf)=1, \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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L389] RET 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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND TRUE \read(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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : 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)=27, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=25, \old(gate1Failed_History_2)=29, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L391] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L556] RET 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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L557] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=26, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L420] RET 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=26, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=33, \old(gate2Failed_History_2)=5, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L422] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L557] RET 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=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L558] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=12, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=13, 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] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L451] RET 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=12, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=13, \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=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L558] RET 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L559] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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 [L487] voted_value = VALUE1 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L515] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L559] RET 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=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L566] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! gate1Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L297] COND FALSE !(! gate2Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] COND TRUE ! gate3Failed [L301] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] [L566] RET, 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L566] c1 = check() [L567] 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L579] COND FALSE !(! 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L567] RET 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L568] i2 ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L554] COND TRUE i2 < 10 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L556] 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=25, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L389] RET 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=25, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L556] RET 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L557] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L420] RET 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L422] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=1, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L557] RET 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L558] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, 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] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] RET 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] 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)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=6, \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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L558] RET 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=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L559] 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)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND TRUE (int )VALUE1 == (int )VALUE2 [L487] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] 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)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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] 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)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=255, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L515] 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)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L559] RET 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L560] g1v_old = g1v_new [L561] g1v_new = nomsg [L562] g2v_old = g2v_new [L563] g2v_new = nomsg [L564] g3v_old = g3v_new [L565] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND FALSE !(! 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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)=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L155] COND TRUE historyIndex == 1 [L156] 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=-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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] RET, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L345] tmp___10 = read_history_int8(3, 1) [L346] COND TRUE (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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L347] tmp___6 = read_history_int8(3, 0) [L348] COND TRUE (int )tmp___6 == (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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L349] tmp___7 = read_history_bool(0, 1) [L350] COND TRUE \read(tmp___7) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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)=1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L351] tmp___8 = read_history_bool(1, 1) [L352] COND TRUE \read(tmp___8) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L353] tmp___9 = read_history_bool(2, 1) [L354] COND TRUE ! tmp___9 [L355] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] RET, 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] c1 = check() [L567] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L579] 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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L581] __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=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, 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=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, 315.3s OverallTime, 48 OverallIterations, 16 TraceHistogramMax, 272.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20373 SDtfs, 48104 SDslu, 49662 SDs, 0 SdLazy, 332548 SolverSat, 25208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 120.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11817 GetRequests, 8607 SyntacticMatches, 72 SemanticMatches, 3138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597750 ImplicationChecksByTransitivity, 88.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46060occurred in iteration=44, 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: 27.9s AutomataMinimizationTime, 47 MinimizatonAttempts, 165370 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 20400 NumberOfCodeBlocks, 20400 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 19867 ConstructedInterpolants, 0 QuantifiedInterpolants, 15657876 SizeOfPredicates, 71 NumberOfNonLiveVariables, 37933 ConjunctsInSsa, 647 ConjunctsInUnsatCore, 69 InterpolantComputations, 34 PerfectInterpolantSequences, 43570/45168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...