/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:58:13,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:58:13,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:58:13,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:58:13,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:58:13,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:58:13,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:58:13,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:58:13,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:58:13,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:58:13,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:58:13,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:58:13,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:58:13,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:58:13,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:58:13,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:58:13,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:58:13,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:58:13,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:58:13,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:58:13,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:58:13,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:58:13,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:58:13,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:58:13,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:58:13,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:58:13,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:58:13,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:58:13,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:58:13,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:58:13,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:58:13,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:58:13,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:58:13,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:58:13,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:58:13,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:58:13,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:58:13,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:58:13,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:58:13,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:58:13,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:58:13,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-19 21:58:13,510 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:58:13,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:58:13,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:58:13,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:58:13,517 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:58:13,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:58:13,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:58:13,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:58:13,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:58:13,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:58:13,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:58:13,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:58:13,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:58:13,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:58:13,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:58:13,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:58:13,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:58:13,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:58:13,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:58:13,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:58:13,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:58:13,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:58:13,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:58:13,523 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:58:13,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:58:13,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:58:13,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:58:13,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:58:13,853 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:58:13,856 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:58:13,857 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-19 21:58:13,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e84b75f2/71cc329f77c8400baf530bfff475a436/FLAGfc6ac3326 [2020-07-19 21:58:14,594 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:58:14,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-19 21:58:14,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e84b75f2/71cc329f77c8400baf530bfff475a436/FLAGfc6ac3326 [2020-07-19 21:58:14,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e84b75f2/71cc329f77c8400baf530bfff475a436 [2020-07-19 21:58:14,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:58:14,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:58:14,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:58:14,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:58:14,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:58:14,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:14" (1/1) ... [2020-07-19 21:58:14,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3c43d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:14, skipping insertion in model container [2020-07-19 21:58:14,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:58:14" (1/1) ... [2020-07-19 21:58:14,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:58:14,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:58:15,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:58:15,264 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:58:15,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:58:15,505 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:58:15,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15 WrapperNode [2020-07-19 21:58:15,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:58:15,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:58:15,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:58:15,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:58:15,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... [2020-07-19 21:58:15,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:58:15,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:58:15,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:58:15,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:58:15,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-19 21:58:15,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:58:15,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:58:15,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-19 21:58:15,661 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-07-19 21:58:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-07-19 21:58:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-07-19 21:58:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-19 21:58:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-07-19 21:58:15,664 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-07-19 21:58:15,664 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-07-19 21:58:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-07-19 21:58:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-07-19 21:58:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-19 21:58:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:58:15,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-07-19 21:58:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:58:15,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-19 21:58:15,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-07-19 21:58:15,668 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-07-19 21:58:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-07-19 21:58:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-07-19 21:58:15,669 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:58:15,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:58:15,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:58:16,627 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:58:16,628 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-19 21:58:16,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:58:16 BoogieIcfgContainer [2020-07-19 21:58:16,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:58:16,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:58:16,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:58:16,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:58:16,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:58:14" (1/3) ... [2020-07-19 21:58:16,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6f1a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:58:16, skipping insertion in model container [2020-07-19 21:58:16,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:58:15" (2/3) ... [2020-07-19 21:58:16,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6f1a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:58:16, skipping insertion in model container [2020-07-19 21:58:16,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:58:16" (3/3) ... [2020-07-19 21:58:16,646 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-07-19 21:58:16,658 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:58:16,665 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:58:16,680 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:58:16,711 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:58:16,711 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:58:16,712 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:58:16,712 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:58:16,712 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:58:16,712 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:58:16,712 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:58:16,712 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:58:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2020-07-19 21:58:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-19 21:58:16,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:16,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:16,752 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1549655252, now seen corresponding path program 1 times [2020-07-19 21:58:16,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:16,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859821940] [2020-07-19 21:58:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,321 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:58:17,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859821940] [2020-07-19 21:58:17,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:17,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-19 21:58:17,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627981058] [2020-07-19 21:58:17,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:58:17,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:58:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:58:17,696 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 9 states. [2020-07-19 21:58:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:19,453 INFO L93 Difference]: Finished difference Result 456 states and 705 transitions. [2020-07-19 21:58:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:58:19,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-07-19 21:58:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:19,486 INFO L225 Difference]: With dead ends: 456 [2020-07-19 21:58:19,486 INFO L226 Difference]: Without dead ends: 237 [2020-07-19 21:58:19,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:58:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-07-19 21:58:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-07-19 21:58:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-07-19 21:58:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 342 transitions. [2020-07-19 21:58:19,606 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 342 transitions. Word has length 71 [2020-07-19 21:58:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:19,606 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 342 transitions. [2020-07-19 21:58:19,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:58:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2020-07-19 21:58:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-19 21:58:19,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:19,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:19,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:58:19,622 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash 695502060, now seen corresponding path program 1 times [2020-07-19 21:58:19,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:19,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132152772] [2020-07-19 21:58:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:19,942 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:58:20,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132152772] [2020-07-19 21:58:20,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:20,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-19 21:58:20,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004593781] [2020-07-19 21:58:20,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 21:58:20,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:20,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 21:58:20,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:58:20,276 INFO L87 Difference]: Start difference. First operand 237 states and 342 transitions. Second operand 14 states. [2020-07-19 21:58:20,472 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:58:20,713 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:58:20,889 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:58:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:23,308 INFO L93 Difference]: Finished difference Result 455 states and 653 transitions. [2020-07-19 21:58:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-19 21:58:23,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-07-19 21:58:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:23,316 INFO L225 Difference]: With dead ends: 455 [2020-07-19 21:58:23,316 INFO L226 Difference]: Without dead ends: 237 [2020-07-19 21:58:23,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-07-19 21:58:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-07-19 21:58:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-07-19 21:58:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-07-19 21:58:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2020-07-19 21:58:23,368 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 71 [2020-07-19 21:58:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:23,369 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2020-07-19 21:58:23,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 21:58:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2020-07-19 21:58:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-19 21:58:23,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:23,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:23,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:58:23,372 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:23,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1333871800, now seen corresponding path program 1 times [2020-07-19 21:58:23,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:23,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953782757] [2020-07-19 21:58:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,710 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:58:23,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953782757] [2020-07-19 21:58:23,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:23,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-19 21:58:23,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202290609] [2020-07-19 21:58:23,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:58:23,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:58:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:58:23,922 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 11 states. [2020-07-19 21:58:24,833 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:58:24,971 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:58:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:26,124 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2020-07-19 21:58:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-19 21:58:26,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-07-19 21:58:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:26,129 INFO L225 Difference]: With dead ends: 454 [2020-07-19 21:58:26,129 INFO L226 Difference]: Without dead ends: 241 [2020-07-19 21:58:26,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:58:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-19 21:58:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-07-19 21:58:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-07-19 21:58:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2020-07-19 21:58:26,168 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 82 [2020-07-19 21:58:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:26,168 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2020-07-19 21:58:26,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:58:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2020-07-19 21:58:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-19 21:58:26,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:26,171 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:26,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-19 21:58:26,172 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1250466386, now seen corresponding path program 1 times [2020-07-19 21:58:26,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:26,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551349677] [2020-07-19 21:58:26,173 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,420 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:26,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551349677] [2020-07-19 21:58:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-19 21:58:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022746756] [2020-07-19 21:58:26,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 21:58:26,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:26,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 21:58:26,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-19 21:58:26,774 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand 16 states. [2020-07-19 21:58:26,933 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:58:28,261 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-07-19 21:58:28,857 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:58:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:30,682 INFO L93 Difference]: Finished difference Result 549 states and 758 transitions. [2020-07-19 21:58:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-19 21:58:30,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-07-19 21:58:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:30,689 INFO L225 Difference]: With dead ends: 549 [2020-07-19 21:58:30,690 INFO L226 Difference]: Without dead ends: 332 [2020-07-19 21:58:30,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-07-19 21:58:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-07-19 21:58:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2020-07-19 21:58:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-07-19 21:58:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-07-19 21:58:30,739 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 104 [2020-07-19 21:58:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:30,740 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-07-19 21:58:30,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 21:58:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-07-19 21:58:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-19 21:58:30,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:30,742 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:30,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-19 21:58:30,743 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:30,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1479117531, now seen corresponding path program 1 times [2020-07-19 21:58:30,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:30,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668478627] [2020-07-19 21:58:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:30,973 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:31,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668478627] [2020-07-19 21:58:31,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:31,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-19 21:58:31,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697352197] [2020-07-19 21:58:31,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 21:58:31,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:31,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 21:58:31,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-19 21:58:31,272 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 16 states. [2020-07-19 21:58:31,465 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:58:33,211 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:58:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:35,056 INFO L93 Difference]: Finished difference Result 555 states and 766 transitions. [2020-07-19 21:58:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-19 21:58:35,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-07-19 21:58:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:35,061 INFO L225 Difference]: With dead ends: 555 [2020-07-19 21:58:35,061 INFO L226 Difference]: Without dead ends: 335 [2020-07-19 21:58:35,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-07-19 21:58:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-07-19 21:58:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2020-07-19 21:58:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-07-19 21:58:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-07-19 21:58:35,112 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 105 [2020-07-19 21:58:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:35,113 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-07-19 21:58:35,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 21:58:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-07-19 21:58:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-07-19 21:58:35,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:35,116 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:35,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-19 21:58:35,116 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -717194829, now seen corresponding path program 1 times [2020-07-19 21:58:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:35,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621967378] [2020-07-19 21:58:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,364 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:35,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621967378] [2020-07-19 21:58:35,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:35,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:58:35,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000990103] [2020-07-19 21:58:35,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:58:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:58:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:58:35,648 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 12 states. [2020-07-19 21:58:36,373 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:58:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:39,190 INFO L93 Difference]: Finished difference Result 788 states and 1093 transitions. [2020-07-19 21:58:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-19 21:58:39,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-07-19 21:58:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:39,196 INFO L225 Difference]: With dead ends: 788 [2020-07-19 21:58:39,197 INFO L226 Difference]: Without dead ends: 568 [2020-07-19 21:58:39,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-19 21:58:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-07-19 21:58:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 551. [2020-07-19 21:58:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-07-19 21:58:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 759 transitions. [2020-07-19 21:58:39,307 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 759 transitions. Word has length 107 [2020-07-19 21:58:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:39,308 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 759 transitions. [2020-07-19 21:58:39,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:58:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 759 transitions. [2020-07-19 21:58:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-19 21:58:39,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:39,311 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:39,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-19 21:58:39,311 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 654438841, now seen corresponding path program 1 times [2020-07-19 21:58:39,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:39,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441817631] [2020-07-19 21:58:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,502 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:39,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441817631] [2020-07-19 21:58:39,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:39,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:58:39,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613690454] [2020-07-19 21:58:39,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:58:39,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:58:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:58:39,788 INFO L87 Difference]: Start difference. First operand 551 states and 759 transitions. Second operand 12 states. [2020-07-19 21:58:40,793 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:58:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:43,445 INFO L93 Difference]: Finished difference Result 1308 states and 1846 transitions. [2020-07-19 21:58:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-19 21:58:43,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-07-19 21:58:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:43,458 INFO L225 Difference]: With dead ends: 1308 [2020-07-19 21:58:43,458 INFO L226 Difference]: Without dead ends: 911 [2020-07-19 21:58:43,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-19 21:58:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2020-07-19 21:58:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 905. [2020-07-19 21:58:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2020-07-19 21:58:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1266 transitions. [2020-07-19 21:58:43,617 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1266 transitions. Word has length 108 [2020-07-19 21:58:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:43,618 INFO L479 AbstractCegarLoop]: Abstraction has 905 states and 1266 transitions. [2020-07-19 21:58:43,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:58:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1266 transitions. [2020-07-19 21:58:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-19 21:58:43,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:43,621 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:43,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-19 21:58:43,621 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 925446042, now seen corresponding path program 1 times [2020-07-19 21:58:43,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:43,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709211655] [2020-07-19 21:58:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,882 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:44,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709211655] [2020-07-19 21:58:44,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:44,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:58:44,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653765788] [2020-07-19 21:58:44,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:58:44,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:58:44,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:58:44,155 INFO L87 Difference]: Start difference. First operand 905 states and 1266 transitions. Second operand 12 states. [2020-07-19 21:58:44,291 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:58:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:47,660 INFO L93 Difference]: Finished difference Result 1649 states and 2335 transitions. [2020-07-19 21:58:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-19 21:58:47,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-07-19 21:58:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:47,667 INFO L225 Difference]: With dead ends: 1649 [2020-07-19 21:58:47,668 INFO L226 Difference]: Without dead ends: 916 [2020-07-19 21:58:47,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-19 21:58:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-07-19 21:58:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 910. [2020-07-19 21:58:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-07-19 21:58:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1268 transitions. [2020-07-19 21:58:47,786 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1268 transitions. Word has length 109 [2020-07-19 21:58:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:47,786 INFO L479 AbstractCegarLoop]: Abstraction has 910 states and 1268 transitions. [2020-07-19 21:58:47,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:58:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1268 transitions. [2020-07-19 21:58:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-19 21:58:47,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:47,789 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:47,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-19 21:58:47,790 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash -625424837, now seen corresponding path program 1 times [2020-07-19 21:58:47,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:47,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319732432] [2020-07-19 21:58:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,038 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:48,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319732432] [2020-07-19 21:58:48,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:48,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:58:48,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959678827] [2020-07-19 21:58:48,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:58:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:58:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:58:48,327 INFO L87 Difference]: Start difference. First operand 910 states and 1268 transitions. Second operand 13 states. [2020-07-19 21:58:49,681 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:58:49,811 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:58:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:50,773 INFO L93 Difference]: Finished difference Result 1663 states and 2354 transitions. [2020-07-19 21:58:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:58:50,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-07-19 21:58:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:50,780 INFO L225 Difference]: With dead ends: 1663 [2020-07-19 21:58:50,780 INFO L226 Difference]: Without dead ends: 930 [2020-07-19 21:58:50,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:58:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-07-19 21:58:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2020-07-19 21:58:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-07-19 21:58:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1284 transitions. [2020-07-19 21:58:50,879 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1284 transitions. Word has length 108 [2020-07-19 21:58:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:50,879 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1284 transitions. [2020-07-19 21:58:50,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:58:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1284 transitions. [2020-07-19 21:58:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-19 21:58:50,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:50,882 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:50,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-19 21:58:50,882 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 442586826, now seen corresponding path program 1 times [2020-07-19 21:58:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:50,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150635596] [2020-07-19 21:58:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,077 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:51,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150635596] [2020-07-19 21:58:51,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:51,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-19 21:58:51,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958369695] [2020-07-19 21:58:51,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-19 21:58:51,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:51,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-19 21:58:51,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-19 21:58:51,396 INFO L87 Difference]: Start difference. First operand 930 states and 1284 transitions. Second operand 12 states. [2020-07-19 21:58:51,591 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:58:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:55,177 INFO L93 Difference]: Finished difference Result 1715 states and 2391 transitions. [2020-07-19 21:58:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-19 21:58:55,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2020-07-19 21:58:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:55,184 INFO L225 Difference]: With dead ends: 1715 [2020-07-19 21:58:55,184 INFO L226 Difference]: Without dead ends: 962 [2020-07-19 21:58:55,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-07-19 21:58:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-07-19 21:58:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 930. [2020-07-19 21:58:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-07-19 21:58:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1280 transitions. [2020-07-19 21:58:55,288 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1280 transitions. Word has length 117 [2020-07-19 21:58:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:55,289 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1280 transitions. [2020-07-19 21:58:55,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-19 21:58:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1280 transitions. [2020-07-19 21:58:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-07-19 21:58:55,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:55,292 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:55,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-19 21:58:55,292 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash -208311273, now seen corresponding path program 1 times [2020-07-19 21:58:55,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:55,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659194222] [2020-07-19 21:58:55,293 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,512 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:55,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659194222] [2020-07-19 21:58:55,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:58:55,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101030004] [2020-07-19 21:58:55,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:58:55,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:55,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:58:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:58:55,781 INFO L87 Difference]: Start difference. First operand 930 states and 1280 transitions. Second operand 13 states. [2020-07-19 21:58:57,148 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:58:57,280 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:58:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:58:58,216 INFO L93 Difference]: Finished difference Result 1703 states and 2388 transitions. [2020-07-19 21:58:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:58:58,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-07-19 21:58:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:58:58,224 INFO L225 Difference]: With dead ends: 1703 [2020-07-19 21:58:58,225 INFO L226 Difference]: Without dead ends: 950 [2020-07-19 21:58:58,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:58:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-07-19 21:58:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-07-19 21:58:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-07-19 21:58:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1296 transitions. [2020-07-19 21:58:58,362 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1296 transitions. Word has length 116 [2020-07-19 21:58:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:58:58,362 INFO L479 AbstractCegarLoop]: Abstraction has 950 states and 1296 transitions. [2020-07-19 21:58:58,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:58:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1296 transitions. [2020-07-19 21:58:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-19 21:58:58,365 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:58:58,365 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:58:58,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-19 21:58:58,366 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:58:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:58:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2072056031, now seen corresponding path program 1 times [2020-07-19 21:58:58,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:58:58,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791687723] [2020-07-19 21:58:58,367 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:58:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,584 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:58:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:58:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:58:58,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791687723] [2020-07-19 21:58:58,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:58:58,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:58:58,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125119504] [2020-07-19 21:58:58,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:58:58,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:58:58,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:58:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:58:58,888 INFO L87 Difference]: Start difference. First operand 950 states and 1296 transitions. Second operand 13 states. [2020-07-19 21:59:00,320 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:59:00,452 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:59:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:01,199 INFO L93 Difference]: Finished difference Result 1739 states and 2404 transitions. [2020-07-19 21:59:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:59:01,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-19 21:59:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:01,206 INFO L225 Difference]: With dead ends: 1739 [2020-07-19 21:59:01,207 INFO L226 Difference]: Without dead ends: 966 [2020-07-19 21:59:01,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:59:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-07-19 21:59:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2020-07-19 21:59:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-07-19 21:59:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1308 transitions. [2020-07-19 21:59:01,311 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1308 transitions. Word has length 124 [2020-07-19 21:59:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:01,312 INFO L479 AbstractCegarLoop]: Abstraction has 966 states and 1308 transitions. [2020-07-19 21:59:01,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:59:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1308 transitions. [2020-07-19 21:59:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-07-19 21:59:01,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:01,315 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:01,315 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-19 21:59:01,315 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash 689076351, now seen corresponding path program 1 times [2020-07-19 21:59:01,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:01,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644065358] [2020-07-19 21:59:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,523 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-19 21:59:01,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644065358] [2020-07-19 21:59:01,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:01,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:59:01,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088292948] [2020-07-19 21:59:01,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:59:01,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:59:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:59:01,849 INFO L87 Difference]: Start difference. First operand 966 states and 1308 transitions. Second operand 13 states. [2020-07-19 21:59:03,411 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:59:03,563 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:59:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:04,386 INFO L93 Difference]: Finished difference Result 1775 states and 2444 transitions. [2020-07-19 21:59:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:59:04,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-07-19 21:59:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:04,394 INFO L225 Difference]: With dead ends: 1775 [2020-07-19 21:59:04,395 INFO L226 Difference]: Without dead ends: 986 [2020-07-19 21:59:04,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:59:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2020-07-19 21:59:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2020-07-19 21:59:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-07-19 21:59:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1324 transitions. [2020-07-19 21:59:04,498 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1324 transitions. Word has length 124 [2020-07-19 21:59:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:04,499 INFO L479 AbstractCegarLoop]: Abstraction has 986 states and 1324 transitions. [2020-07-19 21:59:04,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:59:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1324 transitions. [2020-07-19 21:59:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-07-19 21:59:04,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:04,502 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:04,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-19 21:59:04,503 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1921569727, now seen corresponding path program 1 times [2020-07-19 21:59:04,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:04,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460679943] [2020-07-19 21:59:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,697 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-19 21:59:05,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460679943] [2020-07-19 21:59:05,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:05,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:59:05,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477474446] [2020-07-19 21:59:05,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:59:05,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:59:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:59:05,040 INFO L87 Difference]: Start difference. First operand 986 states and 1324 transitions. Second operand 13 states. [2020-07-19 21:59:07,071 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:59:07,261 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:59:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:08,111 INFO L93 Difference]: Finished difference Result 1819 states and 2472 transitions. [2020-07-19 21:59:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:59:08,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2020-07-19 21:59:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:08,126 INFO L225 Difference]: With dead ends: 1819 [2020-07-19 21:59:08,127 INFO L226 Difference]: Without dead ends: 1010 [2020-07-19 21:59:08,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:59:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2020-07-19 21:59:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2020-07-19 21:59:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2020-07-19 21:59:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1344 transitions. [2020-07-19 21:59:08,301 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1344 transitions. Word has length 132 [2020-07-19 21:59:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:08,302 INFO L479 AbstractCegarLoop]: Abstraction has 1010 states and 1344 transitions. [2020-07-19 21:59:08,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:59:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1344 transitions. [2020-07-19 21:59:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-19 21:59:08,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:08,308 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:08,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-19 21:59:08,308 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:08,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -104310266, now seen corresponding path program 1 times [2020-07-19 21:59:08,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:08,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707057663] [2020-07-19 21:59:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,807 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-19 21:59:09,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707057663] [2020-07-19 21:59:09,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:09,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-19 21:59:09,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177030112] [2020-07-19 21:59:09,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 21:59:09,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 21:59:09,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:59:09,450 INFO L87 Difference]: Start difference. First operand 1010 states and 1344 transitions. Second operand 19 states. [2020-07-19 21:59:09,769 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 21:59:10,057 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:10,458 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-19 21:59:11,345 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:12,957 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:13,157 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:13,321 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:15,076 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:15,222 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:15,370 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:15,535 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 21:59:15,699 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:16,012 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 21:59:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:18,535 INFO L93 Difference]: Finished difference Result 2689 states and 3552 transitions. [2020-07-19 21:59:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-19 21:59:18,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2020-07-19 21:59:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:18,546 INFO L225 Difference]: With dead ends: 2689 [2020-07-19 21:59:18,547 INFO L226 Difference]: Without dead ends: 1844 [2020-07-19 21:59:18,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2020-07-19 21:59:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2020-07-19 21:59:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1744. [2020-07-19 21:59:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-07-19 21:59:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2274 transitions. [2020-07-19 21:59:18,758 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2274 transitions. Word has length 137 [2020-07-19 21:59:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:18,759 INFO L479 AbstractCegarLoop]: Abstraction has 1744 states and 2274 transitions. [2020-07-19 21:59:18,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 21:59:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2274 transitions. [2020-07-19 21:59:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-07-19 21:59:18,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:18,763 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:18,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-19 21:59:18,763 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash -417494266, now seen corresponding path program 1 times [2020-07-19 21:59:18,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:18,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573781542] [2020-07-19 21:59:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,003 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-19 21:59:19,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573781542] [2020-07-19 21:59:19,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:19,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-19 21:59:19,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843679194] [2020-07-19 21:59:19,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:59:19,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:19,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:59:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:59:19,274 INFO L87 Difference]: Start difference. First operand 1744 states and 2274 transitions. Second operand 13 states. [2020-07-19 21:59:21,011 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:59:21,142 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:59:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:21,953 INFO L93 Difference]: Finished difference Result 3165 states and 4154 transitions. [2020-07-19 21:59:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-19 21:59:21,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-07-19 21:59:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:21,962 INFO L225 Difference]: With dead ends: 3165 [2020-07-19 21:59:21,962 INFO L226 Difference]: Without dead ends: 1760 [2020-07-19 21:59:21,967 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:59:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2020-07-19 21:59:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1748. [2020-07-19 21:59:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2020-07-19 21:59:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2252 transitions. [2020-07-19 21:59:22,159 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2252 transitions. Word has length 139 [2020-07-19 21:59:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:22,159 INFO L479 AbstractCegarLoop]: Abstraction has 1748 states and 2252 transitions. [2020-07-19 21:59:22,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:59:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2252 transitions. [2020-07-19 21:59:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-19 21:59:22,162 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:22,162 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:22,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-19 21:59:22,163 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash -836486505, now seen corresponding path program 1 times [2020-07-19 21:59:22,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:22,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682760334] [2020-07-19 21:59:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,424 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-19 21:59:22,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682760334] [2020-07-19 21:59:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-19 21:59:22,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305377616] [2020-07-19 21:59:22,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 21:59:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 21:59:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:59:22,837 INFO L87 Difference]: Start difference. First operand 1748 states and 2252 transitions. Second operand 19 states. [2020-07-19 21:59:23,149 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:25,955 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 21:59:26,132 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:26,321 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-19 21:59:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:27,055 INFO L93 Difference]: Finished difference Result 1852 states and 2401 transitions. [2020-07-19 21:59:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 21:59:27,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2020-07-19 21:59:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:27,066 INFO L225 Difference]: With dead ends: 1852 [2020-07-19 21:59:27,067 INFO L226 Difference]: Without dead ends: 1850 [2020-07-19 21:59:27,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-07-19 21:59:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-07-19 21:59:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1776. [2020-07-19 21:59:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2020-07-19 21:59:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2284 transitions. [2020-07-19 21:59:27,323 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2284 transitions. Word has length 140 [2020-07-19 21:59:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:27,324 INFO L479 AbstractCegarLoop]: Abstraction has 1776 states and 2284 transitions. [2020-07-19 21:59:27,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 21:59:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2284 transitions. [2020-07-19 21:59:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-07-19 21:59:27,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:27,327 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:27,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-19 21:59:27,328 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1769179939, now seen corresponding path program 1 times [2020-07-19 21:59:27,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:27,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923751717] [2020-07-19 21:59:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,599 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-19 21:59:27,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923751717] [2020-07-19 21:59:27,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:27,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-19 21:59:27,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249356141] [2020-07-19 21:59:28,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 21:59:28,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:28,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 21:59:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:59:28,002 INFO L87 Difference]: Start difference. First operand 1776 states and 2284 transitions. Second operand 18 states. [2020-07-19 21:59:28,273 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:28,440 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:30,023 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:32,057 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:32,325 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 21:59:33,898 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:34,052 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 21:59:34,197 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 21:59:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:34,657 INFO L93 Difference]: Finished difference Result 3632 states and 4636 transitions. [2020-07-19 21:59:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-19 21:59:34,658 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2020-07-19 21:59:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:34,670 INFO L225 Difference]: With dead ends: 3632 [2020-07-19 21:59:34,670 INFO L226 Difference]: Without dead ends: 2263 [2020-07-19 21:59:34,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-07-19 21:59:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2020-07-19 21:59:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1936. [2020-07-19 21:59:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2020-07-19 21:59:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2456 transitions. [2020-07-19 21:59:34,884 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2456 transitions. Word has length 141 [2020-07-19 21:59:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:34,886 INFO L479 AbstractCegarLoop]: Abstraction has 1936 states and 2456 transitions. [2020-07-19 21:59:34,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 21:59:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2456 transitions. [2020-07-19 21:59:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-07-19 21:59:34,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:34,890 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:34,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-19 21:59:34,891 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1694114410, now seen corresponding path program 1 times [2020-07-19 21:59:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:34,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881370583] [2020-07-19 21:59:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,129 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-19 21:59:35,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881370583] [2020-07-19 21:59:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-19 21:59:35,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310568404] [2020-07-19 21:59:35,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 21:59:35,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 21:59:35,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-07-19 21:59:35,539 INFO L87 Difference]: Start difference. First operand 1936 states and 2456 transitions. Second operand 19 states. [2020-07-19 21:59:35,748 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 21:59:35,967 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:37,313 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 21:59:38,333 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:40,098 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:40,453 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:40,625 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 21:59:40,825 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:40,985 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 21:59:41,190 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:44,238 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 21:59:45,254 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 21:59:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:45,435 INFO L93 Difference]: Finished difference Result 5009 states and 6334 transitions. [2020-07-19 21:59:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-07-19 21:59:45,436 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2020-07-19 21:59:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:45,451 INFO L225 Difference]: With dead ends: 5009 [2020-07-19 21:59:45,451 INFO L226 Difference]: Without dead ends: 3536 [2020-07-19 21:59:45,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2020-07-19 21:59:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2020-07-19 21:59:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2396. [2020-07-19 21:59:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2020-07-19 21:59:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3033 transitions. [2020-07-19 21:59:45,687 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3033 transitions. Word has length 145 [2020-07-19 21:59:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:45,688 INFO L479 AbstractCegarLoop]: Abstraction has 2396 states and 3033 transitions. [2020-07-19 21:59:45,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 21:59:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3033 transitions. [2020-07-19 21:59:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-19 21:59:45,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:45,691 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:45,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-19 21:59:45,691 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1220919060, now seen corresponding path program 1 times [2020-07-19 21:59:45,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:45,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008670456] [2020-07-19 21:59:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,896 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-19 21:59:46,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008670456] [2020-07-19 21:59:46,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:46,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-19 21:59:46,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750458470] [2020-07-19 21:59:46,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 21:59:46,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:46,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 21:59:46,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:59:46,401 INFO L87 Difference]: Start difference. First operand 2396 states and 3033 transitions. Second operand 18 states. [2020-07-19 21:59:46,779 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-07-19 21:59:46,973 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 21:59:48,126 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-07-19 21:59:48,436 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-07-19 21:59:50,979 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 21:59:51,151 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 21:59:51,360 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 21:59:51,575 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 21:59:51,762 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 21:59:51,956 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 21:59:52,287 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-19 21:59:52,921 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-19 21:59:56,041 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 21:59:56,915 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-19 21:59:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:59:58,405 INFO L93 Difference]: Finished difference Result 6362 states and 8155 transitions. [2020-07-19 21:59:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-19 21:59:58,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 146 [2020-07-19 21:59:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:59:58,430 INFO L225 Difference]: With dead ends: 6362 [2020-07-19 21:59:58,430 INFO L226 Difference]: Without dead ends: 4305 [2020-07-19 21:59:58,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-07-19 21:59:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4305 states. [2020-07-19 21:59:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4305 to 2352. [2020-07-19 21:59:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2020-07-19 21:59:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 2954 transitions. [2020-07-19 21:59:58,723 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 2954 transitions. Word has length 146 [2020-07-19 21:59:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:59:58,724 INFO L479 AbstractCegarLoop]: Abstraction has 2352 states and 2954 transitions. [2020-07-19 21:59:58,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 21:59:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2954 transitions. [2020-07-19 21:59:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-07-19 21:59:58,726 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:59:58,726 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:59:58,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-19 21:59:58,727 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:59:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:59:58,727 INFO L82 PathProgramCache]: Analyzing trace with hash 169045689, now seen corresponding path program 1 times [2020-07-19 21:59:58,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:59:58,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366053548] [2020-07-19 21:59:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 21:59:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:58,973 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 21:59:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:59:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-19 21:59:59,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366053548] [2020-07-19 21:59:59,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:59:59,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-19 21:59:59,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959433004] [2020-07-19 21:59:59,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 21:59:59,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:59:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 21:59:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:59:59,293 INFO L87 Difference]: Start difference. First operand 2352 states and 2954 transitions. Second operand 14 states. [2020-07-19 21:59:59,458 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-07-19 22:00:00,576 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-07-19 22:00:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 22:00:06,248 INFO L93 Difference]: Finished difference Result 6614 states and 8421 transitions. [2020-07-19 22:00:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-19 22:00:06,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 146 [2020-07-19 22:00:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 22:00:06,271 INFO L225 Difference]: With dead ends: 6614 [2020-07-19 22:00:06,271 INFO L226 Difference]: Without dead ends: 4651 [2020-07-19 22:00:06,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-07-19 22:00:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-07-19 22:00:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4110. [2020-07-19 22:00:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2020-07-19 22:00:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 5198 transitions. [2020-07-19 22:00:06,791 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 5198 transitions. Word has length 146 [2020-07-19 22:00:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 22:00:06,791 INFO L479 AbstractCegarLoop]: Abstraction has 4110 states and 5198 transitions. [2020-07-19 22:00:06,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 22:00:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 5198 transitions. [2020-07-19 22:00:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-19 22:00:06,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 22:00:06,794 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 22:00:06,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-19 22:00:06,795 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 22:00:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 22:00:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 598250863, now seen corresponding path program 1 times [2020-07-19 22:00:06,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 22:00:06,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735671236] [2020-07-19 22:00:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 22:00:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,040 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 22:00:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-19 22:00:07,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735671236] [2020-07-19 22:00:07,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 22:00:07,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-19 22:00:07,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146779494] [2020-07-19 22:00:07,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 22:00:07,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 22:00:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 22:00:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-07-19 22:00:07,593 INFO L87 Difference]: Start difference. First operand 4110 states and 5198 transitions. Second operand 18 states. [2020-07-19 22:00:08,027 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-07-19 22:00:08,190 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-07-19 22:00:10,022 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-07-19 22:00:10,366 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-07-19 22:00:10,630 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-07-19 22:00:10,787 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-19 22:00:12,222 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 22:00:12,429 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 22:00:12,640 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 22:00:12,852 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-07-19 22:00:13,060 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 22:00:13,256 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-07-19 22:00:13,599 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-19 22:00:14,053 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-07-19 22:00:14,338 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2020-07-19 22:00:14,540 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-07-19 22:00:19,120 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-07-19 22:00:19,327 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-07-19 22:00:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 22:00:21,165 INFO L93 Difference]: Finished difference Result 9621 states and 12271 transitions. [2020-07-19 22:00:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-07-19 22:00:21,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-07-19 22:00:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 22:00:21,190 INFO L225 Difference]: With dead ends: 9621 [2020-07-19 22:00:21,190 INFO L226 Difference]: Without dead ends: 6024 [2020-07-19 22:00:21,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=640, Invalid=2330, Unknown=0, NotChecked=0, Total=2970 [2020-07-19 22:00:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-07-19 22:00:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4715. [2020-07-19 22:00:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2020-07-19 22:00:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 5931 transitions. [2020-07-19 22:00:21,823 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 5931 transitions. Word has length 148 [2020-07-19 22:00:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 22:00:21,824 INFO L479 AbstractCegarLoop]: Abstraction has 4715 states and 5931 transitions. [2020-07-19 22:00:21,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 22:00:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 5931 transitions. [2020-07-19 22:00:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-19 22:00:21,827 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 22:00:21,827 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 22:00:21,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-19 22:00:21,827 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 22:00:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 22:00:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1683403018, now seen corresponding path program 1 times [2020-07-19 22:00:21,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 22:00:21,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416548153] [2020-07-19 22:00:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 22:00:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,097 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 22:00:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-19 22:00:22,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416548153] [2020-07-19 22:00:22,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 22:00:22,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-19 22:00:22,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492818779] [2020-07-19 22:00:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-19 22:00:22,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 22:00:22,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-19 22:00:22,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-07-19 22:00:22,537 INFO L87 Difference]: Start difference. First operand 4715 states and 5931 transitions. Second operand 17 states. [2020-07-19 22:00:22,692 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 22:00:23,084 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-07-19 22:00:23,456 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2020-07-19 22:00:23,917 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 108 [2020-07-19 22:00:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 22:00:27,368 INFO L93 Difference]: Finished difference Result 9413 states and 11847 transitions. [2020-07-19 22:00:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-19 22:00:27,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 149 [2020-07-19 22:00:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 22:00:27,385 INFO L225 Difference]: With dead ends: 9413 [2020-07-19 22:00:27,385 INFO L226 Difference]: Without dead ends: 4727 [2020-07-19 22:00:27,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2020-07-19 22:00:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4727 states. [2020-07-19 22:00:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4727 to 4723. [2020-07-19 22:00:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-19 22:00:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5939 transitions. [2020-07-19 22:00:28,092 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5939 transitions. Word has length 149 [2020-07-19 22:00:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 22:00:28,093 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5939 transitions. [2020-07-19 22:00:28,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-19 22:00:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5939 transitions. [2020-07-19 22:00:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-07-19 22:00:28,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 22:00:28,096 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 22:00:28,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-19 22:00:28,096 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 22:00:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 22:00:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2140207928, now seen corresponding path program 1 times [2020-07-19 22:00:28,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 22:00:28,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982627809] [2020-07-19 22:00:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 22:00:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,382 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 22:00:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-19 22:00:28,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982627809] [2020-07-19 22:00:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 22:00:28,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-19 22:00:28,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570770290] [2020-07-19 22:00:28,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 22:00:28,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 22:00:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 22:00:28,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-19 22:00:28,787 INFO L87 Difference]: Start difference. First operand 4723 states and 5939 transitions. Second operand 19 states. [2020-07-19 22:00:28,966 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-07-19 22:00:29,495 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 137 [2020-07-19 22:00:29,703 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-07-19 22:00:30,044 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 22:00:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 22:00:35,335 INFO L93 Difference]: Finished difference Result 9230 states and 11625 transitions. [2020-07-19 22:00:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-19 22:00:35,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 149 [2020-07-19 22:00:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 22:00:35,352 INFO L225 Difference]: With dead ends: 9230 [2020-07-19 22:00:35,353 INFO L226 Difference]: Without dead ends: 4768 [2020-07-19 22:00:35,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2020-07-19 22:00:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2020-07-19 22:00:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4723. [2020-07-19 22:00:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-19 22:00:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5921 transitions. [2020-07-19 22:00:36,044 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5921 transitions. Word has length 149 [2020-07-19 22:00:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 22:00:36,044 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5921 transitions. [2020-07-19 22:00:36,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 22:00:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5921 transitions. [2020-07-19 22:00:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-19 22:00:36,046 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 22:00:36,046 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 22:00:36,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-19 22:00:36,046 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 22:00:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 22:00:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1896255881, now seen corresponding path program 1 times [2020-07-19 22:00:36,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 22:00:36,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703511654] [2020-07-19 22:00:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 22:00:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,233 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-07-19 22:00:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 22:00:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-19 22:00:36,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703511654] [2020-07-19 22:00:36,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 22:00:36,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-19 22:00:36,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417235841] [2020-07-19 22:00:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 22:00:36,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 22:00:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 22:00:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-19 22:00:36,555 INFO L87 Difference]: Start difference. First operand 4723 states and 5921 transitions. Second operand 16 states. [2020-07-19 22:00:36,696 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-07-19 22:00:37,005 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-07-19 22:00:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 22:00:41,149 INFO L93 Difference]: Finished difference Result 9173 states and 11526 transitions. [2020-07-19 22:00:41,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-19 22:00:41,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 150 [2020-07-19 22:00:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 22:00:41,164 INFO L225 Difference]: With dead ends: 9173 [2020-07-19 22:00:41,165 INFO L226 Difference]: Without dead ends: 4741 [2020-07-19 22:00:41,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-07-19 22:00:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2020-07-19 22:00:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4723. [2020-07-19 22:00:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2020-07-19 22:00:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5915 transitions. [2020-07-19 22:00:41,885 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5915 transitions. Word has length 150 [2020-07-19 22:00:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 22:00:41,885 INFO L479 AbstractCegarLoop]: Abstraction has 4723 states and 5915 transitions. [2020-07-19 22:00:41,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 22:00:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5915 transitions. [2020-07-19 22:00:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-19 22:00:41,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 22:00:41,888 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 22:00:41,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-07-19 22:00:41,888 INFO L427 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 22:00:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 22:00:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 712531577, now seen corresponding path program 1 times [2020-07-19 22:00:41,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 22:00:41,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431224254] [2020-07-19 22:00:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f8775ed [2020-07-19 22:00:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 22:00:41,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 22:00:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 22:00:41,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 22:00:42,142 INFO L174 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2020-07-19 22:00:42,142 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 22:00:42,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-07-19 22:00:42,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:00:42 BoogieIcfgContainer [2020-07-19 22:00:42,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 22:00:42,333 INFO L168 Benchmark]: Toolchain (without parser) took 147476.45 ms. Allocated memory was 138.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 102.1 MB in the beginning and 952.9 MB in the end (delta: -850.8 MB). Peak memory consumption was 286.9 MB. Max. memory is 7.1 GB. [2020-07-19 22:00:42,333 INFO L168 Benchmark]: CDTParser took 1.62 ms. Allocated memory is still 138.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-19 22:00:42,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.80 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.6 MB in the beginning and 177.7 MB in the end (delta: -76.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2020-07-19 22:00:42,334 INFO L168 Benchmark]: Boogie Preprocessor took 76.56 ms. Allocated memory is still 204.5 MB. Free memory was 177.7 MB in the beginning and 174.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-19 22:00:42,335 INFO L168 Benchmark]: RCFGBuilder took 1052.40 ms. Allocated memory is still 204.5 MB. Free memory was 174.4 MB in the beginning and 111.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2020-07-19 22:00:42,335 INFO L168 Benchmark]: TraceAbstraction took 145694.35 ms. Allocated memory was 204.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 111.2 MB in the beginning and 952.9 MB in the end (delta: -841.7 MB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. [2020-07-19 22:00:42,337 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62 ms. Allocated memory is still 138.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 646.80 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.6 MB in the beginning and 177.7 MB in the end (delta: -76.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.56 ms. Allocated memory is still 204.5 MB. Free memory was 177.7 MB in the beginning and 174.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1052.40 ms. Allocated memory is still 204.5 MB. Free memory was 174.4 MB in the beginning and 111.2 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145694.35 ms. Allocated memory was 204.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 111.2 MB in the beginning and 952.9 MB in the end (delta: -841.7 MB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 664]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=43, \old(active_side_History_1)=31, \old(active_side_History_2)=18, \old(cs1)=24, \old(cs1_new)=16, \old(cs1_old)=37, \old(cs2)=40, \old(cs2_new)=14, \old(cs2_old)=33, \old(manual_selection_History_0)=39, \old(manual_selection_History_1)=28, \old(manual_selection_History_2)=22, \old(nomsg)=23, \old(s1p)=41, \old(s1p_new)=12, \old(s1p_old)=7, \old(s1s1)=8, \old(s1s1_new)=44, \old(s1s1_old)=19, \old(s1s2)=4, \old(s1s2_new)=42, \old(s1s2_old)=13, \old(s2p)=27, \old(s2p_new)=29, \old(s2p_old)=25, \old(s2s1)=32, \old(s2s1_new)=20, \old(s2s1_old)=38, \old(s2s2)=21, \old(s2s2_new)=36, \old(s2s2_old)=45, \old(side1_written)=11, \old(side1Failed)=9, \old(side1Failed_History_0)=35, \old(side1Failed_History_1)=46, \old(side1Failed_History_2)=10, \old(side2_written)=5, \old(side2Failed)=34, \old(side2Failed_History_0)=6, \old(side2Failed_History_1)=15, \old(side2Failed_History_2)=30, active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] int c1 ; [L589] int i2 ; [L592] c1 = 0 [L593] side1Failed = __VERIFIER_nondet_bool() [L594] side2Failed = __VERIFIER_nondet_bool() [L595] side1_written = __VERIFIER_nondet_char() [L596] side2_written = __VERIFIER_nondet_char() [L597] side1Failed_History_0 = __VERIFIER_nondet_bool() [L598] side1Failed_History_1 = __VERIFIER_nondet_bool() [L599] side1Failed_History_2 = __VERIFIER_nondet_bool() [L600] side2Failed_History_0 = __VERIFIER_nondet_bool() [L601] side2Failed_History_1 = __VERIFIER_nondet_bool() [L602] side2Failed_History_2 = __VERIFIER_nondet_bool() [L603] active_side_History_0 = __VERIFIER_nondet_char() [L604] active_side_History_1 = __VERIFIER_nondet_char() [L605] active_side_History_2 = __VERIFIER_nondet_char() [L606] manual_selection_History_0 = __VERIFIER_nondet_char() [L607] manual_selection_History_1 = __VERIFIER_nondet_char() [L608] manual_selection_History_2 = __VERIFIER_nondet_char() [L609] CALL, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side1Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )side2Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )active_side_History_0 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )manual_selection_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side1Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )side2Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )active_side_History_1 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )manual_selection_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side1Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )side2Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )active_side_History_2 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L275] COND FALSE !((int )manual_selection_History_2 != 0) [L278] return (1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] RET, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, init()=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] i2 = init() [L610] CALL assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L610] RET assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] cs1_old = nomsg [L612] cs1_new = nomsg [L613] cs2_old = nomsg [L614] cs2_new = nomsg [L615] s1s2_old = nomsg [L616] s1s2_new = nomsg [L617] s1s1_old = nomsg [L618] s1s1_new = nomsg [L619] s2s1_old = nomsg [L620] s2s1_new = nomsg [L621] s2s2_old = nomsg [L622] s2s2_new = nomsg [L623] s1p_old = nomsg [L624] s1p_new = nomsg [L625] s2p_old = nomsg [L626] s2p_new = nomsg [L627] i2 = 0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L628] COND TRUE 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] CALL Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L296] msg_t manual_selection ; [L297] char tmp ; [L300] tmp = __VERIFIER_nondet_char() [L301] manual_selection = tmp VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-2, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L302] CALL write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] manual_selection_History_2 = manual_selection_History_1 [L213] manual_selection_History_1 = manual_selection_History_0 [L214] manual_selection_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-2] [L302] RET write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L303] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-2, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L303] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L304] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-2, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L304] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L305] manual_selection = (msg_t )0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L630] RET Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] CALL Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L311] int8_t side1 ; [L312] int8_t side2 ; [L313] msg_t manual_selection ; [L314] int8_t next_state ; [L317] side1 = nomsg [L318] side2 = nomsg [L319] manual_selection = (msg_t )0 [L320] side1Failed = __VERIFIER_nondet_bool() [L321] CALL write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L122] side1Failed_History_2 = side1Failed_History_1 [L123] side1Failed_History_1 = side1Failed_History_0 [L124] side1Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L321] RET write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] COND FALSE !(\read(side1Failed)) [L329] side1 = s1s1_old [L330] s1s1_old = nomsg [L331] side2 = s2s1_old [L332] s2s1_old = nomsg [L333] manual_selection = cs1_old [L334] cs1_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )side2 [L336] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L360] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L360] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L361] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L362] side1_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] RET Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] CALL Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L368] int8_t side1 ; [L369] int8_t side2 ; [L370] msg_t manual_selection ; [L371] int8_t next_state ; [L374] side1 = nomsg [L375] side2 = nomsg [L376] manual_selection = (msg_t )0 [L377] side2Failed = __VERIFIER_nondet_bool() [L378] CALL write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L152] side2Failed_History_2 = side2Failed_History_1 [L153] side2Failed_History_1 = side2Failed_History_0 [L154] side2Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L378] RET write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L379] COND FALSE !(\read(side2Failed)) [L386] side1 = s1s2_old [L387] s1s2_old = nomsg [L388] side2 = s2s2_old [L389] s2s2_old = nomsg [L390] manual_selection = cs2_old [L391] cs2_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L392] COND TRUE (int )side1 == (int )side2 [L393] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L417] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L417] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L418] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L419] side2_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] RET Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] CALL Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L425] int8_t active_side ; [L426] int8_t tmp ; [L427] int8_t side1 ; [L428] int8_t side2 ; VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L193] COND TRUE (int )index == 0 [L194] return (active_side_History_0); VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] RET, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] tmp = read_active_side_history((unsigned char)0) [L432] active_side = tmp [L433] side1 = nomsg [L434] side2 = nomsg [L435] side1 = s1p_old [L436] s1p_old = nomsg [L437] side2 = s2p_old [L438] s2p_old = nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L439] COND FALSE !((int )side1 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L442] COND FALSE !((int )side2 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L445] COND FALSE !((int )side1 == 0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L453] COND TRUE (int )side1 == (int )nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L454] COND FALSE !((int )side2 == 0) [L457] active_side = (int8_t )0 VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L462] CALL write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L182] active_side_History_2 = active_side_History_1 [L183] active_side_History_1 = active_side_History_0 [L184] active_side_History_0 = val VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L462] RET write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L633] RET Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L634] cs1_old = cs1_new [L635] cs1_new = nomsg [L636] cs2_old = cs2_new [L637] cs2_new = nomsg [L638] s1s2_old = s1s2_new [L639] s1s2_new = nomsg [L640] s1s1_old = s1s1_new [L641] s1s1_new = nomsg [L642] s2s1_old = s2s1_new [L643] s2s1_new = nomsg [L644] s2s2_old = s2s2_new [L645] s2s2_new = nomsg [L646] s1p_old = s1p_new [L647] s1p_new = nomsg [L648] s2p_old = s2p_new [L649] s2p_new = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] CALL, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L469] int tmp ; [L470] msg_t tmp___0 ; [L471] _Bool tmp___1 ; [L472] _Bool tmp___2 ; [L473] _Bool tmp___3 ; [L474] _Bool tmp___4 ; [L475] int8_t tmp___5 ; [L476] _Bool tmp___6 ; [L477] _Bool tmp___7 ; [L478] _Bool tmp___8 ; [L479] int8_t tmp___9 ; [L480] _Bool tmp___10 ; [L481] _Bool tmp___11 ; [L482] _Bool tmp___12 ; [L483] msg_t tmp___13 ; [L484] _Bool tmp___14 ; [L485] _Bool tmp___15 ; [L486] _Bool tmp___16 ; [L487] _Bool tmp___17 ; [L488] int8_t tmp___18 ; [L489] int8_t tmp___19 ; [L490] int8_t tmp___20 ; VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] COND TRUE ! side1Failed [L494] tmp = 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L501] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L501] RET assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L226] COND TRUE (int )index == 1 [L227] return (manual_selection_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] tmp___0 = read_manual_selection_history((unsigned char)1) [L503] COND TRUE ! tmp___0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L136] COND TRUE (int )index == 1 [L137] return (side1Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] tmp___1 = read_side1_failed_history((unsigned char)1) [L505] COND TRUE ! tmp___1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 0 [L134] return (side1Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L506] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] tmp___2 = read_side1_failed_history((unsigned char)0) [L507] COND TRUE ! tmp___2 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L166] COND TRUE (int )index == 1 [L167] return (side2Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L508] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] tmp___3 = read_side2_failed_history((unsigned char)1) [L509] COND TRUE ! tmp___3 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 0 [L164] return (side2Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] tmp___4 = read_side2_failed_history((unsigned char)0) [L511] COND TRUE ! tmp___4 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L512] COND FALSE !(! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L517] COND FALSE !(! (! ((int )side1_written == 0))) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L522] COND TRUE ! (! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L523] COND TRUE ! ((int )side2_written == 0) [L524] return (0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L650] RET, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, check()=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, i2=0, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] c1 = check() [L651] CALL assert(c1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L662] COND TRUE ! arg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L664] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 145.4s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 123.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7416 SDtfs, 34886 SDslu, 3783 SDs, 0 SdLazy, 43513 SolverSat, 12909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1543 GetRequests, 778 SyntacticMatches, 15 SemanticMatches, 750 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5065 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4723occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 5589 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 3218 NumberOfCodeBlocks, 3218 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3043 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 187/187 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...