/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:55:37,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:55:37,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:55:37,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:55:37,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:55:37,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:55:37,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:55:37,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:55:37,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:55:37,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:55:37,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:55:37,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:55:37,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:55:37,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:55:37,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:55:37,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:55:37,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:55:37,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:55:37,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:55:37,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:55:37,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:55:37,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:55:37,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:55:37,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:55:37,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:55:37,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:55:37,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:55:37,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:55:37,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:55:37,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:55:37,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:55:37,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:55:37,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:55:37,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:55:37,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:55:37,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:55:37,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:55:37,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:55:37,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:55:37,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:55:37,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:55:37,481 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-11-06 22:55:37,543 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:55:37,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:55:37,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:55:37,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:55:37,548 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:55:37,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:55:37,549 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:55:37,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:55:37,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:55:37,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:55:37,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:55:37,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:55:37,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:55:37,551 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:55:37,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:55:37,551 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:55:37,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:55:37,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:55:37,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:55:37,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:55:37,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:55:37,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:55:37,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:55:37,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:55:37,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:55:37,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:55:37,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:55:37,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:55:37,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:55:37,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:55:37,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:55:38,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:55:38,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:55:38,031 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:55:38,032 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:55:38,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-06 22:55:38,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a47cee45/81b36b60d2c54d51b1c7fe3470993408/FLAG775a80c10 [2020-11-06 22:55:38,830 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:55:38,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-06 22:55:38,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a47cee45/81b36b60d2c54d51b1c7fe3470993408/FLAG775a80c10 [2020-11-06 22:55:39,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a47cee45/81b36b60d2c54d51b1c7fe3470993408 [2020-11-06 22:55:39,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:55:39,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:55:39,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:55:39,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:55:39,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:55:39,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9f2fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39, skipping insertion in model container [2020-11-06 22:55:39,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:55:39,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:55:39,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:55:39,580 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:55:39,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:55:39,755 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:55:39,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39 WrapperNode [2020-11-06 22:55:39,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:55:39,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:55:39,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:55:39,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:55:39,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (1/1) ... [2020-11-06 22:55:39,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:55:39,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:55:39,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:55:39,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:55:39,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (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-11-06 22:55:40,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:55:40,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:55:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:55:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:55:40,014 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-11-06 22:55:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-11-06 22:55:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-11-06 22:55:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-11-06 22:55:40,016 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-11-06 22:55:40,016 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-11-06 22:55:40,016 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-11-06 22:55:40,017 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-11-06 22:55:40,017 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-11-06 22:55:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-11-06 22:55:40,018 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-11-06 22:55:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-11-06 22:55:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-11-06 22:55:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-11-06 22:55:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-11-06 22:55:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:55:40,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-11-06 22:55:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:55:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:55:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:55:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:55:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-06 22:55:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-06 22:55:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-11-06 22:55:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-11-06 22:55:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-11-06 22:55:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:55:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-11-06 22:55:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-11-06 22:55:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-11-06 22:55:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-11-06 22:55:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-11-06 22:55:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-11-06 22:55:40,024 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:55:40,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:55:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:55:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:55:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:55:40,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:55:41,097 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:55:41,097 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:55:41,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:41 BoogieIcfgContainer [2020-11-06 22:55:41,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:55:41,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:55:41,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:55:41,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:55:41,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:55:39" (1/3) ... [2020-11-06 22:55:41,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96947e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:41, skipping insertion in model container [2020-11-06 22:55:41,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:39" (2/3) ... [2020-11-06 22:55:41,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96947e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:41, skipping insertion in model container [2020-11-06 22:55:41,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:41" (3/3) ... [2020-11-06 22:55:41,113 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-11-06 22:55:41,138 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:55:41,144 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:55:41,160 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:55:41,192 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:55:41,193 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:55:41,193 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:55:41,193 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:55:41,193 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:55:41,194 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:55:41,194 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:55:41,194 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:55:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states. [2020-11-06 22:55:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-06 22:55:41,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:41,236 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] [2020-11-06 22:55:41,237 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1795990944, now seen corresponding path program 1 times [2020-11-06 22:55:41,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:41,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956730646] [2020-11-06 22:55:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,088 WARN L194 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:55:42,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:55:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:55:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:55:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:55:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-06 22:55:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:55:42,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956730646] [2020-11-06 22:55:42,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:55:42,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-06 22:55:42,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460372923] [2020-11-06 22:55:42,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:55:42,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:55:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:55:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:55:42,573 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 14 states. [2020-11-06 22:55:42,930 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:55:43,321 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:55:43,614 WARN L194 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:55:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:55:47,307 INFO L93 Difference]: Finished difference Result 482 states and 746 transitions. [2020-11-06 22:55:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:55:47,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2020-11-06 22:55:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:55:47,340 INFO L225 Difference]: With dead ends: 482 [2020-11-06 22:55:47,340 INFO L226 Difference]: Without dead ends: 249 [2020-11-06 22:55:47,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-11-06 22:55:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-06 22:55:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 239. [2020-11-06 22:55:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-11-06 22:55:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 332 transitions. [2020-11-06 22:55:47,499 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 332 transitions. Word has length 72 [2020-11-06 22:55:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:55:47,499 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 332 transitions. [2020-11-06 22:55:47,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:55:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 332 transitions. [2020-11-06 22:55:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-06 22:55:47,504 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:47,505 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, 1] [2020-11-06 22:55:47,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:55:47,505 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:47,506 INFO L82 PathProgramCache]: Analyzing trace with hash 75835902, now seen corresponding path program 1 times [2020-11-06 22:55:47,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:47,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682120725] [2020-11-06 22:55:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:47,940 WARN L194 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:55:47,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:47,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:55:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:47,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:55:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:55:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:55:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:55:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:48,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-11-06 22:55:48,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682120725] [2020-11-06 22:55:48,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:55:48,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:55:48,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69450157] [2020-11-06 22:55:48,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:55:48,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:55:48,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:55:48,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:55:48,266 INFO L87 Difference]: Start difference. First operand 239 states and 332 transitions. Second operand 11 states. [2020-11-06 22:55:49,533 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:55:49,814 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:55:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:55:51,374 INFO L93 Difference]: Finished difference Result 458 states and 649 transitions. [2020-11-06 22:55:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:55:51,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2020-11-06 22:55:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:55:51,384 INFO L225 Difference]: With dead ends: 458 [2020-11-06 22:55:51,385 INFO L226 Difference]: Without dead ends: 243 [2020-11-06 22:55:51,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:55:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-11-06 22:55:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2020-11-06 22:55:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-11-06 22:55:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2020-11-06 22:55:51,473 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 83 [2020-11-06 22:55:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:55:51,474 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2020-11-06 22:55:51,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:55:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2020-11-06 22:55:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-06 22:55:51,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:51,490 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-11-06 22:55:51,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:55:51,490 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash -353364059, now seen corresponding path program 1 times [2020-11-06 22:55:51,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:51,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269290071] [2020-11-06 22:55:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,846 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:55:51,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:55:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:55:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:55:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:51,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:55:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:55:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:55:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:55:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:55:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:55:52,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269290071] [2020-11-06 22:55:52,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:55:52,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:55:52,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780596115] [2020-11-06 22:55:52,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:55:52,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:55:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:55:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:55:52,284 INFO L87 Difference]: Start difference. First operand 243 states and 335 transitions. Second operand 16 states. [2020-11-06 22:55:52,616 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:55:54,232 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:55:54,376 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:55:54,687 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:55:54,836 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:55:55,113 WARN L194 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:55:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:55:57,621 INFO L93 Difference]: Finished difference Result 553 states and 762 transitions. [2020-11-06 22:55:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:55:57,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-06 22:55:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:55:57,628 INFO L225 Difference]: With dead ends: 553 [2020-11-06 22:55:57,629 INFO L226 Difference]: Without dead ends: 334 [2020-11-06 22:55:57,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:55:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-11-06 22:55:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2020-11-06 22:55:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-06 22:55:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2020-11-06 22:55:57,690 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 105 [2020-11-06 22:55:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:55:57,691 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2020-11-06 22:55:57,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:55:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2020-11-06 22:55:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-06 22:55:57,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:55:57,694 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] [2020-11-06 22:55:57,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:55:57,694 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:55:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:55:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 510881896, now seen corresponding path program 1 times [2020-11-06 22:55:57,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:55:57,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140555802] [2020-11-06 22:55:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:55:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,005 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:55:58,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:55:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:55:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:55:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:55:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:55:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:55:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:55:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:55:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:55:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:55:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:55:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:55:58,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140555802] [2020-11-06 22:55:58,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:55:58,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:55:58,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550104519] [2020-11-06 22:55:58,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:55:58,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:55:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:55:58,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:55:58,432 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand 16 states. [2020-11-06 22:55:58,738 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:00,298 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:56:00,441 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:56:00,876 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:56:01,152 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:03,604 INFO L93 Difference]: Finished difference Result 559 states and 770 transitions. [2020-11-06 22:56:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:56:03,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2020-11-06 22:56:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:03,609 INFO L225 Difference]: With dead ends: 559 [2020-11-06 22:56:03,609 INFO L226 Difference]: Without dead ends: 337 [2020-11-06 22:56:03,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:56:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-11-06 22:56:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2020-11-06 22:56:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-06 22:56:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2020-11-06 22:56:03,663 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 106 [2020-11-06 22:56:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:03,664 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2020-11-06 22:56:03,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:56:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2020-11-06 22:56:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-06 22:56:03,666 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:03,666 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-11-06 22:56:03,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:56:03,667 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1982410563, now seen corresponding path program 1 times [2020-11-06 22:56:03,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:03,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510232544] [2020-11-06 22:56:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:03,991 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:03,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:56:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:04,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510232544] [2020-11-06 22:56:04,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:04,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:56:04,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102330299] [2020-11-06 22:56:04,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:56:04,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:56:04,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:56:04,432 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand 16 states. [2020-11-06 22:56:04,697 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:05,195 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:06,570 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:56:06,844 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:56:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:09,565 INFO L93 Difference]: Finished difference Result 560 states and 774 transitions. [2020-11-06 22:56:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:56:09,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2020-11-06 22:56:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:09,570 INFO L225 Difference]: With dead ends: 560 [2020-11-06 22:56:09,570 INFO L226 Difference]: Without dead ends: 338 [2020-11-06 22:56:09,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:56:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-11-06 22:56:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2020-11-06 22:56:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-11-06 22:56:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 451 transitions. [2020-11-06 22:56:09,629 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 451 transitions. Word has length 108 [2020-11-06 22:56:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:09,629 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 451 transitions. [2020-11-06 22:56:09,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:56:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 451 transitions. [2020-11-06 22:56:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-06 22:56:09,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:09,632 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-11-06 22:56:09,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:56:09,632 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1612724826, now seen corresponding path program 1 times [2020-11-06 22:56:09,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:09,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905090001] [2020-11-06 22:56:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:09,950 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:09,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:09,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:09,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:09,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:56:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:10,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905090001] [2020-11-06 22:56:10,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:10,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:56:10,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717445681] [2020-11-06 22:56:10,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:56:10,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:56:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:56:10,294 INFO L87 Difference]: Start difference. First operand 334 states and 451 transitions. Second operand 12 states. [2020-11-06 22:56:11,469 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:12,428 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-06 22:56:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:15,282 INFO L93 Difference]: Finished difference Result 797 states and 1102 transitions. [2020-11-06 22:56:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:56:15,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-11-06 22:56:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:15,289 INFO L225 Difference]: With dead ends: 797 [2020-11-06 22:56:15,289 INFO L226 Difference]: Without dead ends: 574 [2020-11-06 22:56:15,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:56:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-11-06 22:56:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 555. [2020-11-06 22:56:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-06 22:56:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2020-11-06 22:56:15,411 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 108 [2020-11-06 22:56:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:15,412 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2020-11-06 22:56:15,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:56:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2020-11-06 22:56:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-06 22:56:15,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:15,415 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] [2020-11-06 22:56:15,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:56:15,415 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:15,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash 340290650, now seen corresponding path program 1 times [2020-11-06 22:56:15,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:15,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093022310] [2020-11-06 22:56:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,728 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:15,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:56:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:56:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:15,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:16,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:16,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-06 22:56:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:16,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093022310] [2020-11-06 22:56:16,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:16,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:56:16,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159041609] [2020-11-06 22:56:16,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:56:16,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:56:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:56:16,059 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand 12 states. [2020-11-06 22:56:16,400 WARN L194 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:18,274 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:56:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:20,837 INFO L93 Difference]: Finished difference Result 975 states and 1357 transitions. [2020-11-06 22:56:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:56:20,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2020-11-06 22:56:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:20,847 INFO L225 Difference]: With dead ends: 975 [2020-11-06 22:56:20,847 INFO L226 Difference]: Without dead ends: 574 [2020-11-06 22:56:20,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:56:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-11-06 22:56:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 555. [2020-11-06 22:56:20,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-06 22:56:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 761 transitions. [2020-11-06 22:56:20,952 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 761 transitions. Word has length 110 [2020-11-06 22:56:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:20,953 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 761 transitions. [2020-11-06 22:56:20,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:56:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 761 transitions. [2020-11-06 22:56:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-06 22:56:20,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:20,956 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-11-06 22:56:20,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:56:20,956 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1838467940, now seen corresponding path program 1 times [2020-11-06 22:56:20,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:20,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925034198] [2020-11-06 22:56:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,286 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:21,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:21,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925034198] [2020-11-06 22:56:21,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:21,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:56:21,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464914254] [2020-11-06 22:56:21,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:56:21,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:21,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:56:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:56:21,606 INFO L87 Difference]: Start difference. First operand 555 states and 761 transitions. Second operand 12 states. [2020-11-06 22:56:23,007 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:23,218 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-06 22:56:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:26,334 INFO L93 Difference]: Finished difference Result 1320 states and 1850 transitions. [2020-11-06 22:56:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:56:26,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-11-06 22:56:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:26,342 INFO L225 Difference]: With dead ends: 1320 [2020-11-06 22:56:26,342 INFO L226 Difference]: Without dead ends: 919 [2020-11-06 22:56:26,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:56:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2020-11-06 22:56:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 912. [2020-11-06 22:56:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2020-11-06 22:56:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1268 transitions. [2020-11-06 22:56:26,496 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1268 transitions. Word has length 109 [2020-11-06 22:56:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:26,497 INFO L481 AbstractCegarLoop]: Abstraction has 912 states and 1268 transitions. [2020-11-06 22:56:26,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:56:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1268 transitions. [2020-11-06 22:56:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-11-06 22:56:26,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:26,500 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-11-06 22:56:26,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:56:26,500 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:26,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1435431002, now seen corresponding path program 1 times [2020-11-06 22:56:26,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:26,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623029712] [2020-11-06 22:56:26,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,805 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:26,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:26,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:27,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623029712] [2020-11-06 22:56:27,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:27,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:56:27,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928728583] [2020-11-06 22:56:27,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:56:27,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:56:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:56:27,109 INFO L87 Difference]: Start difference. First operand 912 states and 1268 transitions. Second operand 13 states. [2020-11-06 22:56:29,013 WARN L194 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:29,272 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:30,640 INFO L93 Difference]: Finished difference Result 1672 states and 2358 transitions. [2020-11-06 22:56:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:56:30,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2020-11-06 22:56:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:30,650 INFO L225 Difference]: With dead ends: 1672 [2020-11-06 22:56:30,650 INFO L226 Difference]: Without dead ends: 932 [2020-11-06 22:56:30,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:56:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2020-11-06 22:56:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2020-11-06 22:56:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2020-11-06 22:56:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1284 transitions. [2020-11-06 22:56:30,830 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1284 transitions. Word has length 109 [2020-11-06 22:56:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:30,831 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 1284 transitions. [2020-11-06 22:56:30,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:56:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1284 transitions. [2020-11-06 22:56:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-06 22:56:30,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:30,836 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] [2020-11-06 22:56:30,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:56:30,836 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -338706351, now seen corresponding path program 1 times [2020-11-06 22:56:30,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:30,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320649842] [2020-11-06 22:56:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,163 WARN L194 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:31,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:56:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-06 22:56:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-06 22:56:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:31,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320649842] [2020-11-06 22:56:31,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:31,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:56:31,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751634571] [2020-11-06 22:56:31,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:56:31,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:31,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:56:31,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:56:31,460 INFO L87 Difference]: Start difference. First operand 932 states and 1284 transitions. Second operand 12 states. [2020-11-06 22:56:31,744 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:33,209 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:56:34,852 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:56:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:36,191 INFO L93 Difference]: Finished difference Result 1704 states and 2372 transitions. [2020-11-06 22:56:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:56:36,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2020-11-06 22:56:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:36,200 INFO L225 Difference]: With dead ends: 1704 [2020-11-06 22:56:36,200 INFO L226 Difference]: Without dead ends: 944 [2020-11-06 22:56:36,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:56:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2020-11-06 22:56:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 937. [2020-11-06 22:56:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2020-11-06 22:56:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1287 transitions. [2020-11-06 22:56:36,403 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1287 transitions. Word has length 118 [2020-11-06 22:56:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:36,403 INFO L481 AbstractCegarLoop]: Abstraction has 937 states and 1287 transitions. [2020-11-06 22:56:36,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:56:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1287 transitions. [2020-11-06 22:56:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-06 22:56:36,408 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:36,408 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-11-06 22:56:36,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:56:36,411 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1607352768, now seen corresponding path program 1 times [2020-11-06 22:56:36,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:36,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704218438] [2020-11-06 22:56:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,776 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:36,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:36,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:56:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:37,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704218438] [2020-11-06 22:56:37,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:37,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:56:37,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404199300] [2020-11-06 22:56:37,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:56:37,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:37,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:56:37,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:56:37,076 INFO L87 Difference]: Start difference. First operand 937 states and 1287 transitions. Second operand 13 states. [2020-11-06 22:56:38,900 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:39,153 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:40,344 INFO L93 Difference]: Finished difference Result 1717 states and 2402 transitions. [2020-11-06 22:56:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:56:40,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2020-11-06 22:56:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:40,353 INFO L225 Difference]: With dead ends: 1717 [2020-11-06 22:56:40,353 INFO L226 Difference]: Without dead ends: 957 [2020-11-06 22:56:40,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:56:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-11-06 22:56:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2020-11-06 22:56:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2020-11-06 22:56:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1303 transitions. [2020-11-06 22:56:40,528 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1303 transitions. Word has length 117 [2020-11-06 22:56:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:40,529 INFO L481 AbstractCegarLoop]: Abstraction has 957 states and 1303 transitions. [2020-11-06 22:56:40,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:56:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1303 transitions. [2020-11-06 22:56:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-06 22:56:40,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:40,532 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, 1] [2020-11-06 22:56:40,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:56:40,533 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1992943030, now seen corresponding path program 1 times [2020-11-06 22:56:40,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:40,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704852442] [2020-11-06 22:56:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,820 WARN L194 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:40,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:40,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:56:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:56:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:41,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704852442] [2020-11-06 22:56:41,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:41,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:56:41,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693813733] [2020-11-06 22:56:41,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:56:41,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:56:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:56:41,127 INFO L87 Difference]: Start difference. First operand 957 states and 1303 transitions. Second operand 13 states. [2020-11-06 22:56:43,205 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:43,460 WARN L194 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:44,481 INFO L93 Difference]: Finished difference Result 1753 states and 2418 transitions. [2020-11-06 22:56:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:56:44,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2020-11-06 22:56:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:44,491 INFO L225 Difference]: With dead ends: 1753 [2020-11-06 22:56:44,491 INFO L226 Difference]: Without dead ends: 973 [2020-11-06 22:56:44,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:56:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-11-06 22:56:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2020-11-06 22:56:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2020-11-06 22:56:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1315 transitions. [2020-11-06 22:56:44,651 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1315 transitions. Word has length 125 [2020-11-06 22:56:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:44,652 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1315 transitions. [2020-11-06 22:56:44,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:56:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1315 transitions. [2020-11-06 22:56:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-11-06 22:56:44,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:44,655 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, 1] [2020-11-06 22:56:44,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:56:44,655 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1686853910, now seen corresponding path program 1 times [2020-11-06 22:56:44,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:44,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175148929] [2020-11-06 22:56:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,004 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:45,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:56:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:56:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:56:45,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175148929] [2020-11-06 22:56:45,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:45,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:56:45,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447208210] [2020-11-06 22:56:45,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:56:45,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:45,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:56:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:56:45,325 INFO L87 Difference]: Start difference. First operand 973 states and 1315 transitions. Second operand 13 states. [2020-11-06 22:56:47,349 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:47,600 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:48,677 INFO L93 Difference]: Finished difference Result 1789 states and 2458 transitions. [2020-11-06 22:56:48,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:56:48,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2020-11-06 22:56:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:48,685 INFO L225 Difference]: With dead ends: 1789 [2020-11-06 22:56:48,686 INFO L226 Difference]: Without dead ends: 993 [2020-11-06 22:56:48,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:56:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-11-06 22:56:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2020-11-06 22:56:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2020-11-06 22:56:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1331 transitions. [2020-11-06 22:56:48,856 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1331 transitions. Word has length 125 [2020-11-06 22:56:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:48,857 INFO L481 AbstractCegarLoop]: Abstraction has 993 states and 1331 transitions. [2020-11-06 22:56:48,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:56:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1331 transitions. [2020-11-06 22:56:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-06 22:56:48,860 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:48,860 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, 1] [2020-11-06 22:56:48,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:56:48,860 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1964157482, now seen corresponding path program 1 times [2020-11-06 22:56:48,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:48,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069649733] [2020-11-06 22:56:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,209 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:49,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:56:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:56:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:56:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:56:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:56:49,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069649733] [2020-11-06 22:56:49,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:49,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:56:49,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267335251] [2020-11-06 22:56:49,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:56:49,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:56:49,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:56:49,526 INFO L87 Difference]: Start difference. First operand 993 states and 1331 transitions. Second operand 13 states. [2020-11-06 22:56:52,018 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:56:52,303 WARN L194 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:56:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:56:53,038 INFO L93 Difference]: Finished difference Result 1833 states and 2486 transitions. [2020-11-06 22:56:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:56:53,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 133 [2020-11-06 22:56:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:56:53,046 INFO L225 Difference]: With dead ends: 1833 [2020-11-06 22:56:53,047 INFO L226 Difference]: Without dead ends: 1017 [2020-11-06 22:56:53,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:56:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2020-11-06 22:56:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2020-11-06 22:56:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2020-11-06 22:56:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1351 transitions. [2020-11-06 22:56:53,231 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1351 transitions. Word has length 133 [2020-11-06 22:56:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:56:53,232 INFO L481 AbstractCegarLoop]: Abstraction has 1017 states and 1351 transitions. [2020-11-06 22:56:53,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:56:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1351 transitions. [2020-11-06 22:56:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-06 22:56:53,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:56:53,236 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, 1] [2020-11-06 22:56:53,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:56:53,236 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:56:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:56:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash 987687110, now seen corresponding path program 1 times [2020-11-06 22:56:53,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:56:53,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846058022] [2020-11-06 22:56:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:56:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,690 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:56:53,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:56:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:56:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:56:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:56:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:56:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:56:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:53,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:56:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:56:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:56:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:56:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:56:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:56:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:56:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:56:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:56:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:56:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-06 22:56:54,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846058022] [2020-11-06 22:56:54,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:56:54,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:56:54,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084388950] [2020-11-06 22:56:54,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:56:54,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:56:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:56:54,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:56:54,221 INFO L87 Difference]: Start difference. First operand 1017 states and 1351 transitions. Second operand 19 states. [2020-11-06 22:56:54,570 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:56:54,850 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:56,110 WARN L194 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:56:57,125 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:56:57,899 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:58,201 WARN L194 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:56:58,515 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:00,855 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:01,141 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:01,392 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:01,679 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:01,969 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:02,440 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:05,805 INFO L93 Difference]: Finished difference Result 2713 states and 3576 transitions. [2020-11-06 22:57:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-06 22:57:05,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2020-11-06 22:57:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:05,819 INFO L225 Difference]: With dead ends: 2713 [2020-11-06 22:57:05,819 INFO L226 Difference]: Without dead ends: 1853 [2020-11-06 22:57:05,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2020-11-06 22:57:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2020-11-06 22:57:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1747. [2020-11-06 22:57:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2020-11-06 22:57:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2269 transitions. [2020-11-06 22:57:06,070 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2269 transitions. Word has length 138 [2020-11-06 22:57:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:06,071 INFO L481 AbstractCegarLoop]: Abstraction has 1747 states and 2269 transitions. [2020-11-06 22:57:06,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:57:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2269 transitions. [2020-11-06 22:57:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-11-06 22:57:06,074 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:06,074 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] [2020-11-06 22:57:06,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:57:06,074 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash 43493923, now seen corresponding path program 1 times [2020-11-06 22:57:06,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:06,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468209876] [2020-11-06 22:57:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,398 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:06,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:57:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-06 22:57:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-06 22:57:06,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468209876] [2020-11-06 22:57:06,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:06,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:57:06,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044989334] [2020-11-06 22:57:06,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:57:06,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:57:06,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:57:06,752 INFO L87 Difference]: Start difference. First operand 1747 states and 2269 transitions. Second operand 13 states. [2020-11-06 22:57:08,178 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:57:08,982 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:09,241 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:10,335 INFO L93 Difference]: Finished difference Result 3175 states and 4156 transitions. [2020-11-06 22:57:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:57:10,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-11-06 22:57:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:10,345 INFO L225 Difference]: With dead ends: 3175 [2020-11-06 22:57:10,345 INFO L226 Difference]: Without dead ends: 1763 [2020-11-06 22:57:10,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-11-06 22:57:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2020-11-06 22:57:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1751. [2020-11-06 22:57:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2020-11-06 22:57:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2247 transitions. [2020-11-06 22:57:10,623 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2247 transitions. Word has length 140 [2020-11-06 22:57:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:10,624 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2247 transitions. [2020-11-06 22:57:10,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:57:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2247 transitions. [2020-11-06 22:57:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-06 22:57:10,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:10,627 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, 1] [2020-11-06 22:57:10,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:57:10,628 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash -890097827, now seen corresponding path program 1 times [2020-11-06 22:57:10,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:10,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548445492] [2020-11-06 22:57:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,069 WARN L194 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:11,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:57:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:57:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:57:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:57:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:57:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:57:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-06 22:57:11,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548445492] [2020-11-06 22:57:11,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:11,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:57:11,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673854053] [2020-11-06 22:57:11,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:57:11,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:57:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:57:11,492 INFO L87 Difference]: Start difference. First operand 1751 states and 2247 transitions. Second operand 19 states. [2020-11-06 22:57:11,956 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:15,562 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:57:15,900 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:16,224 WARN L194 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:57:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:17,200 INFO L93 Difference]: Finished difference Result 1858 states and 2399 transitions. [2020-11-06 22:57:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:57:17,200 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 141 [2020-11-06 22:57:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:17,213 INFO L225 Difference]: With dead ends: 1858 [2020-11-06 22:57:17,213 INFO L226 Difference]: Without dead ends: 1855 [2020-11-06 22:57:17,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2020-11-06 22:57:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2020-11-06 22:57:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1779. [2020-11-06 22:57:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2020-11-06 22:57:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2279 transitions. [2020-11-06 22:57:17,511 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2279 transitions. Word has length 141 [2020-11-06 22:57:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:17,512 INFO L481 AbstractCegarLoop]: Abstraction has 1779 states and 2279 transitions. [2020-11-06 22:57:17,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:57:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2279 transitions. [2020-11-06 22:57:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-06 22:57:17,515 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:17,516 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, 1] [2020-11-06 22:57:17,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:57:17,516 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -486027668, now seen corresponding path program 1 times [2020-11-06 22:57:17,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:17,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269203432] [2020-11-06 22:57:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,831 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:17,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:17,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-06 22:57:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-11-06 22:57:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-11-06 22:57:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-11-06 22:57:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-11-06 22:57:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-06 22:57:18,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269203432] [2020-11-06 22:57:18,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:18,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:57:18,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577084158] [2020-11-06 22:57:18,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:57:18,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:57:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:57:18,252 INFO L87 Difference]: Start difference. First operand 1779 states and 2279 transitions. Second operand 18 states. [2020-11-06 22:57:18,598 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:18,875 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:19,177 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:57:20,697 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-06 22:57:21,188 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:22,016 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:57:23,010 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:23,927 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:24,349 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:57:26,472 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:26,762 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:57:27,040 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:57:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:27,643 INFO L93 Difference]: Finished difference Result 3649 states and 4645 transitions. [2020-11-06 22:57:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:57:27,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2020-11-06 22:57:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:27,656 INFO L225 Difference]: With dead ends: 3649 [2020-11-06 22:57:27,656 INFO L226 Difference]: Without dead ends: 2273 [2020-11-06 22:57:27,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2020-11-06 22:57:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2020-11-06 22:57:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 1939. [2020-11-06 22:57:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2020-11-06 22:57:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2451 transitions. [2020-11-06 22:57:27,969 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2451 transitions. Word has length 142 [2020-11-06 22:57:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:27,969 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 2451 transitions. [2020-11-06 22:57:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:57:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2451 transitions. [2020-11-06 22:57:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-11-06 22:57:27,973 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:27,973 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, 1] [2020-11-06 22:57:27,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:57:27,974 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -69522526, now seen corresponding path program 1 times [2020-11-06 22:57:27,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:27,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318000258] [2020-11-06 22:57:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,308 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:28,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:57:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:57:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:57:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:57:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:57:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:57:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:57:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-06 22:57:28,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318000258] [2020-11-06 22:57:28,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:28,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-06 22:57:28,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786972830] [2020-11-06 22:57:28,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:57:28,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:28,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:57:28,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:57:28,860 INFO L87 Difference]: Start difference. First operand 1939 states and 2451 transitions. Second operand 19 states. [2020-11-06 22:57:29,252 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:57:29,565 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:29,892 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:57:31,454 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:57:31,803 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:32,795 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:34,353 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:57:35,147 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:35,698 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:35,997 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:57:36,339 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:36,650 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:36,992 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:38,454 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:57:40,985 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:42,269 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:57:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:57:42,507 INFO L93 Difference]: Finished difference Result 5025 states and 6342 transitions. [2020-11-06 22:57:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-11-06 22:57:42,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 146 [2020-11-06 22:57:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:57:42,529 INFO L225 Difference]: With dead ends: 5025 [2020-11-06 22:57:42,529 INFO L226 Difference]: Without dead ends: 3545 [2020-11-06 22:57:42,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2020-11-06 22:57:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2020-11-06 22:57:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2400. [2020-11-06 22:57:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2020-11-06 22:57:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3031 transitions. [2020-11-06 22:57:42,968 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3031 transitions. Word has length 146 [2020-11-06 22:57:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:57:42,968 INFO L481 AbstractCegarLoop]: Abstraction has 2400 states and 3031 transitions. [2020-11-06 22:57:42,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:57:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3031 transitions. [2020-11-06 22:57:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-06 22:57:42,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:57:42,971 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] [2020-11-06 22:57:42,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:57:42,971 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:57:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:57:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -758439292, now seen corresponding path program 1 times [2020-11-06 22:57:42,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:57:42,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102798459] [2020-11-06 22:57:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:57:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,293 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:57:43,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:57:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:57:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:57:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:57:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:57:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:57:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:57:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:57:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:57:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-06 22:57:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:57:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:57:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-11-06 22:57:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-06 22:57:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-06 22:57:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:57:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:57:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:57:43,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102798459] [2020-11-06 22:57:43,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:57:43,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:57:43,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831579295] [2020-11-06 22:57:43,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:57:43,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:57:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:57:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:57:43,887 INFO L87 Difference]: Start difference. First operand 2400 states and 3031 transitions. Second operand 18 states. [2020-11-06 22:57:44,519 WARN L194 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 170 [2020-11-06 22:57:44,815 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:57:45,439 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-06 22:57:46,393 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2020-11-06 22:57:46,879 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2020-11-06 22:57:47,052 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:57:48,354 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-06 22:57:48,558 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-06 22:57:48,804 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:57:49,008 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:50,119 WARN L194 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:57:50,435 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:57:50,793 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:57:51,131 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:57:51,490 WARN L194 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2020-11-06 22:57:51,817 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2020-11-06 22:57:52,428 WARN L194 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2020-11-06 22:57:53,219 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-11-06 22:57:55,532 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:57:55,805 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:57:57,297 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:57:58,610 WARN L194 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 172 [2020-11-06 22:58:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:00,433 INFO L93 Difference]: Finished difference Result 6379 states and 8166 transitions. [2020-11-06 22:58:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-06 22:58:00,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2020-11-06 22:58:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:00,454 INFO L225 Difference]: With dead ends: 6379 [2020-11-06 22:58:00,455 INFO L226 Difference]: Without dead ends: 4315 [2020-11-06 22:58:00,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-11-06 22:58:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2020-11-06 22:58:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 2356. [2020-11-06 22:58:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2020-11-06 22:58:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2952 transitions. [2020-11-06 22:58:00,854 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2952 transitions. Word has length 147 [2020-11-06 22:58:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:00,855 INFO L481 AbstractCegarLoop]: Abstraction has 2356 states and 2952 transitions. [2020-11-06 22:58:00,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:58:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2952 transitions. [2020-11-06 22:58:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-06 22:58:00,857 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:00,857 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] [2020-11-06 22:58:00,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:58:00,857 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:00,858 INFO L82 PathProgramCache]: Analyzing trace with hash -11644026, now seen corresponding path program 1 times [2020-11-06 22:58:00,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:00,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223287154] [2020-11-06 22:58:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,149 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:01,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:58:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:58:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:58:01,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223287154] [2020-11-06 22:58:01,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:01,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-06 22:58:01,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091993085] [2020-11-06 22:58:01,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:58:01,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:01,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:58:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:58:01,578 INFO L87 Difference]: Start difference. First operand 2356 states and 2952 transitions. Second operand 14 states. [2020-11-06 22:58:01,883 WARN L194 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2020-11-06 22:58:03,235 WARN L194 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2020-11-06 22:58:04,383 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:58:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:10,375 INFO L93 Difference]: Finished difference Result 6632 states and 8431 transitions. [2020-11-06 22:58:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-06 22:58:10,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-11-06 22:58:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:10,401 INFO L225 Difference]: With dead ends: 6632 [2020-11-06 22:58:10,402 INFO L226 Difference]: Without dead ends: 4662 [2020-11-06 22:58:10,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-11-06 22:58:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2020-11-06 22:58:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 4117. [2020-11-06 22:58:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2020-11-06 22:58:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 5197 transitions. [2020-11-06 22:58:11,101 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 5197 transitions. Word has length 147 [2020-11-06 22:58:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:11,101 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 5197 transitions. [2020-11-06 22:58:11,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:58:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 5197 transitions. [2020-11-06 22:58:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-06 22:58:11,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:11,105 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-11-06 22:58:11,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:58:11,105 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:11,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1872110640, now seen corresponding path program 1 times [2020-11-06 22:58:11,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:11,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233973424] [2020-11-06 22:58:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,467 WARN L194 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:11,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:58:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-06 22:58:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:11,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:58:12,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233973424] [2020-11-06 22:58:12,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:12,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:58:12,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926360751] [2020-11-06 22:58:12,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:58:12,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:58:12,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:58:12,096 INFO L87 Difference]: Start difference. First operand 4117 states and 5197 transitions. Second operand 18 states. [2020-11-06 22:58:12,483 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:12,819 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2020-11-06 22:58:13,218 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:58:15,561 WARN L194 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2020-11-06 22:58:15,917 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-06 22:58:16,079 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-11-06 22:58:16,400 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:58:16,556 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:58:18,110 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:58:18,447 WARN L194 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:58:18,800 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:58:19,124 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:58:19,450 WARN L194 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2020-11-06 22:58:19,759 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2020-11-06 22:58:20,231 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:58:23,166 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:58:25,466 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2020-11-06 22:58:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:27,724 INFO L93 Difference]: Finished difference Result 8288 states and 10627 transitions. [2020-11-06 22:58:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-06 22:58:27,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-11-06 22:58:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:27,752 INFO L225 Difference]: With dead ends: 8288 [2020-11-06 22:58:27,752 INFO L226 Difference]: Without dead ends: 4663 [2020-11-06 22:58:27,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-11-06 22:58:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2020-11-06 22:58:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4047. [2020-11-06 22:58:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4047 states. [2020-11-06 22:58:28,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4047 states to 4047 states and 5102 transitions. [2020-11-06 22:58:28,530 INFO L78 Accepts]: Start accepts. Automaton has 4047 states and 5102 transitions. Word has length 149 [2020-11-06 22:58:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:28,531 INFO L481 AbstractCegarLoop]: Abstraction has 4047 states and 5102 transitions. [2020-11-06 22:58:28,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:58:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4047 states and 5102 transitions. [2020-11-06 22:58:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-06 22:58:28,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:28,534 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-11-06 22:58:28,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-06 22:58:28,534 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1086436645, now seen corresponding path program 1 times [2020-11-06 22:58:28,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:28,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840435571] [2020-11-06 22:58:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,061 WARN L194 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:29,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:58:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-06 22:58:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:58:29,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840435571] [2020-11-06 22:58:29,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:29,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-06 22:58:29,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902803789] [2020-11-06 22:58:29,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-06 22:58:29,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-06 22:58:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-11-06 22:58:29,726 INFO L87 Difference]: Start difference. First operand 4047 states and 5102 transitions. Second operand 18 states. [2020-11-06 22:58:30,462 WARN L194 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 173 [2020-11-06 22:58:31,108 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2020-11-06 22:58:31,284 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:58:31,542 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:58:32,226 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:58:32,670 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-11-06 22:58:32,920 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2020-11-06 22:58:33,159 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2020-11-06 22:58:33,486 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-11-06 22:58:33,658 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-06 22:58:33,908 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-11-06 22:58:34,338 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:58:34,584 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-06 22:58:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:37,405 INFO L93 Difference]: Finished difference Result 7785 states and 9853 transitions. [2020-11-06 22:58:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:58:37,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 150 [2020-11-06 22:58:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:37,440 INFO L225 Difference]: With dead ends: 7785 [2020-11-06 22:58:37,440 INFO L226 Difference]: Without dead ends: 4071 [2020-11-06 22:58:37,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2020-11-06 22:58:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2020-11-06 22:58:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4065. [2020-11-06 22:58:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2020-11-06 22:58:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 5120 transitions. [2020-11-06 22:58:38,160 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 5120 transitions. Word has length 150 [2020-11-06 22:58:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:38,161 INFO L481 AbstractCegarLoop]: Abstraction has 4065 states and 5120 transitions. [2020-11-06 22:58:38,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-06 22:58:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 5120 transitions. [2020-11-06 22:58:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-06 22:58:38,164 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:38,165 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-11-06 22:58:38,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:58:38,165 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1883674457, now seen corresponding path program 1 times [2020-11-06 22:58:38,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:38,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219456837] [2020-11-06 22:58:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,690 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:38,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:38,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:58:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:58:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-11-06 22:58:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:58:39,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219456837] [2020-11-06 22:58:39,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:39,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-06 22:58:39,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719489113] [2020-11-06 22:58:39,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-06 22:58:39,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:39,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-06 22:58:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:58:39,252 INFO L87 Difference]: Start difference. First operand 4065 states and 5120 transitions. Second operand 20 states. [2020-11-06 22:58:40,034 WARN L194 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2020-11-06 22:58:40,965 WARN L194 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 167 [2020-11-06 22:58:41,236 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-11-06 22:58:41,565 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2020-11-06 22:58:41,782 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2020-11-06 22:58:42,295 WARN L194 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-11-06 22:58:42,554 WARN L194 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2020-11-06 22:58:43,226 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:43,524 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:58:43,732 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:58:43,900 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:58:44,237 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2020-11-06 22:58:45,255 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:58:47,005 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:58:47,167 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-06 22:58:47,400 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-11-06 22:58:49,203 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:58:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:49,432 INFO L93 Difference]: Finished difference Result 7914 states and 9980 transitions. [2020-11-06 22:58:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-06 22:58:49,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 150 [2020-11-06 22:58:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:49,450 INFO L225 Difference]: With dead ends: 7914 [2020-11-06 22:58:49,450 INFO L226 Difference]: Without dead ends: 4116 [2020-11-06 22:58:49,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2020-11-06 22:58:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2020-11-06 22:58:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 4065. [2020-11-06 22:58:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2020-11-06 22:58:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 5115 transitions. [2020-11-06 22:58:50,268 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 5115 transitions. Word has length 150 [2020-11-06 22:58:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:50,269 INFO L481 AbstractCegarLoop]: Abstraction has 4065 states and 5115 transitions. [2020-11-06 22:58:50,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-06 22:58:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 5115 transitions. [2020-11-06 22:58:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-06 22:58:50,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:50,272 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, 1] [2020-11-06 22:58:50,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-06 22:58:50,273 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1516179070, now seen corresponding path program 1 times [2020-11-06 22:58:50,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:50,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082595527] [2020-11-06 22:58:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,633 WARN L194 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2020-11-06 22:58:50,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:58:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:58:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:58:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:58:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:58:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-06 22:58:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:50,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-11-06 22:58:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:58:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:58:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-11-06 22:58:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:58:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-06 22:58:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-06 22:58:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:58:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:58:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-06 22:58:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:58:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:58:51,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082595527] [2020-11-06 22:58:51,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:58:51,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-06 22:58:51,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941419640] [2020-11-06 22:58:51,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:58:51,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:58:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:58:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:58:51,103 INFO L87 Difference]: Start difference. First operand 4065 states and 5115 transitions. Second operand 16 states. [2020-11-06 22:58:51,430 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2020-11-06 22:58:51,960 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-06 22:58:52,116 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:58:53,607 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-06 22:58:53,779 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-06 22:58:53,973 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:58:54,126 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2020-11-06 22:58:54,268 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:58:55,100 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-06 22:58:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:58:57,495 INFO L93 Difference]: Finished difference Result 7866 states and 9923 transitions. [2020-11-06 22:58:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:58:57,496 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2020-11-06 22:58:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:58:57,517 INFO L225 Difference]: With dead ends: 7866 [2020-11-06 22:58:57,517 INFO L226 Difference]: Without dead ends: 4083 [2020-11-06 22:58:57,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-11-06 22:58:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2020-11-06 22:58:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4065. [2020-11-06 22:58:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4065 states. [2020-11-06 22:58:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4065 states to 4065 states and 5110 transitions. [2020-11-06 22:58:58,603 INFO L78 Accepts]: Start accepts. Automaton has 4065 states and 5110 transitions. Word has length 151 [2020-11-06 22:58:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:58:58,603 INFO L481 AbstractCegarLoop]: Abstraction has 4065 states and 5110 transitions. [2020-11-06 22:58:58,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:58:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4065 states and 5110 transitions. [2020-11-06 22:58:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-11-06 22:58:58,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:58:58,606 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, 1] [2020-11-06 22:58:58,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-06 22:58:58,606 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:58:58,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:58:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 784211644, now seen corresponding path program 1 times [2020-11-06 22:58:58,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:58:58,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428163475] [2020-11-06 22:58:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:58:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:58:58,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:58:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:58:58,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:58:58,867 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:58:58,868 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:58:58,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-06 22:58:59,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:58:59 BoogieIcfgContainer [2020-11-06 22:58:59,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:58:59,156 INFO L168 Benchmark]: Toolchain (without parser) took 200001.32 ms. Allocated memory was 153.1 MB in the beginning and 1.1 GB in the end (delta: 910.2 MB). Free memory was 127.9 MB in the beginning and 856.8 MB in the end (delta: -728.9 MB). Peak memory consumption was 181.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:58:59,156 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 153.1 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:58:59,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.01 ms. Allocated memory is still 153.1 MB. Free memory was 127.5 MB in the beginning and 109.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:58:59,157 INFO L168 Benchmark]: Boogie Preprocessor took 163.58 ms. Allocated memory is still 153.1 MB. Free memory was 109.8 MB in the beginning and 106.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:58:59,157 INFO L168 Benchmark]: RCFGBuilder took 1172.92 ms. Allocated memory is still 153.1 MB. Free memory was 106.6 MB in the beginning and 89.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:58:59,158 INFO L168 Benchmark]: TraceAbstraction took 198050.97 ms. Allocated memory was 153.1 MB in the beginning and 1.1 GB in the end (delta: 910.2 MB). Free memory was 89.4 MB in the beginning and 856.8 MB in the end (delta: -767.4 MB). Peak memory consumption was 142.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:58:59,160 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 153.1 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 590.01 ms. Allocated memory is still 153.1 MB. Free memory was 127.5 MB in the beginning and 109.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 163.58 ms. Allocated memory is still 153.1 MB. Free memory was 109.8 MB in the beginning and 106.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1172.92 ms. Allocated memory is still 153.1 MB. Free memory was 106.6 MB in the beginning and 89.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 198050.97 ms. Allocated memory was 153.1 MB in the beginning and 1.1 GB in the end (delta: 910.2 MB). Free memory was 89.4 MB in the beginning and 856.8 MB in the end (delta: -767.4 MB). Peak memory consumption was 142.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] msg_t nomsg = (msg_t )-1; [L72] port_t cs1 ; [L73] int8_t cs1_old ; [L74] int8_t cs1_new ; [L75] port_t cs2 ; [L76] int8_t cs2_old ; [L77] int8_t cs2_new ; [L78] port_t s1s2 ; [L79] int8_t s1s2_old ; [L80] int8_t s1s2_new ; [L81] port_t s1s1 ; [L82] int8_t s1s1_old ; [L83] int8_t s1s1_new ; [L84] port_t s2s1 ; [L85] int8_t s2s1_old ; [L86] int8_t s2s1_new ; [L87] port_t s2s2 ; [L88] int8_t s2s2_old ; [L89] int8_t s2s2_new ; [L90] port_t s1p ; [L91] int8_t s1p_old ; [L92] int8_t s1p_new ; [L93] port_t s2p ; [L94] int8_t s2p_old ; [L95] int8_t s2p_new ; [L98] _Bool side1Failed ; [L99] _Bool side2Failed ; [L100] msg_t side1_written ; [L101] msg_t side2_written ; [L107] static _Bool side1Failed_History_0 ; [L108] static _Bool side1Failed_History_1 ; [L109] static _Bool side1Failed_History_2 ; [L110] static _Bool side2Failed_History_0 ; [L111] static _Bool side2Failed_History_1 ; [L112] static _Bool side2Failed_History_2 ; [L113] static int8_t active_side_History_0 ; [L114] static int8_t active_side_History_1 ; [L115] static int8_t active_side_History_2 ; [L116] static msg_t manual_selection_History_0 ; [L117] static msg_t manual_selection_History_1 ; [L118] static msg_t manual_selection_History_2 ; [L468] 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)=72, \old(active_side_History_1)=65, \old(active_side_History_2)=58, \old(cs1)=61, \old(cs1_new)=57, \old(cs1_old)=100, \old(cs2)=69, \old(cs2_new)=85, \old(cs2_old)=66, \old(manual_selection_History_0)=68, \old(manual_selection_History_1)=63, \old(manual_selection_History_2)=90, \old(nomsg)=91, \old(s1p)=70, \old(s1p_new)=56, \old(s1p_old)=78, \old(s1s1)=80, \old(s1s1_new)=103, \old(s1s1_old)=88, \old(s1s2)=74, \old(s1s2_new)=71, \old(s1s2_old)=55, \old(s2p)=92, \old(s2p_new)=95, \old(s2p_old)=60, \old(s2s1)=96, \old(s2s1_new)=89, \old(s2s1_old)=101, \old(s2s2)=59, \old(s2s2_new)=99, \old(s2s2_old)=73, \old(side1_written)=84, \old(side1Failed)=54, \old(side1Failed_History_0)=98, \old(side1Failed_History_1)=104, \old(side1Failed_History_2)=83, \old(side2_written)=75, \old(side2Failed)=97, \old(side2Failed_History_0)=76, \old(side2Failed_History_1)=86, \old(side2Failed_History_2)=64, 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] [L590] int c1 ; [L591] int i2 ; [L594] c1 = 0 [L595] side1Failed = __VERIFIER_nondet_bool() [L596] side2Failed = __VERIFIER_nondet_bool() [L597] side1_written = __VERIFIER_nondet_char() [L598] side2_written = __VERIFIER_nondet_char() [L599] side1Failed_History_0 = __VERIFIER_nondet_bool() [L600] side1Failed_History_1 = __VERIFIER_nondet_bool() [L601] side1Failed_History_2 = __VERIFIER_nondet_bool() [L602] side2Failed_History_0 = __VERIFIER_nondet_bool() [L603] side2Failed_History_1 = __VERIFIER_nondet_bool() [L604] side2Failed_History_2 = __VERIFIER_nondet_bool() [L605] active_side_History_0 = __VERIFIER_nondet_char() [L606] active_side_History_1 = __VERIFIER_nondet_char() [L607] active_side_History_2 = __VERIFIER_nondet_char() [L608] manual_selection_History_0 = __VERIFIER_nondet_char() [L609] manual_selection_History_1 = __VERIFIER_nondet_char() [L610] manual_selection_History_2 = __VERIFIER_nondet_char() [L611] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L244] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L247] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L250] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L253] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L256] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L262] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L265] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L268] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L271] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L274] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND FALSE !((int )manual_selection_History_2 != 0) [L280] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] i2 = init() [L612] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L105] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L612] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L613] cs1_old = nomsg [L614] cs1_new = nomsg [L615] cs2_old = nomsg [L616] cs2_new = nomsg [L617] s1s2_old = nomsg [L618] s1s2_new = nomsg [L619] s1s1_old = nomsg [L620] s1s1_new = nomsg [L621] s2s1_old = nomsg [L622] s2s1_new = nomsg [L623] s2s2_old = nomsg [L624] s2s2_new = nomsg [L625] s1p_old = nomsg [L626] s1p_new = nomsg [L627] s2p_old = nomsg [L628] s2p_new = nomsg [L629] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] COND TRUE i2 < 10 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L298] msg_t manual_selection ; [L299] char tmp ; [L302] tmp = __VERIFIER_nondet_char() [L303] 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=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L304] 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)=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L214] manual_selection_History_2 = manual_selection_History_1 [L215] manual_selection_History_1 = manual_selection_History_0 [L216] 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)=-128, 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=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L304] 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=-128, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L305] 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=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L305] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L306] 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=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L306] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L307] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L632] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=87, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L313] int8_t side1 ; [L314] int8_t side2 ; [L315] msg_t manual_selection ; [L316] int8_t next_state ; [L319] side1 = nomsg [L320] side2 = nomsg [L321] manual_selection = (msg_t )0 [L322] side1Failed = __VERIFIER_nondet_bool() [L323] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L124] side1Failed_History_2 = side1Failed_History_1 [L125] side1Failed_History_1 = side1Failed_History_0 [L126] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L323] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L324] COND FALSE !(\read(side1Failed)) [L331] side1 = s1s1_old [L332] s1s1_old = nomsg [L333] side2 = s2s1_old [L334] s2s1_old = nomsg [L335] manual_selection = cs1_old [L336] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L337] COND TRUE (int )side1 == (int )side2 [L338] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L362] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L362] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L363] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L363] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L364] 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)=-3, \old(side1Failed)=87, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L634] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=62, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L370] int8_t side1 ; [L371] int8_t side2 ; [L372] msg_t manual_selection ; [L373] int8_t next_state ; [L376] side1 = nomsg [L377] side2 = nomsg [L378] manual_selection = (msg_t )0 [L379] side2Failed = __VERIFIER_nondet_bool() [L380] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L154] side2Failed_History_2 = side2Failed_History_1 [L155] side2Failed_History_1 = side2Failed_History_0 [L156] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L380] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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] [L381] COND FALSE !(\read(side2Failed)) [L388] side1 = s1s2_old [L389] s1s2_old = nomsg [L390] side2 = s2s2_old [L391] s2s2_old = nomsg [L392] manual_selection = cs2_old [L393] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L394] COND TRUE (int )side1 == (int )side2 [L395] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L418] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L418] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L419] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L419] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L420] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L420] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L421] 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)=62, \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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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] [L634] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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] [L635] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L427] int8_t active_side ; [L428] int8_t tmp ; [L429] int8_t side1 ; [L430] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L433] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L195] COND TRUE (int )index == 0 [L196] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, 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] [L433] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L433] tmp = read_active_side_history((unsigned char)0) [L434] active_side = tmp [L435] side1 = nomsg [L436] side2 = nomsg [L437] side1 = s1p_old [L438] s1p_old = nomsg [L439] side2 = s2p_old [L440] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L441] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L444] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L447] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L455] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L456] COND FALSE !((int )side2 == 0) [L459] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L464] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L184] active_side_History_2 = active_side_History_1 [L185] active_side_History_1 = active_side_History_0 [L186] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L464] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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] [L635] 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, 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] [L636] cs1_old = cs1_new [L637] cs1_new = nomsg [L638] cs2_old = cs2_new [L639] cs2_new = nomsg [L640] s1s2_old = s1s2_new [L641] s1s2_new = nomsg [L642] s1s1_old = s1s1_new [L643] s1s1_new = nomsg [L644] s2s1_old = s2s1_new [L645] s2s1_new = nomsg [L646] s2s2_old = s2s2_new [L647] s2s2_new = nomsg [L648] s1p_old = s1p_new [L649] s1p_new = nomsg [L650] s2p_old = s2p_new [L651] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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] [L652] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L471] int tmp ; [L472] msg_t tmp___0 ; [L473] _Bool tmp___1 ; [L474] _Bool tmp___2 ; [L475] _Bool tmp___3 ; [L476] _Bool tmp___4 ; [L477] int8_t tmp___5 ; [L478] _Bool tmp___6 ; [L479] _Bool tmp___7 ; [L480] _Bool tmp___8 ; [L481] int8_t tmp___9 ; [L482] _Bool tmp___10 ; [L483] _Bool tmp___11 ; [L484] _Bool tmp___12 ; [L485] msg_t tmp___13 ; [L486] _Bool tmp___14 ; [L487] _Bool tmp___15 ; [L488] _Bool tmp___16 ; [L489] _Bool tmp___17 ; [L490] int8_t tmp___18 ; [L491] int8_t tmp___19 ; [L492] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L495] COND TRUE ! side1Failed [L496] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L503] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L105] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L503] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L504] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L225] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L228] COND TRUE (int )index == 1 [L229] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L504] tmp___0 = read_manual_selection_history((unsigned char)1) [L505] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L506] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L135] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L138] COND TRUE (int )index == 1 [L139] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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)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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L506] tmp___1 = read_side1_failed_history((unsigned char)1) [L507] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L508] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L135] COND TRUE (int )index == 0 [L136] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L508] tmp___2 = read_side1_failed_history((unsigned char)0) [L509] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L510] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L165] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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] [L168] COND TRUE (int )index == 1 [L169] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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)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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L510] tmp___3 = read_side2_failed_history((unsigned char)1) [L511] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L512] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L165] COND TRUE (int )index == 0 [L166] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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] [L512] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L512] tmp___4 = read_side2_failed_history((unsigned char)0) [L513] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L514] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L519] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L524] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L525] COND TRUE ! ((int )side2_written == 0) [L526] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L652] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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] [L652] c1 = check() [L653] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L665] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L667] CALL reach_error() 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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] [L3] __assert_fail("0", "pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c", 3, "reach_error") 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 21 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 197.6s, OverallIterations: 26, TraceHistogramMax: 2, AutomataDifference: 169.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7538 SDtfs, 32270 SDslu, 4296 SDs, 0 SdLazy, 45885 SolverSat, 11647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1571 GetRequests, 784 SyntacticMatches, 16 SemanticMatches, 771 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5120 ImplicationChecksByTransitivity, 77.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4117occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 4939 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 3280 NumberOfCodeBlocks, 3280 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3104 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 191/191 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...