./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:25:22,322 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:25:22,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:25:22,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:25:22,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:25:22,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:25:22,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:25:22,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:25:22,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:25:22,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:25:22,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:25:22,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:25:22,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:25:22,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:25:22,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:25:22,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:25:22,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:25:22,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:25:22,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:25:22,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:25:22,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:25:22,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:25:22,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:25:22,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:25:22,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:25:22,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:25:22,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:25:22,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:25:22,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:25:22,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:25:22,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:25:22,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:25:22,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:25:22,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:25:22,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:25:22,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:25:22,352 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:25:22,362 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:25:22,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:25:22,363 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:25:22,363 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:25:22,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:25:22,363 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:25:22,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:25:22,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:25:22,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:25:22,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:25:22,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:25:22,366 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:25:22,367 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:25:22,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:25:22,367 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_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 077fe0fcd97be15aa2e10e89ce167f8b22d1af7e [2018-11-28 11:25:22,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:25:22,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:25:22,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:25:22,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:25:22,403 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:25:22,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-28 11:25:22,446 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/data/99f62cc27/49f2eefab9b541d5909f3e9028758a39/FLAGe63de88cb [2018-11-28 11:25:22,855 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:25:22,855 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-28 11:25:22,861 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/data/99f62cc27/49f2eefab9b541d5909f3e9028758a39/FLAGe63de88cb [2018-11-28 11:25:22,871 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/data/99f62cc27/49f2eefab9b541d5909f3e9028758a39 [2018-11-28 11:25:22,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:25:22,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:25:22,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:22,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:25:22,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:25:22,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:22" (1/1) ... [2018-11-28 11:25:22,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246385e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:22, skipping insertion in model container [2018-11-28 11:25:22,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:22" (1/1) ... [2018-11-28 11:25:22,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:25:22,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:25:23,054 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:23,059 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:25:23,142 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:25:23,158 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:25:23,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23 WrapperNode [2018-11-28 11:25:23,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:25:23,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:23,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:25:23,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:25:23,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:25:23,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:25:23,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:25:23,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:25:23,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... [2018-11-28 11:25:23,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:25:23,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:25:23,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:25:23,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:25:23,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:25:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2018-11-28 11:25:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2018-11-28 11:25:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-28 11:25:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-28 11:25:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2018-11-28 11:25:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2018-11-28 11:25:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2018-11-28 11:25:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2018-11-28 11:25:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2018-11-28 11:25:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2018-11-28 11:25:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2018-11-28 11:25:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2018-11-28 11:25:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:25:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:25:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-28 11:25:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-28 11:25:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2018-11-28 11:25:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2018-11-28 11:25:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2018-11-28 11:25:23,247 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2018-11-28 11:25:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:25:23,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:25:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2018-11-28 11:25:23,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2018-11-28 11:25:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:25:23,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:25:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2018-11-28 11:25:23,248 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2018-11-28 11:25:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2018-11-28 11:25:23,249 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2018-11-28 11:25:23,722 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:25:23,722 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 11:25:23,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:23 BoogieIcfgContainer [2018-11-28 11:25:23,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:25:23,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:25:23,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:25:23,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:25:23,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:25:22" (1/3) ... [2018-11-28 11:25:23,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e515b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:25:23, skipping insertion in model container [2018-11-28 11:25:23,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:23" (2/3) ... [2018-11-28 11:25:23,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e515b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:25:23, skipping insertion in model container [2018-11-28 11:25:23,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:23" (3/3) ... [2018-11-28 11:25:23,729 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_false-unreach-call.2.ufo.UNBOUNDED.pals.c [2018-11-28 11:25:23,737 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:25:23,743 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:25:23,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:25:23,772 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:25:23,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:25:23,773 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:25:23,773 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:25:23,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:25:23,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:25:23,773 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:25:23,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:25:23,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:25:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-28 11:25:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 11:25:23,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:23,792 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-11-28 11:25:23,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:23,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 439318879, now seen corresponding path program 1 times [2018-11-28 11:25:23,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:23,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:23,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:23,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:23,973 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-11-28 11:25:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,076 INFO L93 Difference]: Finished difference Result 410 states and 669 transitions. [2018-11-28 11:25:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 11:25:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,090 INFO L225 Difference]: With dead ends: 410 [2018-11-28 11:25:24,090 INFO L226 Difference]: Without dead ends: 211 [2018-11-28 11:25:24,095 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-11-28 11:25:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-28 11:25:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-11-28 11:25:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-28 11:25:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions. [2018-11-28 11:25:24,138 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 21 [2018-11-28 11:25:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,138 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 311 transitions. [2018-11-28 11:25:24,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions. [2018-11-28 11:25:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 11:25:24,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,140 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-11-28 11:25:24,140 INFO L423 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1455554404, now seen corresponding path program 1 times [2018-11-28 11:25:24,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:24,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:24,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:24,213 INFO L87 Difference]: Start difference. First operand 209 states and 311 transitions. Second operand 4 states. [2018-11-28 11:25:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,262 INFO L93 Difference]: Finished difference Result 425 states and 639 transitions. [2018-11-28 11:25:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-28 11:25:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,265 INFO L225 Difference]: With dead ends: 425 [2018-11-28 11:25:24,265 INFO L226 Difference]: Without dead ends: 225 [2018-11-28 11:25:24,266 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-11-28 11:25:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-28 11:25:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-11-28 11:25:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-28 11:25:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 327 transitions. [2018-11-28 11:25:24,284 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 327 transitions. Word has length 22 [2018-11-28 11:25:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,284 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 327 transitions. [2018-11-28 11:25:24,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 327 transitions. [2018-11-28 11:25:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:25:24,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,287 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-11-28 11:25:24,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 971437215, now seen corresponding path program 1 times [2018-11-28 11:25:24,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:24,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:25:24,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:25:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:25:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:25:24,336 INFO L87 Difference]: Start difference. First operand 222 states and 327 transitions. Second operand 3 states. [2018-11-28 11:25:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,379 INFO L93 Difference]: Finished difference Result 457 states and 685 transitions. [2018-11-28 11:25:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:25:24,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:25:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,381 INFO L225 Difference]: With dead ends: 457 [2018-11-28 11:25:24,381 INFO L226 Difference]: Without dead ends: 251 [2018-11-28 11:25:24,382 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-11-28 11:25:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-28 11:25:24,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 224. [2018-11-28 11:25:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 11:25:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 329 transitions. [2018-11-28 11:25:24,399 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 329 transitions. Word has length 30 [2018-11-28 11:25:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,399 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 329 transitions. [2018-11-28 11:25:24,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:25:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 329 transitions. [2018-11-28 11:25:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 11:25:24,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,401 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-11-28 11:25:24,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash -58774386, now seen corresponding path program 1 times [2018-11-28 11:25:24,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:24,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:25:24,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:25:24,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:25:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:25:24,492 INFO L87 Difference]: Start difference. First operand 224 states and 329 transitions. Second operand 5 states. [2018-11-28 11:25:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,519 INFO L93 Difference]: Finished difference Result 434 states and 643 transitions. [2018-11-28 11:25:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-28 11:25:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,521 INFO L225 Difference]: With dead ends: 434 [2018-11-28 11:25:24,522 INFO L226 Difference]: Without dead ends: 232 [2018-11-28 11:25:24,523 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-11-28 11:25:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-28 11:25:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2018-11-28 11:25:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-28 11:25:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2018-11-28 11:25:24,535 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 38 [2018-11-28 11:25:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,536 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2018-11-28 11:25:24,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:25:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2018-11-28 11:25:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:25:24,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,537 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-11-28 11:25:24,537 INFO L423 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash 573440011, now seen corresponding path program 1 times [2018-11-28 11:25:24,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:25:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:24,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:24,595 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand 4 states. [2018-11-28 11:25:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,616 INFO L93 Difference]: Finished difference Result 395 states and 582 transitions. [2018-11-28 11:25:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:24,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-28 11:25:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,618 INFO L225 Difference]: With dead ends: 395 [2018-11-28 11:25:24,618 INFO L226 Difference]: Without dead ends: 224 [2018-11-28 11:25:24,619 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-11-28 11:25:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-28 11:25:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-11-28 11:25:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-28 11:25:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 324 transitions. [2018-11-28 11:25:24,631 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 324 transitions. Word has length 39 [2018-11-28 11:25:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,631 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 324 transitions. [2018-11-28 11:25:24,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 324 transitions. [2018-11-28 11:25:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:25:24,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,632 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-11-28 11:25:24,632 INFO L423 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1074419851, now seen corresponding path program 1 times [2018-11-28 11:25:24,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:25:24,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:24,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:24,677 INFO L87 Difference]: Start difference. First operand 224 states and 324 transitions. Second operand 4 states. [2018-11-28 11:25:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,736 INFO L93 Difference]: Finished difference Result 444 states and 652 transitions. [2018-11-28 11:25:24,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-28 11:25:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,738 INFO L225 Difference]: With dead ends: 444 [2018-11-28 11:25:24,738 INFO L226 Difference]: Without dead ends: 243 [2018-11-28 11:25:24,739 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-11-28 11:25:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-28 11:25:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2018-11-28 11:25:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-28 11:25:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 343 transitions. [2018-11-28 11:25:24,753 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 343 transitions. Word has length 41 [2018-11-28 11:25:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 343 transitions. [2018-11-28 11:25:24,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 343 transitions. [2018-11-28 11:25:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:25:24,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,755 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-11-28 11:25:24,755 INFO L423 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash 724098630, now seen corresponding path program 1 times [2018-11-28 11:25:24,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:25:24,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:24,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:24,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:24,802 INFO L87 Difference]: Start difference. First operand 240 states and 343 transitions. Second operand 4 states. [2018-11-28 11:25:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,860 INFO L93 Difference]: Finished difference Result 464 states and 680 transitions. [2018-11-28 11:25:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-28 11:25:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,863 INFO L225 Difference]: With dead ends: 464 [2018-11-28 11:25:24,863 INFO L226 Difference]: Without dead ends: 249 [2018-11-28 11:25:24,864 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-11-28 11:25:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-28 11:25:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-11-28 11:25:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-28 11:25:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 351 transitions. [2018-11-28 11:25:24,877 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 351 transitions. Word has length 41 [2018-11-28 11:25:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 351 transitions. [2018-11-28 11:25:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 351 transitions. [2018-11-28 11:25:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:25:24,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,879 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-11-28 11:25:24,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 876297553, now seen corresponding path program 1 times [2018-11-28 11:25:24,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:25:24,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:24,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:25:24,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:25:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:25:24,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:25:24,935 INFO L87 Difference]: Start difference. First operand 247 states and 351 transitions. Second operand 5 states. [2018-11-28 11:25:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:24,962 INFO L93 Difference]: Finished difference Result 463 states and 667 transitions. [2018-11-28 11:25:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:24,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-28 11:25:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:24,965 INFO L225 Difference]: With dead ends: 463 [2018-11-28 11:25:24,965 INFO L226 Difference]: Without dead ends: 249 [2018-11-28 11:25:24,966 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-11-28 11:25:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-28 11:25:24,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-11-28 11:25:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-28 11:25:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 350 transitions. [2018-11-28 11:25:24,979 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 350 transitions. Word has length 59 [2018-11-28 11:25:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:24,979 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 350 transitions. [2018-11-28 11:25:24,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:25:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 350 transitions. [2018-11-28 11:25:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:25:24,980 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:24,981 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-11-28 11:25:24,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:24,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1846133806, now seen corresponding path program 1 times [2018-11-28 11:25:24,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:24,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:25:25,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:25,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:25,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:25,031 INFO L87 Difference]: Start difference. First operand 247 states and 350 transitions. Second operand 4 states. [2018-11-28 11:25:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:25,123 INFO L93 Difference]: Finished difference Result 477 states and 689 transitions. [2018-11-28 11:25:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:25,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-28 11:25:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:25,126 INFO L225 Difference]: With dead ends: 477 [2018-11-28 11:25:25,126 INFO L226 Difference]: Without dead ends: 268 [2018-11-28 11:25:25,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-11-28 11:25:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-28 11:25:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2018-11-28 11:25:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-28 11:25:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 371 transitions. [2018-11-28 11:25:25,148 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 371 transitions. Word has length 62 [2018-11-28 11:25:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:25,149 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 371 transitions. [2018-11-28 11:25:25,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 371 transitions. [2018-11-28 11:25:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 11:25:25,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:25,150 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-11-28 11:25:25,150 INFO L423 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:25,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -44548726, now seen corresponding path program 1 times [2018-11-28 11:25:25,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:25,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:25:25,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:25,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:25,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:25,207 INFO L87 Difference]: Start difference. First operand 265 states and 371 transitions. Second operand 4 states. [2018-11-28 11:25:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:25,274 INFO L93 Difference]: Finished difference Result 484 states and 693 transitions. [2018-11-28 11:25:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:25,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 11:25:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:25,276 INFO L225 Difference]: With dead ends: 484 [2018-11-28 11:25:25,276 INFO L226 Difference]: Without dead ends: 259 [2018-11-28 11:25:25,277 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-11-28 11:25:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-28 11:25:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-11-28 11:25:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-28 11:25:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2018-11-28 11:25:25,286 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 63 [2018-11-28 11:25:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:25,287 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2018-11-28 11:25:25,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2018-11-28 11:25:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 11:25:25,287 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:25,288 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-11-28 11:25:25,288 INFO L423 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:25,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1125308013, now seen corresponding path program 1 times [2018-11-28 11:25:25,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:25,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-28 11:25:25,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:25,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:25:25,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:25:25,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:25:25,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:25:25,340 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand 5 states. [2018-11-28 11:25:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:25,366 INFO L93 Difference]: Finished difference Result 471 states and 660 transitions. [2018-11-28 11:25:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:25,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-11-28 11:25:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:25,368 INFO L225 Difference]: With dead ends: 471 [2018-11-28 11:25:25,368 INFO L226 Difference]: Without dead ends: 261 [2018-11-28 11:25:25,368 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-11-28 11:25:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-28 11:25:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-11-28 11:25:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-28 11:25:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 356 transitions. [2018-11-28 11:25:25,376 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 356 transitions. Word has length 82 [2018-11-28 11:25:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:25,377 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 356 transitions. [2018-11-28 11:25:25,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:25:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 356 transitions. [2018-11-28 11:25:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 11:25:25,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:25,378 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-11-28 11:25:25,378 INFO L423 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:25,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -693579696, now seen corresponding path program 1 times [2018-11-28 11:25:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-28 11:25:25,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:25,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:25,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:25,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:25,420 INFO L87 Difference]: Start difference. First operand 259 states and 356 transitions. Second operand 4 states. [2018-11-28 11:25:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:25,462 INFO L93 Difference]: Finished difference Result 460 states and 658 transitions. [2018-11-28 11:25:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:25,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-11-28 11:25:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:25,464 INFO L225 Difference]: With dead ends: 460 [2018-11-28 11:25:25,464 INFO L226 Difference]: Without dead ends: 257 [2018-11-28 11:25:25,465 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-11-28 11:25:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-28 11:25:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-11-28 11:25:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 11:25:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 352 transitions. [2018-11-28 11:25:25,473 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 352 transitions. Word has length 85 [2018-11-28 11:25:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:25,473 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 352 transitions. [2018-11-28 11:25:25,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 352 transitions. [2018-11-28 11:25:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 11:25:25,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:25,474 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-11-28 11:25:25,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:25,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1340875375, now seen corresponding path program 1 times [2018-11-28 11:25:25,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:25,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:25,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-28 11:25:25,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:25,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:25,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-28 11:25:25,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:25:25,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-28 11:25:25,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:25:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:25:25,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:25:25,729 INFO L87 Difference]: Start difference. First operand 257 states and 352 transitions. Second operand 6 states. [2018-11-28 11:25:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:25,933 INFO L93 Difference]: Finished difference Result 610 states and 848 transitions. [2018-11-28 11:25:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:25:25,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-28 11:25:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:25,935 INFO L225 Difference]: With dead ends: 610 [2018-11-28 11:25:25,935 INFO L226 Difference]: Without dead ends: 296 [2018-11-28 11:25:25,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:25:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-28 11:25:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2018-11-28 11:25:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 11:25:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2018-11-28 11:25:25,948 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 100 [2018-11-28 11:25:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:25,948 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2018-11-28 11:25:25,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:25:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2018-11-28 11:25:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-28 11:25:25,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:25,950 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-11-28 11:25:25,950 INFO L423 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:25,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1874453946, now seen corresponding path program 1 times [2018-11-28 11:25:25,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:25,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-28 11:25:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:25:26,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:25:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:25:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:25:26,010 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand 5 states. [2018-11-28 11:25:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,023 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2018-11-28 11:25:26,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:26,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-11-28 11:25:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,025 INFO L225 Difference]: With dead ends: 436 [2018-11-28 11:25:26,025 INFO L226 Difference]: Without dead ends: 266 [2018-11-28 11:25:26,025 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-11-28 11:25:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-28 11:25:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-11-28 11:25:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 11:25:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2018-11-28 11:25:26,032 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 144 [2018-11-28 11:25:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,032 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2018-11-28 11:25:26,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:25:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2018-11-28 11:25:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-28 11:25:26,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,034 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-11-28 11:25:26,034 INFO L423 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1418683508, now seen corresponding path program 1 times [2018-11-28 11:25:26,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-28 11:25:26,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,089 INFO L87 Difference]: Start difference. First operand 266 states and 351 transitions. Second operand 4 states. [2018-11-28 11:25:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,118 INFO L93 Difference]: Finished difference Result 435 states and 596 transitions. [2018-11-28 11:25:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:26,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-28 11:25:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,120 INFO L225 Difference]: With dead ends: 435 [2018-11-28 11:25:26,120 INFO L226 Difference]: Without dead ends: 272 [2018-11-28 11:25:26,121 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-11-28 11:25:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-28 11:25:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-11-28 11:25:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-28 11:25:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 354 transitions. [2018-11-28 11:25:26,128 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 354 transitions. Word has length 161 [2018-11-28 11:25:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,129 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 354 transitions. [2018-11-28 11:25:26,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 354 transitions. [2018-11-28 11:25:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-28 11:25:26,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,131 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-11-28 11:25:26,131 INFO L423 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1558201541, now seen corresponding path program 1 times [2018-11-28 11:25:26,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-28 11:25:26,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,190 INFO L87 Difference]: Start difference. First operand 270 states and 354 transitions. Second operand 4 states. [2018-11-28 11:25:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,217 INFO L93 Difference]: Finished difference Result 444 states and 603 transitions. [2018-11-28 11:25:26,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:26,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-11-28 11:25:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,219 INFO L225 Difference]: With dead ends: 444 [2018-11-28 11:25:26,219 INFO L226 Difference]: Without dead ends: 277 [2018-11-28 11:25:26,220 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-11-28 11:25:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-28 11:25:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-11-28 11:25:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-28 11:25:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 358 transitions. [2018-11-28 11:25:26,227 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 358 transitions. Word has length 173 [2018-11-28 11:25:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,227 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 358 transitions. [2018-11-28 11:25:26,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 358 transitions. [2018-11-28 11:25:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-28 11:25:26,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,229 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-11-28 11:25:26,229 INFO L423 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1857010675, now seen corresponding path program 1 times [2018-11-28 11:25:26,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-11-28 11:25:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,287 INFO L87 Difference]: Start difference. First operand 275 states and 358 transitions. Second operand 4 states. [2018-11-28 11:25:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,320 INFO L93 Difference]: Finished difference Result 446 states and 601 transitions. [2018-11-28 11:25:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:26,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-28 11:25:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,322 INFO L225 Difference]: With dead ends: 446 [2018-11-28 11:25:26,323 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 11:25:26,323 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-11-28 11:25:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 11:25:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-11-28 11:25:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-28 11:25:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 353 transitions. [2018-11-28 11:25:26,330 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 353 transitions. Word has length 186 [2018-11-28 11:25:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,330 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 353 transitions. [2018-11-28 11:25:26,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 353 transitions. [2018-11-28 11:25:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-28 11:25:26,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,332 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] [2018-11-28 11:25:26,332 INFO L423 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1363724559, now seen corresponding path program 1 times [2018-11-28 11:25:26,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-11-28 11:25:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,388 INFO L87 Difference]: Start difference. First operand 274 states and 353 transitions. Second operand 4 states. [2018-11-28 11:25:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,414 INFO L93 Difference]: Finished difference Result 444 states and 591 transitions. [2018-11-28 11:25:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:26,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-11-28 11:25:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,417 INFO L225 Difference]: With dead ends: 444 [2018-11-28 11:25:26,417 INFO L226 Difference]: Without dead ends: 273 [2018-11-28 11:25:26,417 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-11-28 11:25:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-28 11:25:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-11-28 11:25:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-28 11:25:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 350 transitions. [2018-11-28 11:25:26,424 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 350 transitions. Word has length 200 [2018-11-28 11:25:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,424 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 350 transitions. [2018-11-28 11:25:26,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 350 transitions. [2018-11-28 11:25:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-28 11:25:26,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,426 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] [2018-11-28 11:25:26,426 INFO L423 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash -609253146, now seen corresponding path program 1 times [2018-11-28 11:25:26,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-11-28 11:25:26,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,484 INFO L87 Difference]: Start difference. First operand 273 states and 350 transitions. Second operand 4 states. [2018-11-28 11:25:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,700 INFO L93 Difference]: Finished difference Result 762 states and 1025 transitions. [2018-11-28 11:25:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:26,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-11-28 11:25:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,703 INFO L225 Difference]: With dead ends: 762 [2018-11-28 11:25:26,703 INFO L226 Difference]: Without dead ends: 592 [2018-11-28 11:25:26,704 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-11-28 11:25:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-11-28 11:25:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 456. [2018-11-28 11:25:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-28 11:25:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 610 transitions. [2018-11-28 11:25:26,717 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 610 transitions. Word has length 200 [2018-11-28 11:25:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,717 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 610 transitions. [2018-11-28 11:25:26,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 610 transitions. [2018-11-28 11:25:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-28 11:25:26,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,720 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-11-28 11:25:26,721 INFO L423 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1427424983, now seen corresponding path program 1 times [2018-11-28 11:25:26,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-28 11:25:26,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:26,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:26,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:26,796 INFO L87 Difference]: Start difference. First operand 456 states and 610 transitions. Second operand 4 states. [2018-11-28 11:25:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:26,940 INFO L93 Difference]: Finished difference Result 1172 states and 1615 transitions. [2018-11-28 11:25:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:26,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2018-11-28 11:25:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:26,943 INFO L225 Difference]: With dead ends: 1172 [2018-11-28 11:25:26,944 INFO L226 Difference]: Without dead ends: 819 [2018-11-28 11:25:26,945 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-11-28 11:25:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-28 11:25:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 805. [2018-11-28 11:25:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2018-11-28 11:25:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1088 transitions. [2018-11-28 11:25:26,969 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1088 transitions. Word has length 237 [2018-11-28 11:25:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:26,970 INFO L480 AbstractCegarLoop]: Abstraction has 805 states and 1088 transitions. [2018-11-28 11:25:26,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1088 transitions. [2018-11-28 11:25:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-11-28 11:25:26,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:26,973 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-11-28 11:25:26,973 INFO L423 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:26,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash -115278822, now seen corresponding path program 1 times [2018-11-28 11:25:26,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:26,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-28 11:25:27,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:27,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:25:27,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:27,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:27,045 INFO L87 Difference]: Start difference. First operand 805 states and 1088 transitions. Second operand 4 states. [2018-11-28 11:25:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:27,201 INFO L93 Difference]: Finished difference Result 2147 states and 2972 transitions. [2018-11-28 11:25:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:25:27,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-11-28 11:25:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:27,206 INFO L225 Difference]: With dead ends: 2147 [2018-11-28 11:25:27,206 INFO L226 Difference]: Without dead ends: 1472 [2018-11-28 11:25:27,208 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-11-28 11:25:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2018-11-28 11:25:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1111. [2018-11-28 11:25:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-11-28 11:25:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1514 transitions. [2018-11-28 11:25:27,261 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1514 transitions. Word has length 238 [2018-11-28 11:25:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:27,261 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 1514 transitions. [2018-11-28 11:25:27,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1514 transitions. [2018-11-28 11:25:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-28 11:25:27,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:27,264 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, 1] [2018-11-28 11:25:27,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:27,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1013689329, now seen corresponding path program 1 times [2018-11-28 11:25:27,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:27,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-28 11:25:27,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:27,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:27,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:27,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-11-28 11:25:27,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:25:27,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-28 11:25:27,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:25:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:25:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:25:27,537 INFO L87 Difference]: Start difference. First operand 1111 states and 1514 transitions. Second operand 10 states. [2018-11-28 11:25:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:27,719 INFO L93 Difference]: Finished difference Result 2290 states and 3151 transitions. [2018-11-28 11:25:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:25:27,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2018-11-28 11:25:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:27,724 INFO L225 Difference]: With dead ends: 2290 [2018-11-28 11:25:27,724 INFO L226 Difference]: Without dead ends: 1138 [2018-11-28 11:25:27,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:25:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-11-28 11:25:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2018-11-28 11:25:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-11-28 11:25:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1512 transitions. [2018-11-28 11:25:27,766 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1512 transitions. Word has length 239 [2018-11-28 11:25:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:27,766 INFO L480 AbstractCegarLoop]: Abstraction has 1138 states and 1512 transitions. [2018-11-28 11:25:27,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:25:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1512 transitions. [2018-11-28 11:25:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-28 11:25:27,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:27,771 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, 1] [2018-11-28 11:25:27,771 INFO L423 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:27,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:27,771 INFO L82 PathProgramCache]: Analyzing trace with hash -671312158, now seen corresponding path program 1 times [2018-11-28 11:25:27,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:27,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:27,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:27,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2018-11-28 11:25:27,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:27,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:27,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:28,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-28 11:25:28,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:28,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 11:25:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:25:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:25:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:25:28,147 INFO L87 Difference]: Start difference. First operand 1138 states and 1512 transitions. Second operand 9 states. [2018-11-28 11:25:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:28,256 INFO L93 Difference]: Finished difference Result 2199 states and 3032 transitions. [2018-11-28 11:25:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:25:28,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 293 [2018-11-28 11:25:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:28,260 INFO L225 Difference]: With dead ends: 2199 [2018-11-28 11:25:28,260 INFO L226 Difference]: Without dead ends: 1182 [2018-11-28 11:25:28,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:25:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-11-28 11:25:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2018-11-28 11:25:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-11-28 11:25:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1545 transitions. [2018-11-28 11:25:28,299 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1545 transitions. Word has length 293 [2018-11-28 11:25:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:28,300 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1545 transitions. [2018-11-28 11:25:28,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:25:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1545 transitions. [2018-11-28 11:25:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-28 11:25:28,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:28,303 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, 1] [2018-11-28 11:25:28,304 INFO L423 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:28,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:28,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1000522157, now seen corresponding path program 1 times [2018-11-28 11:25:28,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:28,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:28,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2018-11-28 11:25:28,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:28,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:28,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:28,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-11-28 11:25:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-11-28 11:25:28,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:25:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:25:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:25:28,672 INFO L87 Difference]: Start difference. First operand 1182 states and 1545 transitions. Second operand 14 states. [2018-11-28 11:25:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:28,775 INFO L93 Difference]: Finished difference Result 1243 states and 1652 transitions. [2018-11-28 11:25:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:25:28,776 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 294 [2018-11-28 11:25:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:28,780 INFO L225 Difference]: With dead ends: 1243 [2018-11-28 11:25:28,780 INFO L226 Difference]: Without dead ends: 1241 [2018-11-28 11:25:28,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 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-11-28 11:25:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-11-28 11:25:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1206. [2018-11-28 11:25:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2018-11-28 11:25:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1572 transitions. [2018-11-28 11:25:28,818 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1572 transitions. Word has length 294 [2018-11-28 11:25:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:28,819 INFO L480 AbstractCegarLoop]: Abstraction has 1206 states and 1572 transitions. [2018-11-28 11:25:28,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:25:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1572 transitions. [2018-11-28 11:25:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-28 11:25:28,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:28,822 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, 1] [2018-11-28 11:25:28,823 INFO L423 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:28,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash 220996093, now seen corresponding path program 1 times [2018-11-28 11:25:28,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:28,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-11-28 11:25:28,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:28,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:29,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:29,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-28 11:25:29,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:25:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-11-28 11:25:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:25:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:25:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:25:29,329 INFO L87 Difference]: Start difference. First operand 1206 states and 1572 transitions. Second operand 21 states. [2018-11-28 11:25:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:32,550 INFO L93 Difference]: Finished difference Result 4389 states and 5873 transitions. [2018-11-28 11:25:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:25:32,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2018-11-28 11:25:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:32,559 INFO L225 Difference]: With dead ends: 4389 [2018-11-28 11:25:32,559 INFO L226 Difference]: Without dead ends: 3339 [2018-11-28 11:25:32,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 304 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-11-28 11:25:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2018-11-28 11:25:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2904. [2018-11-28 11:25:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2904 states. [2018-11-28 11:25:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2904 states to 2904 states and 3860 transitions. [2018-11-28 11:25:32,653 INFO L78 Accepts]: Start accepts. Automaton has 2904 states and 3860 transitions. Word has length 302 [2018-11-28 11:25:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:32,654 INFO L480 AbstractCegarLoop]: Abstraction has 2904 states and 3860 transitions. [2018-11-28 11:25:32,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:25:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2904 states and 3860 transitions. [2018-11-28 11:25:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-28 11:25:32,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:32,658 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, 1] [2018-11-28 11:25:32,658 INFO L423 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:32,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 914097790, now seen corresponding path program 1 times [2018-11-28 11:25:32,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:32,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2018-11-28 11:25:32,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:32,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:32,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:32,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-28 11:25:32,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:32,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 11:25:32,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:25:32,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:25:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:25:32,888 INFO L87 Difference]: Start difference. First operand 2904 states and 3860 transitions. Second operand 4 states. [2018-11-28 11:25:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:33,012 INFO L93 Difference]: Finished difference Result 4611 states and 6008 transitions. [2018-11-28 11:25:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:25:33,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2018-11-28 11:25:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:33,020 INFO L225 Difference]: With dead ends: 4611 [2018-11-28 11:25:33,020 INFO L226 Difference]: Without dead ends: 2391 [2018-11-28 11:25:33,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:25:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-11-28 11:25:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2018-11-28 11:25:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2018-11-28 11:25:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3029 transitions. [2018-11-28 11:25:33,135 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3029 transitions. Word has length 302 [2018-11-28 11:25:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:33,135 INFO L480 AbstractCegarLoop]: Abstraction has 2391 states and 3029 transitions. [2018-11-28 11:25:33,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:25:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3029 transitions. [2018-11-28 11:25:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-28 11:25:33,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:33,140 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] [2018-11-28 11:25:33,140 INFO L423 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:33,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1092621299, now seen corresponding path program 1 times [2018-11-28 11:25:33,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:33,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:33,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-28 11:25:33,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:33,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:25:33,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:25:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:25:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:25:33,238 INFO L87 Difference]: Start difference. First operand 2391 states and 3029 transitions. Second operand 10 states. [2018-11-28 11:25:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:33,616 INFO L93 Difference]: Finished difference Result 5136 states and 6586 transitions. [2018-11-28 11:25:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:25:33,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2018-11-28 11:25:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:33,628 INFO L225 Difference]: With dead ends: 5136 [2018-11-28 11:25:33,628 INFO L226 Difference]: Without dead ends: 3648 [2018-11-28 11:25:33,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:25:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2018-11-28 11:25:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3306. [2018-11-28 11:25:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-11-28 11:25:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4228 transitions. [2018-11-28 11:25:33,735 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4228 transitions. Word has length 317 [2018-11-28 11:25:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:33,736 INFO L480 AbstractCegarLoop]: Abstraction has 3306 states and 4228 transitions. [2018-11-28 11:25:33,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:25:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4228 transitions. [2018-11-28 11:25:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-28 11:25:33,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:33,739 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] [2018-11-28 11:25:33,739 INFO L423 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:33,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1293888207, now seen corresponding path program 1 times [2018-11-28 11:25:33,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:33,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:33,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:33,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:33,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-28 11:25:33,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:33,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:33,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:33,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2018-11-28 11:25:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-28 11:25:34,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:25:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:25:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:25:34,085 INFO L87 Difference]: Start difference. First operand 3306 states and 4228 transitions. Second operand 14 states. [2018-11-28 11:25:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:36,267 INFO L93 Difference]: Finished difference Result 5907 states and 7499 transitions. [2018-11-28 11:25:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:25:36,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 317 [2018-11-28 11:25:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:36,279 INFO L225 Difference]: With dead ends: 5907 [2018-11-28 11:25:36,279 INFO L226 Difference]: Without dead ends: 3333 [2018-11-28 11:25:36,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:25:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2018-11-28 11:25:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2667. [2018-11-28 11:25:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2018-11-28 11:25:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3290 transitions. [2018-11-28 11:25:36,412 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3290 transitions. Word has length 317 [2018-11-28 11:25:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:36,413 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 3290 transitions. [2018-11-28 11:25:36,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:25:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3290 transitions. [2018-11-28 11:25:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-28 11:25:36,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:36,416 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-11-28 11:25:36,416 INFO L423 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:36,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1399334493, now seen corresponding path program 1 times [2018-11-28 11:25:36,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:36,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-28 11:25:36,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:36,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:36,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:36,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-11-28 11:25:36,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:36,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 19 [2018-11-28 11:25:36,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 11:25:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 11:25:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:25:36,943 INFO L87 Difference]: Start difference. First operand 2667 states and 3290 transitions. Second operand 19 states. [2018-11-28 11:25:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:40,217 INFO L93 Difference]: Finished difference Result 5365 states and 6659 transitions. [2018-11-28 11:25:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-28 11:25:40,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 318 [2018-11-28 11:25:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:40,228 INFO L225 Difference]: With dead ends: 5365 [2018-11-28 11:25:40,229 INFO L226 Difference]: Without dead ends: 3232 [2018-11-28 11:25:40,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 319 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=2542, Unknown=0, NotChecked=0, Total=2862 [2018-11-28 11:25:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-11-28 11:25:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2661. [2018-11-28 11:25:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2018-11-28 11:25:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3248 transitions. [2018-11-28 11:25:40,347 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3248 transitions. Word has length 318 [2018-11-28 11:25:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:40,348 INFO L480 AbstractCegarLoop]: Abstraction has 2661 states and 3248 transitions. [2018-11-28 11:25:40,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 11:25:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3248 transitions. [2018-11-28 11:25:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-28 11:25:40,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:40,351 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] [2018-11-28 11:25:40,351 INFO L423 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:40,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1744104081, now seen corresponding path program 1 times [2018-11-28 11:25:40,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:40,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:40,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-11-28 11:25:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:25:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:25:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:25:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:25:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:25:40,470 INFO L87 Difference]: Start difference. First operand 2661 states and 3248 transitions. Second operand 6 states. [2018-11-28 11:25:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:40,701 INFO L93 Difference]: Finished difference Result 6474 states and 8562 transitions. [2018-11-28 11:25:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:25:40,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 323 [2018-11-28 11:25:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:40,723 INFO L225 Difference]: With dead ends: 6474 [2018-11-28 11:25:40,723 INFO L226 Difference]: Without dead ends: 4458 [2018-11-28 11:25:40,729 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-11-28 11:25:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2018-11-28 11:25:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 3066. [2018-11-28 11:25:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2018-11-28 11:25:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 3887 transitions. [2018-11-28 11:25:40,906 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 3887 transitions. Word has length 323 [2018-11-28 11:25:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:40,907 INFO L480 AbstractCegarLoop]: Abstraction has 3066 states and 3887 transitions. [2018-11-28 11:25:40,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:25:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 3887 transitions. [2018-11-28 11:25:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-28 11:25:40,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:40,910 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] [2018-11-28 11:25:40,911 INFO L423 AbstractCegarLoop]: === Iteration 31 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 163691499, now seen corresponding path program 1 times [2018-11-28 11:25:40,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2018-11-28 11:25:41,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:41,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:41,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:41,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2018-11-28 11:25:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2018-11-28 11:25:41,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:25:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:25:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:25:41,499 INFO L87 Difference]: Start difference. First operand 3066 states and 3887 transitions. Second operand 17 states. [2018-11-28 11:25:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:43,155 INFO L93 Difference]: Finished difference Result 8484 states and 10833 transitions. [2018-11-28 11:25:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 11:25:43,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 323 [2018-11-28 11:25:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:43,175 INFO L225 Difference]: With dead ends: 8484 [2018-11-28 11:25:43,175 INFO L226 Difference]: Without dead ends: 6081 [2018-11-28 11:25:43,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 322 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=384, Invalid=3038, Unknown=0, NotChecked=0, Total=3422 [2018-11-28 11:25:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2018-11-28 11:25:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3276. [2018-11-28 11:25:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3276 states. [2018-11-28 11:25:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4001 transitions. [2018-11-28 11:25:43,434 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4001 transitions. Word has length 323 [2018-11-28 11:25:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:43,434 INFO L480 AbstractCegarLoop]: Abstraction has 3276 states and 4001 transitions. [2018-11-28 11:25:43,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:25:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4001 transitions. [2018-11-28 11:25:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-28 11:25:43,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:43,438 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] [2018-11-28 11:25:43,438 INFO L423 AbstractCegarLoop]: === Iteration 32 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:43,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash 618758123, now seen corresponding path program 1 times [2018-11-28 11:25:43,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:43,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:43,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:43,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:43,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-28 11:25:43,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:43,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:43,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:43,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-11-28 11:25:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 26 [2018-11-28 11:25:44,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 11:25:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 11:25:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:25:44,088 INFO L87 Difference]: Start difference. First operand 3276 states and 4001 transitions. Second operand 26 states. [2018-11-28 11:25:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:47,787 INFO L93 Difference]: Finished difference Result 7866 states and 9555 transitions. [2018-11-28 11:25:47,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-28 11:25:47,787 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 323 [2018-11-28 11:25:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:47,799 INFO L225 Difference]: With dead ends: 7866 [2018-11-28 11:25:47,800 INFO L226 Difference]: Without dead ends: 5493 [2018-11-28 11:25:47,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 319 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=597, Invalid=4095, Unknown=0, NotChecked=0, Total=4692 [2018-11-28 11:25:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2018-11-28 11:25:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 3480. [2018-11-28 11:25:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3480 states. [2018-11-28 11:25:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4208 transitions. [2018-11-28 11:25:47,990 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4208 transitions. Word has length 323 [2018-11-28 11:25:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:47,990 INFO L480 AbstractCegarLoop]: Abstraction has 3480 states and 4208 transitions. [2018-11-28 11:25:47,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 11:25:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4208 transitions. [2018-11-28 11:25:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-11-28 11:25:47,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:47,993 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-11-28 11:25:47,993 INFO L423 AbstractCegarLoop]: === Iteration 33 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:47,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash -435739282, now seen corresponding path program 1 times [2018-11-28 11:25:47,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:47,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:47,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-28 11:25:48,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:48,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:48,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2018-11-28 11:25:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:25:48,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2018-11-28 11:25:48,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 11:25:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:25:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:25:48,300 INFO L87 Difference]: Start difference. First operand 3480 states and 4208 transitions. Second operand 15 states. [2018-11-28 11:25:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:25:52,143 INFO L93 Difference]: Finished difference Result 7794 states and 9510 transitions. [2018-11-28 11:25:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 11:25:52,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 325 [2018-11-28 11:25:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:25:52,153 INFO L225 Difference]: With dead ends: 7794 [2018-11-28 11:25:52,153 INFO L226 Difference]: Without dead ends: 4884 [2018-11-28 11:25:52,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 11:25:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2018-11-28 11:25:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 2937. [2018-11-28 11:25:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2018-11-28 11:25:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 3514 transitions. [2018-11-28 11:25:52,299 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 3514 transitions. Word has length 325 [2018-11-28 11:25:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:25:52,299 INFO L480 AbstractCegarLoop]: Abstraction has 2937 states and 3514 transitions. [2018-11-28 11:25:52,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 11:25:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3514 transitions. [2018-11-28 11:25:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-28 11:25:52,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:25:52,305 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:25:52,305 INFO L423 AbstractCegarLoop]: === Iteration 34 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:25:52,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:25:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1466593770, now seen corresponding path program 1 times [2018-11-28 11:25:52,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:25:52,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:25:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:25:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-11-28 11:25:52,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:25:52,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:25:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:25:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:25:52,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:25:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 228 proven. 96 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2018-11-28 11:25:52,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:25:52,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-28 11:25:52,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 11:25:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 11:25:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-11-28 11:25:52,968 INFO L87 Difference]: Start difference. First operand 2937 states and 3514 transitions. Second operand 24 states. [2018-11-28 11:26:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:00,490 INFO L93 Difference]: Finished difference Result 10851 states and 13545 transitions. [2018-11-28 11:26:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-11-28 11:26:00,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 395 [2018-11-28 11:26:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:00,505 INFO L225 Difference]: With dead ends: 10851 [2018-11-28 11:26:00,505 INFO L226 Difference]: Without dead ends: 8514 [2018-11-28 11:26:00,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 426 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6641 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2319, Invalid=17141, Unknown=0, NotChecked=0, Total=19460 [2018-11-28 11:26:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8514 states. [2018-11-28 11:26:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8514 to 7086. [2018-11-28 11:26:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7086 states. [2018-11-28 11:26:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 8532 transitions. [2018-11-28 11:26:00,943 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 8532 transitions. Word has length 395 [2018-11-28 11:26:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:00,943 INFO L480 AbstractCegarLoop]: Abstraction has 7086 states and 8532 transitions. [2018-11-28 11:26:00,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 11:26:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 8532 transitions. [2018-11-28 11:26:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-28 11:26:00,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:00,953 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:00,953 INFO L423 AbstractCegarLoop]: === Iteration 35 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:00,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:00,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1181923341, now seen corresponding path program 1 times [2018-11-28 11:26:00,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:00,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:00,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:00,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 849 trivial. 0 not checked. [2018-11-28 11:26:01,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:01,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:01,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-11-28 11:26:01,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:26:01,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-11-28 11:26:01,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:26:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:26:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:26:01,364 INFO L87 Difference]: Start difference. First operand 7086 states and 8532 transitions. Second operand 4 states. [2018-11-28 11:26:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:01,735 INFO L93 Difference]: Finished difference Result 14095 states and 16982 transitions. [2018-11-28 11:26:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:26:01,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2018-11-28 11:26:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:01,745 INFO L225 Difference]: With dead ends: 14095 [2018-11-28 11:26:01,745 INFO L226 Difference]: Without dead ends: 7022 [2018-11-28 11:26:01,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:26:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2018-11-28 11:26:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 7022. [2018-11-28 11:26:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-11-28 11:26:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 8248 transitions. [2018-11-28 11:26:02,151 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 8248 transitions. Word has length 395 [2018-11-28 11:26:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:02,151 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 8248 transitions. [2018-11-28 11:26:02,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:26:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 8248 transitions. [2018-11-28 11:26:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-28 11:26:02,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:02,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:02,158 INFO L423 AbstractCegarLoop]: === Iteration 36 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:02,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash 224766659, now seen corresponding path program 1 times [2018-11-28 11:26:02,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:02,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2018-11-28 11:26:02,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:02,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:02,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-11-28 11:26:02,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:26:02,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-28 11:26:02,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:26:02,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:26:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:26:02,560 INFO L87 Difference]: Start difference. First operand 7022 states and 8248 transitions. Second operand 4 states. [2018-11-28 11:26:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:03,209 INFO L93 Difference]: Finished difference Result 19897 states and 23431 transitions. [2018-11-28 11:26:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:26:03,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2018-11-28 11:26:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:03,233 INFO L225 Difference]: With dead ends: 19897 [2018-11-28 11:26:03,233 INFO L226 Difference]: Without dead ends: 13534 [2018-11-28 11:26:03,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:26:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13534 states. [2018-11-28 11:26:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13534 to 8582. [2018-11-28 11:26:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2018-11-28 11:26:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 10059 transitions. [2018-11-28 11:26:03,754 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 10059 transitions. Word has length 395 [2018-11-28 11:26:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:03,754 INFO L480 AbstractCegarLoop]: Abstraction has 8582 states and 10059 transitions. [2018-11-28 11:26:03,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:26:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 10059 transitions. [2018-11-28 11:26:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-28 11:26:03,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:03,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:03,761 INFO L423 AbstractCegarLoop]: === Iteration 37 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:03,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash 294414533, now seen corresponding path program 1 times [2018-11-28 11:26:03,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:03,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:03,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:03,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:03,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 878 trivial. 0 not checked. [2018-11-28 11:26:03,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:03,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:03,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 194 proven. 122 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-28 11:26:04,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:04,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 13] total 14 [2018-11-28 11:26:04,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:26:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:26:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:26:04,159 INFO L87 Difference]: Start difference. First operand 8582 states and 10059 transitions. Second operand 14 states. [2018-11-28 11:26:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:06,864 INFO L93 Difference]: Finished difference Result 15382 states and 18113 transitions. [2018-11-28 11:26:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 11:26:06,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 395 [2018-11-28 11:26:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:06,876 INFO L225 Difference]: With dead ends: 15382 [2018-11-28 11:26:06,876 INFO L226 Difference]: Without dead ends: 7406 [2018-11-28 11:26:06,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=384, Invalid=1778, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 11:26:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7406 states. [2018-11-28 11:26:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7406 to 6922. [2018-11-28 11:26:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2018-11-28 11:26:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 8103 transitions. [2018-11-28 11:26:07,272 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 8103 transitions. Word has length 395 [2018-11-28 11:26:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:07,272 INFO L480 AbstractCegarLoop]: Abstraction has 6922 states and 8103 transitions. [2018-11-28 11:26:07,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:26:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 8103 transitions. [2018-11-28 11:26:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-11-28 11:26:07,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:07,279 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:07,279 INFO L423 AbstractCegarLoop]: === Iteration 38 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:07,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash -796919207, now seen corresponding path program 1 times [2018-11-28 11:26:07,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:07,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 31 proven. 229 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2018-11-28 11:26:07,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:07,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:07,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:07,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-11-28 11:26:07,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:26:07,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2018-11-28 11:26:07,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:26:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:26:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:26:07,995 INFO L87 Difference]: Start difference. First operand 6922 states and 8103 transitions. Second operand 21 states. [2018-11-28 11:26:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:10,777 INFO L93 Difference]: Finished difference Result 14607 states and 17081 transitions. [2018-11-28 11:26:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 11:26:10,777 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 405 [2018-11-28 11:26:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:10,791 INFO L225 Difference]: With dead ends: 14607 [2018-11-28 11:26:10,791 INFO L226 Difference]: Without dead ends: 8163 [2018-11-28 11:26:10,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2018-11-28 11:26:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8163 states. [2018-11-28 11:26:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8163 to 7019. [2018-11-28 11:26:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7019 states. [2018-11-28 11:26:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7019 states to 7019 states and 8191 transitions. [2018-11-28 11:26:11,218 INFO L78 Accepts]: Start accepts. Automaton has 7019 states and 8191 transitions. Word has length 405 [2018-11-28 11:26:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:11,219 INFO L480 AbstractCegarLoop]: Abstraction has 7019 states and 8191 transitions. [2018-11-28 11:26:11,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:26:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7019 states and 8191 transitions. [2018-11-28 11:26:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-28 11:26:11,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:11,225 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:11,226 INFO L423 AbstractCegarLoop]: === Iteration 39 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:11,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1532104155, now seen corresponding path program 1 times [2018-11-28 11:26:11,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2018-11-28 11:26:11,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:11,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:11,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:11,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 485 proven. 183 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2018-11-28 11:26:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25] total 36 [2018-11-28 11:26:12,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 11:26:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 11:26:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 11:26:12,227 INFO L87 Difference]: Start difference. First operand 7019 states and 8191 transitions. Second operand 36 states. [2018-11-28 11:26:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:20,318 INFO L93 Difference]: Finished difference Result 15399 states and 18042 transitions. [2018-11-28 11:26:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-28 11:26:20,319 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 416 [2018-11-28 11:26:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:20,336 INFO L225 Difference]: With dead ends: 15399 [2018-11-28 11:26:20,337 INFO L226 Difference]: Without dead ends: 9014 [2018-11-28 11:26:20,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 419 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4890 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1467, Invalid=13785, Unknown=0, NotChecked=0, Total=15252 [2018-11-28 11:26:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9014 states. [2018-11-28 11:26:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9014 to 7025. [2018-11-28 11:26:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2018-11-28 11:26:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 8192 transitions. [2018-11-28 11:26:20,796 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 8192 transitions. Word has length 416 [2018-11-28 11:26:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:20,796 INFO L480 AbstractCegarLoop]: Abstraction has 7025 states and 8192 transitions. [2018-11-28 11:26:20,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 11:26:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 8192 transitions. [2018-11-28 11:26:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-11-28 11:26:20,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:20,803 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:20,803 INFO L423 AbstractCegarLoop]: === Iteration 40 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:20,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 480639822, now seen corresponding path program 1 times [2018-11-28 11:26:20,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:20,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:20,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2018-11-28 11:26:21,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:21,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:21,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:21,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 569 proven. 217 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-11-28 11:26:21,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24] total 35 [2018-11-28 11:26:21,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 11:26:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 11:26:21,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:26:21,764 INFO L87 Difference]: Start difference. First operand 7025 states and 8192 transitions. Second operand 35 states. [2018-11-28 11:26:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:28,232 INFO L93 Difference]: Finished difference Result 15331 states and 17948 transitions. [2018-11-28 11:26:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-28 11:26:28,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 428 [2018-11-28 11:26:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:28,243 INFO L225 Difference]: With dead ends: 15331 [2018-11-28 11:26:28,243 INFO L226 Difference]: Without dead ends: 8946 [2018-11-28 11:26:28,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 434 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1412, Invalid=13594, Unknown=0, NotChecked=0, Total=15006 [2018-11-28 11:26:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8946 states. [2018-11-28 11:26:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8946 to 6972. [2018-11-28 11:26:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6972 states. [2018-11-28 11:26:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6972 states to 6972 states and 8118 transitions. [2018-11-28 11:26:28,707 INFO L78 Accepts]: Start accepts. Automaton has 6972 states and 8118 transitions. Word has length 428 [2018-11-28 11:26:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:28,707 INFO L480 AbstractCegarLoop]: Abstraction has 6972 states and 8118 transitions. [2018-11-28 11:26:28,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 11:26:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6972 states and 8118 transitions. [2018-11-28 11:26:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-28 11:26:28,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:28,713 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:28,713 INFO L423 AbstractCegarLoop]: === Iteration 41 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:28,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2009358984, now seen corresponding path program 1 times [2018-11-28 11:26:28,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1205 trivial. 0 not checked. [2018-11-28 11:26:28,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:28,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:28,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 408 proven. 48 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2018-11-28 11:26:29,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:29,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 10] total 11 [2018-11-28 11:26:29,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:26:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:26:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:26:29,173 INFO L87 Difference]: Start difference. First operand 6972 states and 8118 transitions. Second operand 11 states. [2018-11-28 11:26:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:29,875 INFO L93 Difference]: Finished difference Result 10535 states and 12289 transitions. [2018-11-28 11:26:29,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:26:29,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2018-11-28 11:26:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:29,881 INFO L225 Difference]: With dead ends: 10535 [2018-11-28 11:26:29,881 INFO L226 Difference]: Without dead ends: 4120 [2018-11-28 11:26:29,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:26:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2018-11-28 11:26:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2018-11-28 11:26:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2018-11-28 11:26:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 4777 transitions. [2018-11-28 11:26:30,152 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 4777 transitions. Word has length 454 [2018-11-28 11:26:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:30,152 INFO L480 AbstractCegarLoop]: Abstraction has 4120 states and 4777 transitions. [2018-11-28 11:26:30,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:26:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 4777 transitions. [2018-11-28 11:26:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-11-28 11:26:30,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:30,157 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:30,157 INFO L423 AbstractCegarLoop]: === Iteration 42 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:30,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 862287459, now seen corresponding path program 1 times [2018-11-28 11:26:30,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:30,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1182 trivial. 0 not checked. [2018-11-28 11:26:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:26:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:26:30,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:26:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:26:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:26:30,394 INFO L87 Difference]: Start difference. First operand 4120 states and 4777 transitions. Second operand 10 states. [2018-11-28 11:26:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:31,289 INFO L93 Difference]: Finished difference Result 8728 states and 10327 transitions. [2018-11-28 11:26:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:26:31,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 452 [2018-11-28 11:26:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:31,298 INFO L225 Difference]: With dead ends: 8728 [2018-11-28 11:26:31,298 INFO L226 Difference]: Without dead ends: 5212 [2018-11-28 11:26:31,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:26:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2018-11-28 11:26:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4162. [2018-11-28 11:26:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2018-11-28 11:26:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 4846 transitions. [2018-11-28 11:26:31,588 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 4846 transitions. Word has length 452 [2018-11-28 11:26:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 4162 states and 4846 transitions. [2018-11-28 11:26:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:26:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 4846 transitions. [2018-11-28 11:26:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-11-28 11:26:31,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:31,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:31,593 INFO L423 AbstractCegarLoop]: === Iteration 43 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:31,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2094705451, now seen corresponding path program 1 times [2018-11-28 11:26:31,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:31,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:31,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:31,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:31,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2018-11-28 11:26:31,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:31,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:31,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 298 proven. 333 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-11-28 11:26:32,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:32,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 39 [2018-11-28 11:26:32,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:26:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:26:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:26:32,791 INFO L87 Difference]: Start difference. First operand 4162 states and 4846 transitions. Second operand 39 states. [2018-11-28 11:26:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:40,842 INFO L93 Difference]: Finished difference Result 11082 states and 13059 transitions. [2018-11-28 11:26:40,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-11-28 11:26:40,842 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 453 [2018-11-28 11:26:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:40,851 INFO L225 Difference]: With dead ends: 11082 [2018-11-28 11:26:40,851 INFO L226 Difference]: Without dead ends: 7524 [2018-11-28 11:26:40,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3764 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1542, Invalid=11340, Unknown=0, NotChecked=0, Total=12882 [2018-11-28 11:26:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2018-11-28 11:26:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 5597. [2018-11-28 11:26:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5597 states. [2018-11-28 11:26:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6547 transitions. [2018-11-28 11:26:41,236 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6547 transitions. Word has length 453 [2018-11-28 11:26:41,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:41,237 INFO L480 AbstractCegarLoop]: Abstraction has 5597 states and 6547 transitions. [2018-11-28 11:26:41,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:26:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6547 transitions. [2018-11-28 11:26:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-11-28 11:26:41,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:41,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:41,241 INFO L423 AbstractCegarLoop]: === Iteration 44 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:41,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash -241195945, now seen corresponding path program 1 times [2018-11-28 11:26:41,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:41,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:41,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2018-11-28 11:26:41,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:41,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:41,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:41,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 408 proven. 4 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-11-28 11:26:41,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:41,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-28 11:26:41,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 11:26:41,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 11:26:41,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-28 11:26:41,835 INFO L87 Difference]: Start difference. First operand 5597 states and 6547 transitions. Second operand 19 states. [2018-11-28 11:26:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:43,455 INFO L93 Difference]: Finished difference Result 10748 states and 12621 transitions. [2018-11-28 11:26:43,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:26:43,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 453 [2018-11-28 11:26:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:43,464 INFO L225 Difference]: With dead ends: 10748 [2018-11-28 11:26:43,464 INFO L226 Difference]: Without dead ends: 5633 [2018-11-28 11:26:43,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 457 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 11:26:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5633 states. [2018-11-28 11:26:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5633 to 5613. [2018-11-28 11:26:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2018-11-28 11:26:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 6559 transitions. [2018-11-28 11:26:43,929 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 6559 transitions. Word has length 453 [2018-11-28 11:26:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:43,929 INFO L480 AbstractCegarLoop]: Abstraction has 5613 states and 6559 transitions. [2018-11-28 11:26:43,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 11:26:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 6559 transitions. [2018-11-28 11:26:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-28 11:26:43,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:43,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:43,935 INFO L423 AbstractCegarLoop]: === Iteration 45 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:43,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 422770584, now seen corresponding path program 1 times [2018-11-28 11:26:43,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:43,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:43,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2018-11-28 11:26:44,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:44,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:44,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-11-28 11:26:44,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-28 11:26:44,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 11:26:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 11:26:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:26:44,599 INFO L87 Difference]: Start difference. First operand 5613 states and 6559 transitions. Second operand 26 states. [2018-11-28 11:26:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:26:48,189 INFO L93 Difference]: Finished difference Result 13531 states and 15926 transitions. [2018-11-28 11:26:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:26:48,190 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 454 [2018-11-28 11:26:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:26:48,200 INFO L225 Difference]: With dead ends: 13531 [2018-11-28 11:26:48,200 INFO L226 Difference]: Without dead ends: 8653 [2018-11-28 11:26:48,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 11:26:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8653 states. [2018-11-28 11:26:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8653 to 5613. [2018-11-28 11:26:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2018-11-28 11:26:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 6559 transitions. [2018-11-28 11:26:48,620 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 6559 transitions. Word has length 454 [2018-11-28 11:26:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:26:48,621 INFO L480 AbstractCegarLoop]: Abstraction has 5613 states and 6559 transitions. [2018-11-28 11:26:48,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 11:26:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 6559 transitions. [2018-11-28 11:26:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-28 11:26:48,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:26:48,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:26:48,626 INFO L423 AbstractCegarLoop]: === Iteration 46 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:26:48,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:26:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1467046357, now seen corresponding path program 1 times [2018-11-28 11:26:48,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:26:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:26:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:48,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:26:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2018-11-28 11:26:48,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:26:48,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:26:48,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:26:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:26:49,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:26:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 403 proven. 162 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-11-28 11:26:49,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:26:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 35 [2018-11-28 11:26:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-28 11:26:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-28 11:26:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1120, Unknown=0, NotChecked=0, Total=1190 [2018-11-28 11:26:49,378 INFO L87 Difference]: Start difference. First operand 5613 states and 6559 transitions. Second operand 35 states. [2018-11-28 11:27:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:24,022 INFO L93 Difference]: Finished difference Result 43251 states and 51765 transitions. [2018-11-28 11:27:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 558 states. [2018-11-28 11:27:24,022 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 454 [2018-11-28 11:27:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:24,075 INFO L225 Difference]: With dead ends: 43251 [2018-11-28 11:27:24,075 INFO L226 Difference]: Without dead ends: 38373 [2018-11-28 11:27:24,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 589 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152257 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17779, Invalid=330911, Unknown=0, NotChecked=0, Total=348690 [2018-11-28 11:27:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38373 states. [2018-11-28 11:27:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38373 to 13594. [2018-11-28 11:27:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13594 states. [2018-11-28 11:27:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13594 states to 13594 states and 15783 transitions. [2018-11-28 11:27:25,372 INFO L78 Accepts]: Start accepts. Automaton has 13594 states and 15783 transitions. Word has length 454 [2018-11-28 11:27:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:25,373 INFO L480 AbstractCegarLoop]: Abstraction has 13594 states and 15783 transitions. [2018-11-28 11:27:25,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-28 11:27:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13594 states and 15783 transitions. [2018-11-28 11:27:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-11-28 11:27:25,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:25,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:25,384 INFO L423 AbstractCegarLoop]: === Iteration 47 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:25,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash 330618554, now seen corresponding path program 1 times [2018-11-28 11:27:25,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:25,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1186 trivial. 0 not checked. [2018-11-28 11:27:25,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:25,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:25,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 518 proven. 36 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2018-11-28 11:27:26,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:27:26,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-28 11:27:26,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-28 11:27:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-28 11:27:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-11-28 11:27:26,062 INFO L87 Difference]: Start difference. First operand 13594 states and 15783 transitions. Second operand 26 states. [2018-11-28 11:27:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:30,560 INFO L93 Difference]: Finished difference Result 33423 states and 39008 transitions. [2018-11-28 11:27:30,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:27:30,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 455 [2018-11-28 11:27:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:30,596 INFO L225 Difference]: With dead ends: 33423 [2018-11-28 11:27:30,596 INFO L226 Difference]: Without dead ends: 20779 [2018-11-28 11:27:30,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 11:27:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20779 states. [2018-11-28 11:27:31,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20779 to 13580. [2018-11-28 11:27:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13580 states. [2018-11-28 11:27:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13580 states to 13580 states and 15769 transitions. [2018-11-28 11:27:31,826 INFO L78 Accepts]: Start accepts. Automaton has 13580 states and 15769 transitions. Word has length 455 [2018-11-28 11:27:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 13580 states and 15769 transitions. [2018-11-28 11:27:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-28 11:27:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 13580 states and 15769 transitions. [2018-11-28 11:27:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-11-28 11:27:31,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:31,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:31,838 INFO L423 AbstractCegarLoop]: === Iteration 48 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:31,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash -858174020, now seen corresponding path program 1 times [2018-11-28 11:27:31,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:31,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:31,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-28 11:27:31,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:31,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:31,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:32,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 427 proven. 52 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-28 11:27:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:27:32,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-28 11:27:32,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:27:32,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:27:32,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:27:32,313 INFO L87 Difference]: Start difference. First operand 13580 states and 15769 transitions. Second operand 13 states. [2018-11-28 11:27:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:33,852 INFO L93 Difference]: Finished difference Result 20708 states and 24080 transitions. [2018-11-28 11:27:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 11:27:33,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 455 [2018-11-28 11:27:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:33,865 INFO L225 Difference]: With dead ends: 20708 [2018-11-28 11:27:33,865 INFO L226 Difference]: Without dead ends: 7680 [2018-11-28 11:27:33,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:27:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7680 states. [2018-11-28 11:27:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7680 to 7632. [2018-11-28 11:27:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7632 states. [2018-11-28 11:27:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7632 states to 7632 states and 8835 transitions. [2018-11-28 11:27:34,573 INFO L78 Accepts]: Start accepts. Automaton has 7632 states and 8835 transitions. Word has length 455 [2018-11-28 11:27:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:34,573 INFO L480 AbstractCegarLoop]: Abstraction has 7632 states and 8835 transitions. [2018-11-28 11:27:34,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:27:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 7632 states and 8835 transitions. [2018-11-28 11:27:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-11-28 11:27:34,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:34,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:34,579 INFO L423 AbstractCegarLoop]: === Iteration 49 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:34,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -491481347, now seen corresponding path program 1 times [2018-11-28 11:27:34,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1204 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-11-28 11:27:34,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:27:34,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:27:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:27:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:27:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:27:34,722 INFO L87 Difference]: Start difference. First operand 7632 states and 8835 transitions. Second operand 11 states. [2018-11-28 11:27:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:36,570 INFO L93 Difference]: Finished difference Result 16734 states and 19801 transitions. [2018-11-28 11:27:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:27:36,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2018-11-28 11:27:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:36,583 INFO L225 Difference]: With dead ends: 16734 [2018-11-28 11:27:36,583 INFO L226 Difference]: Without dead ends: 9814 [2018-11-28 11:27:36,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:27:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9814 states. [2018-11-28 11:27:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9814 to 5725. [2018-11-28 11:27:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5725 states. [2018-11-28 11:27:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 6588 transitions. [2018-11-28 11:27:37,196 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 6588 transitions. Word has length 454 [2018-11-28 11:27:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:37,196 INFO L480 AbstractCegarLoop]: Abstraction has 5725 states and 6588 transitions. [2018-11-28 11:27:37,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:27:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 6588 transitions. [2018-11-28 11:27:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-28 11:27:37,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:37,201 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:37,201 INFO L423 AbstractCegarLoop]: === Iteration 50 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:37,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:37,202 INFO L82 PathProgramCache]: Analyzing trace with hash 995728042, now seen corresponding path program 1 times [2018-11-28 11:27:37,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:37,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:37,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:37,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2018-11-28 11:27:37,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:37,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:37,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2018-11-28 11:27:37,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:27:37,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2018-11-28 11:27:37,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:27:37,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:27:37,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:27:37,611 INFO L87 Difference]: Start difference. First operand 5725 states and 6588 transitions. Second operand 13 states. [2018-11-28 11:27:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:39,026 INFO L93 Difference]: Finished difference Result 12874 states and 14942 transitions. [2018-11-28 11:27:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 11:27:39,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 463 [2018-11-28 11:27:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:39,041 INFO L225 Difference]: With dead ends: 12874 [2018-11-28 11:27:39,041 INFO L226 Difference]: Without dead ends: 7861 [2018-11-28 11:27:39,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:27:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2018-11-28 11:27:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 5221. [2018-11-28 11:27:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5221 states. [2018-11-28 11:27:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5221 states to 5221 states and 5900 transitions. [2018-11-28 11:27:39,631 INFO L78 Accepts]: Start accepts. Automaton has 5221 states and 5900 transitions. Word has length 463 [2018-11-28 11:27:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:39,632 INFO L480 AbstractCegarLoop]: Abstraction has 5221 states and 5900 transitions. [2018-11-28 11:27:39,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:27:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5221 states and 5900 transitions. [2018-11-28 11:27:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-28 11:27:39,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:39,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:39,636 INFO L423 AbstractCegarLoop]: === Iteration 51 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:39,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1690317777, now seen corresponding path program 1 times [2018-11-28 11:27:39,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:39,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:39,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:39,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:39,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2018-11-28 11:27:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:27:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:27:39,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:27:39,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:27:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:27:39,730 INFO L87 Difference]: Start difference. First operand 5221 states and 5900 transitions. Second operand 4 states. [2018-11-28 11:27:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:40,802 INFO L93 Difference]: Finished difference Result 12273 states and 14141 transitions. [2018-11-28 11:27:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:27:40,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 465 [2018-11-28 11:27:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:40,817 INFO L225 Difference]: With dead ends: 12273 [2018-11-28 11:27:40,817 INFO L226 Difference]: Without dead ends: 7764 [2018-11-28 11:27:40,823 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-11-28 11:27:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2018-11-28 11:27:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 6616. [2018-11-28 11:27:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6616 states. [2018-11-28 11:27:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 7403 transitions. [2018-11-28 11:27:41,564 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 7403 transitions. Word has length 465 [2018-11-28 11:27:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:41,564 INFO L480 AbstractCegarLoop]: Abstraction has 6616 states and 7403 transitions. [2018-11-28 11:27:41,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:27:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 7403 transitions. [2018-11-28 11:27:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-28 11:27:41,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:41,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:41,570 INFO L423 AbstractCegarLoop]: === Iteration 52 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:41,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -832681935, now seen corresponding path program 1 times [2018-11-28 11:27:41,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2018-11-28 11:27:41,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:27:41,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:27:41,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:27:41,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:27:41,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:27:41,689 INFO L87 Difference]: Start difference. First operand 6616 states and 7403 transitions. Second operand 11 states. [2018-11-28 11:27:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:44,041 INFO L93 Difference]: Finished difference Result 17306 states and 20037 transitions. [2018-11-28 11:27:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-28 11:27:44,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 465 [2018-11-28 11:27:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:44,058 INFO L225 Difference]: With dead ends: 17306 [2018-11-28 11:27:44,058 INFO L226 Difference]: Without dead ends: 11306 [2018-11-28 11:27:44,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-11-28 11:27:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11306 states. [2018-11-28 11:27:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11306 to 6464. [2018-11-28 11:27:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6464 states. [2018-11-28 11:27:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 7211 transitions. [2018-11-28 11:27:44,839 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 7211 transitions. Word has length 465 [2018-11-28 11:27:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:44,840 INFO L480 AbstractCegarLoop]: Abstraction has 6464 states and 7211 transitions. [2018-11-28 11:27:44,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:27:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 7211 transitions. [2018-11-28 11:27:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-28 11:27:44,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:44,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:44,845 INFO L423 AbstractCegarLoop]: === Iteration 53 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:44,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2039440897, now seen corresponding path program 1 times [2018-11-28 11:27:44,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:44,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:44,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:44,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:44,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 58 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-11-28 11:27:45,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:45,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:45,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:45,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 532 proven. 98 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-28 11:27:45,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:27:45,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-28 11:27:45,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 11:27:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 11:27:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:27:45,795 INFO L87 Difference]: Start difference. First operand 6464 states and 7211 transitions. Second operand 18 states. [2018-11-28 11:27:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:48,737 INFO L93 Difference]: Finished difference Result 10498 states and 11753 transitions. [2018-11-28 11:27:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-28 11:27:48,737 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 465 [2018-11-28 11:27:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:48,745 INFO L225 Difference]: With dead ends: 10498 [2018-11-28 11:27:48,745 INFO L226 Difference]: Without dead ends: 4746 [2018-11-28 11:27:48,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 472 SyntacticMatches, 22 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=515, Invalid=3267, Unknown=0, NotChecked=0, Total=3782 [2018-11-28 11:27:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2018-11-28 11:27:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 3913. [2018-11-28 11:27:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-28 11:27:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 4332 transitions. [2018-11-28 11:27:49,267 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 4332 transitions. Word has length 465 [2018-11-28 11:27:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:49,268 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 4332 transitions. [2018-11-28 11:27:49,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 11:27:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 4332 transitions. [2018-11-28 11:27:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-11-28 11:27:49,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:49,272 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:49,272 INFO L423 AbstractCegarLoop]: === Iteration 54 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:49,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1085169216, now seen corresponding path program 1 times [2018-11-28 11:27:49,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2018-11-28 11:27:49,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:49,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:49,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:49,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 470 proven. 9 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2018-11-28 11:27:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:27:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2018-11-28 11:27:49,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 11:27:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 11:27:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-11-28 11:27:49,964 INFO L87 Difference]: Start difference. First operand 3913 states and 4332 transitions. Second operand 22 states. [2018-11-28 11:27:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:27:51,992 INFO L93 Difference]: Finished difference Result 7504 states and 8340 transitions. [2018-11-28 11:27:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 11:27:51,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 465 [2018-11-28 11:27:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:27:51,998 INFO L225 Difference]: With dead ends: 7504 [2018-11-28 11:27:51,998 INFO L226 Difference]: Without dead ends: 3988 [2018-11-28 11:27:52,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 468 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=486, Invalid=1866, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 11:27:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2018-11-28 11:27:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3943. [2018-11-28 11:27:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3943 states. [2018-11-28 11:27:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 4357 transitions. [2018-11-28 11:27:52,530 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 4357 transitions. Word has length 465 [2018-11-28 11:27:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:27:52,530 INFO L480 AbstractCegarLoop]: Abstraction has 3943 states and 4357 transitions. [2018-11-28 11:27:52,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 11:27:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 4357 transitions. [2018-11-28 11:27:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-28 11:27:52,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:27:52,535 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:27:52,535 INFO L423 AbstractCegarLoop]: === Iteration 55 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:27:52,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:27:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2092035220, now seen corresponding path program 1 times [2018-11-28 11:27:52,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:27:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:27:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:52,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:27:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2018-11-28 11:27:52,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:27:52,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:27:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:27:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:27:52,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:27:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-11-28 11:27:53,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:27:53,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-28 11:27:53,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:27:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:27:53,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:27:53,471 INFO L87 Difference]: Start difference. First operand 3943 states and 4357 transitions. Second operand 39 states. [2018-11-28 11:28:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:06,718 INFO L93 Difference]: Finished difference Result 16019 states and 18725 transitions. [2018-11-28 11:28:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-28 11:28:06,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 466 [2018-11-28 11:28:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:06,734 INFO L225 Difference]: With dead ends: 16019 [2018-11-28 11:28:06,734 INFO L226 Difference]: Without dead ends: 12794 [2018-11-28 11:28:06,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 483 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10166 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-28 11:28:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12794 states. [2018-11-28 11:28:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12794 to 5400. [2018-11-28 11:28:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5400 states. [2018-11-28 11:28:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 5993 transitions. [2018-11-28 11:28:07,511 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 5993 transitions. Word has length 466 [2018-11-28 11:28:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:07,511 INFO L480 AbstractCegarLoop]: Abstraction has 5400 states and 5993 transitions. [2018-11-28 11:28:07,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:28:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 5993 transitions. [2018-11-28 11:28:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-28 11:28:07,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:07,516 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:07,516 INFO L423 AbstractCegarLoop]: === Iteration 56 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:07,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 175024067, now seen corresponding path program 1 times [2018-11-28 11:28:07,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:07,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:07,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2018-11-28 11:28:07,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:07,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:07,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 537 proven. 89 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2018-11-28 11:28:08,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:08,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 39 [2018-11-28 11:28:08,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:28:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:28:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:28:08,341 INFO L87 Difference]: Start difference. First operand 5400 states and 5993 transitions. Second operand 39 states. [2018-11-28 11:28:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:20,906 INFO L93 Difference]: Finished difference Result 20477 states and 23981 transitions. [2018-11-28 11:28:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-11-28 11:28:20,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 467 [2018-11-28 11:28:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:20,925 INFO L225 Difference]: With dead ends: 20477 [2018-11-28 11:28:20,925 INFO L226 Difference]: Without dead ends: 15903 [2018-11-28 11:28:20,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10168 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2895, Invalid=28257, Unknown=0, NotChecked=0, Total=31152 [2018-11-28 11:28:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15903 states. [2018-11-28 11:28:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15903 to 6586. [2018-11-28 11:28:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6586 states. [2018-11-28 11:28:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 7308 transitions. [2018-11-28 11:28:21,886 INFO L78 Accepts]: Start accepts. Automaton has 6586 states and 7308 transitions. Word has length 467 [2018-11-28 11:28:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:21,886 INFO L480 AbstractCegarLoop]: Abstraction has 6586 states and 7308 transitions. [2018-11-28 11:28:21,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:28:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6586 states and 7308 transitions. [2018-11-28 11:28:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-28 11:28:21,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:21,893 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:21,894 INFO L423 AbstractCegarLoop]: === Iteration 57 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:21,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2028533573, now seen corresponding path program 1 times [2018-11-28 11:28:21,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:21,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:21,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:21,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-11-28 11:28:21,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:21,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:22,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 489 proven. 56 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2018-11-28 11:28:22,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:22,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-11-28 11:28:22,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:28:22,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:28:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:28:22,265 INFO L87 Difference]: Start difference. First operand 6586 states and 7308 transitions. Second operand 13 states. [2018-11-28 11:28:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:23,898 INFO L93 Difference]: Finished difference Result 11100 states and 12344 transitions. [2018-11-28 11:28:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 11:28:23,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 467 [2018-11-28 11:28:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:23,907 INFO L225 Difference]: With dead ends: 11100 [2018-11-28 11:28:23,907 INFO L226 Difference]: Without dead ends: 5108 [2018-11-28 11:28:23,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:28:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2018-11-28 11:28:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 2610. [2018-11-28 11:28:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2018-11-28 11:28:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 2859 transitions. [2018-11-28 11:28:24,402 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 2859 transitions. Word has length 467 [2018-11-28 11:28:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:24,402 INFO L480 AbstractCegarLoop]: Abstraction has 2610 states and 2859 transitions. [2018-11-28 11:28:24,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:28:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 2859 transitions. [2018-11-28 11:28:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-28 11:28:24,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:24,406 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, 1, 1, 1] [2018-11-28 11:28:24,406 INFO L423 AbstractCegarLoop]: === Iteration 58 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:24,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -288762118, now seen corresponding path program 1 times [2018-11-28 11:28:24,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:24,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:24,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:24,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:24,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2018-11-28 11:28:24,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:24,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:28:24,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:28:24,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:28:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:28:24,550 INFO L87 Difference]: Start difference. First operand 2610 states and 2859 transitions. Second operand 11 states. [2018-11-28 11:28:26,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:26,191 INFO L93 Difference]: Finished difference Result 6857 states and 7720 transitions. [2018-11-28 11:28:26,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 11:28:26,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 466 [2018-11-28 11:28:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:26,197 INFO L225 Difference]: With dead ends: 6857 [2018-11-28 11:28:26,197 INFO L226 Difference]: Without dead ends: 4851 [2018-11-28 11:28:26,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:28:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2018-11-28 11:28:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 2610. [2018-11-28 11:28:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2018-11-28 11:28:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 2850 transitions. [2018-11-28 11:28:26,691 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 2850 transitions. Word has length 466 [2018-11-28 11:28:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:26,691 INFO L480 AbstractCegarLoop]: Abstraction has 2610 states and 2850 transitions. [2018-11-28 11:28:26,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:28:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 2850 transitions. [2018-11-28 11:28:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-28 11:28:26,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:26,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:26,694 INFO L423 AbstractCegarLoop]: === Iteration 59 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:26,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash -30596680, now seen corresponding path program 1 times [2018-11-28 11:28:26,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:26,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-11-28 11:28:26,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:28:26,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:28:26,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:28:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:28:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:28:26,809 INFO L87 Difference]: Start difference. First operand 2610 states and 2850 transitions. Second operand 4 states. [2018-11-28 11:28:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:27,282 INFO L93 Difference]: Finished difference Result 4643 states and 5101 transitions. [2018-11-28 11:28:27,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:28:27,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2018-11-28 11:28:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:27,285 INFO L225 Difference]: With dead ends: 4643 [2018-11-28 11:28:27,286 INFO L226 Difference]: Without dead ends: 2652 [2018-11-28 11:28:27,287 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-11-28 11:28:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2018-11-28 11:28:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2610. [2018-11-28 11:28:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2018-11-28 11:28:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 2844 transitions. [2018-11-28 11:28:27,769 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 2844 transitions. Word has length 466 [2018-11-28 11:28:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:27,769 INFO L480 AbstractCegarLoop]: Abstraction has 2610 states and 2844 transitions. [2018-11-28 11:28:27,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:28:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 2844 transitions. [2018-11-28 11:28:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-11-28 11:28:27,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:27,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:27,773 INFO L423 AbstractCegarLoop]: === Iteration 60 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:27,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1103690991, now seen corresponding path program 1 times [2018-11-28 11:28:27,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:27,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:27,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 85 proven. 52 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2018-11-28 11:28:27,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:27,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:28,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1284 backedges. 544 proven. 98 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-11-28 11:28:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-11-28 11:28:28,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 11:28:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 11:28:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:28:28,302 INFO L87 Difference]: Start difference. First operand 2610 states and 2844 transitions. Second operand 18 states. [2018-11-28 11:28:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:31,676 INFO L93 Difference]: Finished difference Result 6991 states and 7684 transitions. [2018-11-28 11:28:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-28 11:28:31,676 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 466 [2018-11-28 11:28:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:31,684 INFO L225 Difference]: With dead ends: 6991 [2018-11-28 11:28:31,684 INFO L226 Difference]: Without dead ends: 4976 [2018-11-28 11:28:31,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 500 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=591, Invalid=3699, Unknown=0, NotChecked=0, Total=4290 [2018-11-28 11:28:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2018-11-28 11:28:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4264. [2018-11-28 11:28:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4264 states. [2018-11-28 11:28:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 4639 transitions. [2018-11-28 11:28:32,527 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 4639 transitions. Word has length 466 [2018-11-28 11:28:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:32,528 INFO L480 AbstractCegarLoop]: Abstraction has 4264 states and 4639 transitions. [2018-11-28 11:28:32,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 11:28:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 4639 transitions. [2018-11-28 11:28:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-11-28 11:28:32,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:32,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:32,533 INFO L423 AbstractCegarLoop]: === Iteration 61 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:32,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:32,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1902701431, now seen corresponding path program 1 times [2018-11-28 11:28:32,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:32,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:32,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:32,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2018-11-28 11:28:32,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:32,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:32,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:32,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 536 proven. 92 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2018-11-28 11:28:33,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:33,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-11-28 11:28:33,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 11:28:33,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 11:28:33,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-11-28 11:28:33,090 INFO L87 Difference]: Start difference. First operand 4264 states and 4639 transitions. Second operand 27 states. [2018-11-28 11:28:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:28:54,873 INFO L93 Difference]: Finished difference Result 29270 states and 32789 transitions. [2018-11-28 11:28:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2018-11-28 11:28:54,873 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 468 [2018-11-28 11:28:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:28:54,906 INFO L225 Difference]: With dead ends: 29270 [2018-11-28 11:28:54,906 INFO L226 Difference]: Without dead ends: 25645 [2018-11-28 11:28:54,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 558 SyntacticMatches, 1 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60456 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11148, Invalid=132114, Unknown=0, NotChecked=0, Total=143262 [2018-11-28 11:28:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25645 states. [2018-11-28 11:28:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25645 to 9058. [2018-11-28 11:28:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9058 states. [2018-11-28 11:28:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9058 states to 9058 states and 9844 transitions. [2018-11-28 11:28:57,212 INFO L78 Accepts]: Start accepts. Automaton has 9058 states and 9844 transitions. Word has length 468 [2018-11-28 11:28:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:28:57,212 INFO L480 AbstractCegarLoop]: Abstraction has 9058 states and 9844 transitions. [2018-11-28 11:28:57,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 11:28:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9058 states and 9844 transitions. [2018-11-28 11:28:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-11-28 11:28:57,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:28:57,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:28:57,268 INFO L423 AbstractCegarLoop]: === Iteration 62 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:28:57,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:28:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -801180767, now seen corresponding path program 1 times [2018-11-28 11:28:57,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:28:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:28:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:57,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:28:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2018-11-28 11:28:57,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:28:57,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:28:57,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:28:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:28:57,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:28:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 385 proven. 290 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-11-28 11:28:58,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:28:58,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26] total 39 [2018-11-28 11:28:58,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:28:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:28:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:28:58,221 INFO L87 Difference]: Start difference. First operand 9058 states and 9844 transitions. Second operand 39 states. [2018-11-28 11:29:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:29:37,739 INFO L93 Difference]: Finished difference Result 45595 states and 52087 transitions. [2018-11-28 11:29:37,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 420 states. [2018-11-28 11:29:37,739 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 470 [2018-11-28 11:29:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:29:37,789 INFO L225 Difference]: With dead ends: 45595 [2018-11-28 11:29:37,789 INFO L226 Difference]: Without dead ends: 37633 [2018-11-28 11:29:37,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 590 SyntacticMatches, 9 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84653 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12335, Invalid=187027, Unknown=0, NotChecked=0, Total=199362 [2018-11-28 11:29:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37633 states. [2018-11-28 11:29:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37633 to 16743. [2018-11-28 11:29:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16743 states. [2018-11-28 11:29:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16743 states to 16743 states and 18295 transitions. [2018-11-28 11:29:42,050 INFO L78 Accepts]: Start accepts. Automaton has 16743 states and 18295 transitions. Word has length 470 [2018-11-28 11:29:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:29:42,051 INFO L480 AbstractCegarLoop]: Abstraction has 16743 states and 18295 transitions. [2018-11-28 11:29:42,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:29:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16743 states and 18295 transitions. [2018-11-28 11:29:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-11-28 11:29:42,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:29:42,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:29:42,064 INFO L423 AbstractCegarLoop]: === Iteration 63 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:29:42,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:29:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash -801224750, now seen corresponding path program 1 times [2018-11-28 11:29:42,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:29:42,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:29:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:29:42,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:29:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:29:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:29:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:29:42,210 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:29:42,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:29:42 BoogieIcfgContainer [2018-11-28 11:29:42,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:29:42,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:29:42,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:29:42,453 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:29:42,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:23" (3/4) ... [2018-11-28 11:29:42,456 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:29:42,739 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_47e885d8-4ca7-46b4-83b3-9b911aec45f2/bin-2019/uautomizer/witness.graphml [2018-11-28 11:29:42,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:29:42,741 INFO L168 Benchmark]: Toolchain (without parser) took 259866.14 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 953.3 MB in the beginning and 965.9 MB in the end (delta: -12.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-28 11:29:42,743 INFO L168 Benchmark]: CDTParser took 0.14 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-11-28 11:29:42,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:29:42,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.60 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-11-28 11:29:42,743 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 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-11-28 11:29:42,744 INFO L168 Benchmark]: RCFGBuilder took 511.17 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:29:42,744 INFO L168 Benchmark]: TraceAbstraction took 258729.38 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-11-28 11:29:42,744 INFO L168 Benchmark]: Witness Printer took 286.48 ms. Allocated memory is still 3.4 GB. Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:29:42,746 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.14 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 283.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.60 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. * Boogie Preprocessor took 30.52 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 511.17 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258729.38 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -8.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 286.48 ms. Allocated memory is still 3.4 GB. Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 576]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 ; [L515] void (*nodes[4])(void) = { & gate1_each_pals_period, & gate2_each_pals_period, & gate3_each_pals_period, & voter}; VAL [\old(g1v)=549, \old(g1v_new)=544, \old(g1v_old)=535, \old(g2v)=523, \old(g2v_new)=516, \old(g2v_old)=543, \old(g3v)=528, \old(g3v_new)=534, \old(g3v_old)=531, \old(gate1Failed)=20, \old(gate1Failed_History_0)=30, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=3, \old(gate2Failed)=15, \old(gate2Failed_History_0)=18, \old(gate2Failed_History_1)=10, \old(gate2Failed_History_2)=36, \old(gate3Failed)=38, \old(gate3Failed_History_0)=34, \old(gate3Failed_History_1)=21, \old(gate3Failed_History_2)=13, \old(nomsg)=529, \old(VALUE1)=540, \old(VALUE2)=514, \old(VALUE3)=521, \old(votedValue_History_0)=520, \old(votedValue_History_1)=547, \old(votedValue_History_2)=526, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] gate1Failed = __VERIFIER_nondet_bool() [L524] gate2Failed = __VERIFIER_nondet_bool() [L525] gate3Failed = __VERIFIER_nondet_bool() [L526] VALUE1 = __VERIFIER_nondet_char() [L527] VALUE2 = __VERIFIER_nondet_char() [L528] VALUE3 = __VERIFIER_nondet_char() [L529] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L530] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L531] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L532] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L533] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L534] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L535] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L536] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L537] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L538] votedValue_History_0 = __VERIFIER_nondet_char() [L539] votedValue_History_1 = __VERIFIER_nondet_char() [L540] votedValue_History_2 = __VERIFIER_nondet_char() [L541] CALL, EXPR init() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] 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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, init()=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L541] i2 = init() [L543] g1v_old = nomsg [L544] g1v_new = nomsg [L545] g2v_old = nomsg [L546] g2v_new = nomsg [L547] g3v_old = nomsg [L548] g3v_new = nomsg [L549] i2 = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L550] COND TRUE 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L552] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(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=26, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L383] int8_t next_state ; [L384] msg_t tmp ; [L385] int tmp___0 ; [L388] gate1Failed = __VERIFIER_nondet_bool() [L389] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=24, gate1Failed_History_2=29, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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)=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)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(history_id)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L390] COND FALSE !(\read(gate1Failed)) [L394] tmp = __VERIFIER_nondet_char() [L395] next_state = tmp VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L396] COND FALSE !((int )next_state == 0) VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=1, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L399] COND TRUE (int )next_state == 1 [L400] tmp___0 = 1 VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] 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)=26, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=24, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=1, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=1, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L408] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L552] 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=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L553] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=27, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L414] int8_t next_state ; [L415] msg_t tmp ; [L416] int tmp___0 ; [L419] gate2Failed = __VERIFIER_nondet_bool() [L420] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=33, gate2Failed_History_2=5, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(history_id)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L421] COND FALSE !(\read(gate2Failed)) [L425] tmp = __VERIFIER_nondet_char() [L426] next_state = tmp VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] COND TRUE (int )next_state == 0 [L428] tmp___0 = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] EXPR next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=27, \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)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, next_state=0, next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L439] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new [L553] 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=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L554] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=25, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L445] int8_t next_state ; [L446] msg_t tmp ; [L447] int tmp___0 ; [L450] gate3Failed = __VERIFIER_nondet_bool() [L451] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L226] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L231] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=33, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=6, gate3Failed_History_2=12, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(history_id)=2, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=33, \old(gate3Failed)=25, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=6, \old(gate3Failed_History_2)=12, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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 [L554] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L555] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L487] COND TRUE (int )VALUE1 == (int )nomsg [L488] voted_value = VALUE3 VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L511] CALL write_history_int8(3, voted_value) VAL [\old(buf)=255, \old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L511] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=-1, \old(g2v_new)=0, \old(g2v_old)=-1, \old(g3v_new)=0, \old(g3v_old)=-1, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=-2, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L555] 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=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L562] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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 TRUE ! gate1Failed [L295] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L562] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L562] c1 = check() [L563] CALL assert(c1) VAL [\old(arg)=1, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L574] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L563] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L550] COND TRUE 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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] [L552] CALL gate1_each_pals_period() VAL [\old(g1v_new)=-1, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=24, gate2Failed=0, gate2Failed_History_0=0, 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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=24, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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 [L552] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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] [L553] CALL gate2_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=-1, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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 [L553] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=6, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L554] CALL gate3_each_pals_period() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L451] 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)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L452] COND TRUE \read(gate3Failed) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=-1, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L453] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L554] 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=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L555] CALL voter() VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L476] int8_t voted_value ; [L479] voted_value = nomsg [L480] VALUE1 = g1v_old [L481] g1v_old = nomsg [L482] VALUE2 = g2v_old [L483] g2v_old = nomsg [L484] VALUE3 = g3v_old [L485] g3v_old = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L486] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L493] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L500] COND TRUE (int )VALUE1 != (int )nomsg [L501] voted_value = VALUE1 VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] CALL write_history_int8(3, voted_value) VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L211] COND TRUE history_id == 3 [L212] votedValue_History_2 = votedValue_History_1 [L213] votedValue_History_1 = votedValue_History_0 [L214] votedValue_History_0 = buf VAL [\old(buf)=1, \old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L511] RET write_history_int8(3, voted_value) VAL [\old(g1v_new)=0, \old(g1v_old)=1, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=-1, \old(VALUE2)=-1, \old(VALUE3)=-1, \old(votedValue_History_0)=-1, \old(votedValue_History_1)=-2, \old(votedValue_History_2)=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, voted_value=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L555] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L556] g1v_old = g1v_new [L557] g1v_new = nomsg [L558] g2v_old = g2v_new [L559] g2v_new = nomsg [L560] g3v_old = g3v_new [L561] g3v_new = nomsg VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, c1=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] CALL, EXPR check() VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L275] int tmp ; [L276] int temp_count ; [L277] int8_t tmp___0 ; [L278] int8_t tmp___1 ; [L279] int8_t tmp___2 ; [L280] _Bool tmp___3 ; [L281] _Bool tmp___4 ; [L282] _Bool tmp___5 ; [L283] int8_t tmp___6 ; [L284] _Bool tmp___7 ; [L285] _Bool tmp___8 ; [L286] _Bool tmp___9 ; [L287] int8_t tmp___10 ; [L288] int8_t tmp___11 ; [L289] int8_t tmp___12 ; [L290] int8_t tmp___13 ; [L291] int8_t tmp___14 ; VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! gate1Failed [L295] tmp = 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(0, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND TRUE history_id == 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L172] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L175] COND TRUE historyIndex == 1 [L176] return (gate1Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___3 = read_history_bool(0, 1) [L307] COND TRUE ! tmp___3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(1, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND TRUE history_id == 1 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L182] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L185] COND TRUE historyIndex == 1 [L186] return (gate2Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___4 = read_history_bool(1, 1) [L309] COND TRUE ! tmp___4 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] CALL, EXPR read_history_bool(2, 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L171] COND FALSE !(history_id == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L181] COND FALSE !(history_id == 1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L191] COND TRUE history_id == 2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L192] COND FALSE !(historyIndex == 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L195] COND TRUE historyIndex == 1 [L196] return (gate3Failed_History_1); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, \old(historyIndex)=1, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L310] tmp___5 = read_history_bool(2, 1) [L311] COND TRUE ! tmp___5 [L312] temp_count = 0 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L313] tmp___0 = read_history_int8(3, 0) [L314] COND TRUE (int )VALUE1 == (int )tmp___0 [L315] temp_count ++ VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L317] tmp___1 = read_history_int8(3, 0) [L318] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] CALL, EXPR read_history_int8(3, 0) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L151] COND TRUE history_id == 3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L152] COND TRUE historyIndex == 0 [L153] return (votedValue_History_0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=3, \old(historyIndex)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L321] tmp___2 = read_history_int8(3, 0) [L322] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L325] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L326] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L327] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L339] COND TRUE ! (temp_count > 1) [L340] return (0); VAL [\old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] 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=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L562] c1 = check() [L563] CALL assert(c1) VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L574] COND TRUE ! arg VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L576] __VERIFIER_error() VAL [\old(arg)=0, \old(g1v_new)=0, \old(g1v_old)=0, \old(g2v_new)=0, \old(g2v_old)=0, \old(g3v_new)=0, \old(g3v_old)=0, \old(gate1Failed)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(VALUE1)=0, \old(VALUE2)=0, \old(VALUE3)=0, \old(votedValue_History_0)=0, \old(votedValue_History_1)=0, \old(votedValue_History_2)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=1, VALUE2=0, VALUE3=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 208 locations, 1 error locations. UNSAFE Result, 258.6s OverallTime, 63 OverallIterations, 16 TraceHistogramMax, 211.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29607 SDtfs, 54215 SDslu, 78247 SDs, 0 SdLazy, 351774 SolverSat, 26980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 99.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17277 GetRequests, 13916 SyntacticMatches, 76 SemanticMatches, 3285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347746 ImplicationChecksByTransitivity, 51.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16743occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 24.0s AutomataMinimizationTime, 62 MinimizatonAttempts, 134111 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 32681 NumberOfCodeBlocks, 32681 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 32114 ConstructedInterpolants, 0 QuantifiedInterpolants, 29972072 SizeOfPredicates, 110 NumberOfNonLiveVariables, 61855 ConjunctsInSsa, 1039 ConjunctsInUnsatCore, 96 InterpolantComputations, 40 PerfectInterpolantSequences, 75547/78334 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...