/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -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.1.25-3af5e1f [2020-09-04 13:50:12,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:50:12,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:50:12,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:50:12,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:50:12,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:50:12,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:50:12,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:50:12,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:50:12,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:50:12,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:50:12,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:50:12,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:50:12,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:50:12,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:50:12,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:50:12,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:50:12,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:50:12,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:50:12,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:50:12,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:50:12,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:50:12,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:50:12,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:50:12,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:50:12,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:50:12,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:50:12,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:50:12,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:50:12,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:50:12,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:50:12,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:50:12,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:50:12,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:50:12,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:50:12,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:50:12,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:50:12,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:50:12,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:50:12,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:50:12,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:50:12,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:50:12,324 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:50:12,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:50:12,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:50:12,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:50:12,327 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:50:12,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:50:12,328 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:50:12,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:50:12,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:50:12,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:50:12,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:50:12,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:50:12,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:50:12,330 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:50:12,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:50:12,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:50:12,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:50:12,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:50:12,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:50:12,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:50:12,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:50:12,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:50:12,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:50:12,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:50:12,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:50:12,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:50:12,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:50:12,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:50:12,334 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:50:12,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:50:12,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:50:12,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:50:12,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:50:12,800 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:50:12,801 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:50:12,802 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-09-04 13:50:12,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad715f61/d6dea41373ee41fe9e50660ec0114a1d/FLAG6b57b7516 [2020-09-04 13:50:13,465 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:50:13,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-09-04 13:50:13,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad715f61/d6dea41373ee41fe9e50660ec0114a1d/FLAG6b57b7516 [2020-09-04 13:50:13,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad715f61/d6dea41373ee41fe9e50660ec0114a1d [2020-09-04 13:50:13,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:50:13,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:50:13,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:50:13,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:50:13,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:50:13,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:50:13" (1/1) ... [2020-09-04 13:50:13,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e5903c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:13, skipping insertion in model container [2020-09-04 13:50:13,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:50:13" (1/1) ... [2020-09-04 13:50:13,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:50:13,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:50:14,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:50:14,304 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:50:14,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:50:14,404 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:50:14,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14 WrapperNode [2020-09-04 13:50:14,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:50:14,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:50:14,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:50:14,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:50:14,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... [2020-09-04 13:50:14,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:50:14,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:50:14,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:50:14,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:50:14,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:50:14,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:50:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:50:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:50:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-09-04 13:50:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-09-04 13:50:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-09-04 13:50:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-09-04 13:50:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-09-04 13:50:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-09-04 13:50:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-09-04 13:50:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-09-04 13:50:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-09-04 13:50:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-09-04 13:50:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-09-04 13:50:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-09-04 13:50:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-09-04 13:50:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-09-04 13:50:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-09-04 13:50:14,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:50:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-09-04 13:50:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:50:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 13:50:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-04 13:50:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-09-04 13:50:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-09-04 13:50:14,579 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-09-04 13:50:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-09-04 13:50:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-09-04 13:50:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-09-04 13:50:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-09-04 13:50:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-09-04 13:50:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-04 13:50:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:50:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:50:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:50:15,463 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:50:15,464 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:50:15,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:50:15 BoogieIcfgContainer [2020-09-04 13:50:15,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:50:15,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:50:15,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:50:15,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:50:15,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:50:13" (1/3) ... [2020-09-04 13:50:15,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6876066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:50:15, skipping insertion in model container [2020-09-04 13:50:15,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:14" (2/3) ... [2020-09-04 13:50:15,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6876066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:50:15, skipping insertion in model container [2020-09-04 13:50:15,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:50:15" (3/3) ... [2020-09-04 13:50:15,482 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-09-04 13:50:15,494 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:50:15,505 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:50:15,527 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:50:15,560 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:50:15,560 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:50:15,561 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:50:15,561 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:50:15,561 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:50:15,561 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:50:15,561 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:50:15,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:50:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2020-09-04 13:50:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 13:50:15,606 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:15,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:15,608 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1541207534, now seen corresponding path program 1 times [2020-09-04 13:50:15,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:15,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023955956] [2020-09-04 13:50:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,244 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:16,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 13:50:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:50:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 13:50:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:50:16,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023955956] [2020-09-04 13:50:16,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:16,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:50:16,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699589832] [2020-09-04 13:50:16,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:50:16,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:16,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:50:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:50:16,561 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 9 states. [2020-09-04 13:50:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:18,249 INFO L93 Difference]: Finished difference Result 463 states and 711 transitions. [2020-09-04 13:50:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:50:18,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-09-04 13:50:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:18,270 INFO L225 Difference]: With dead ends: 463 [2020-09-04 13:50:18,270 INFO L226 Difference]: Without dead ends: 238 [2020-09-04 13:50:18,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:50:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-09-04 13:50:18,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-09-04 13:50:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-09-04 13:50:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2020-09-04 13:50:18,384 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 71 [2020-09-04 13:50:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:18,384 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2020-09-04 13:50:18,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:50:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2020-09-04 13:50:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 13:50:18,391 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:18,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:18,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:50:18,392 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:18,393 INFO L82 PathProgramCache]: Analyzing trace with hash -508602450, now seen corresponding path program 1 times [2020-09-04 13:50:18,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:18,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295819977] [2020-09-04 13:50:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,645 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:18,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 13:50:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:50:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 13:50:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:50:18,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295819977] [2020-09-04 13:50:18,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:18,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:50:18,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916894264] [2020-09-04 13:50:18,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:50:18,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:18,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:50:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:50:18,942 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand 14 states. [2020-09-04 13:50:19,149 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:19,446 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:19,623 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:22,442 INFO L93 Difference]: Finished difference Result 467 states and 671 transitions. [2020-09-04 13:50:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:50:22,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-09-04 13:50:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:22,451 INFO L225 Difference]: With dead ends: 467 [2020-09-04 13:50:22,451 INFO L226 Difference]: Without dead ends: 248 [2020-09-04 13:50:22,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:50:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-09-04 13:50:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2020-09-04 13:50:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-09-04 13:50:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 331 transitions. [2020-09-04 13:50:22,514 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 331 transitions. Word has length 71 [2020-09-04 13:50:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:22,514 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 331 transitions. [2020-09-04 13:50:22,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:50:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 331 transitions. [2020-09-04 13:50:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-04 13:50:22,517 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:22,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:22,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:50:22,518 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1489036951, now seen corresponding path program 1 times [2020-09-04 13:50:22,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:22,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682386249] [2020-09-04 13:50:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,780 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:22,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:22,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:50:23,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682386249] [2020-09-04 13:50:23,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:23,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:50:23,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813105219] [2020-09-04 13:50:23,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:50:23,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:50:23,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:50:23,023 INFO L87 Difference]: Start difference. First operand 238 states and 331 transitions. Second operand 11 states. [2020-09-04 13:50:24,159 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:24,339 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:24,479 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-09-04 13:50:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:25,615 INFO L93 Difference]: Finished difference Result 456 states and 647 transitions. [2020-09-04 13:50:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:50:25,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-09-04 13:50:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:25,620 INFO L225 Difference]: With dead ends: 456 [2020-09-04 13:50:25,620 INFO L226 Difference]: Without dead ends: 242 [2020-09-04 13:50:25,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:50:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-09-04 13:50:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-09-04 13:50:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-09-04 13:50:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2020-09-04 13:50:25,662 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 82 [2020-09-04 13:50:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:25,662 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2020-09-04 13:50:25,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:50:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2020-09-04 13:50:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 13:50:25,665 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:25,665 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:25,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:50:25,666 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2124611218, now seen corresponding path program 1 times [2020-09-04 13:50:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:25,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724312204] [2020-09-04 13:50:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:25,950 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:25,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:25,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:25,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:50:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:50:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:26,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724312204] [2020-09-04 13:50:26,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:26,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:50:26,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124716868] [2020-09-04 13:50:26,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:50:26,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:26,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:50:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:50:26,338 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand 16 states. [2020-09-04 13:50:26,575 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:28,182 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:50:28,836 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:30,954 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2020-09-04 13:50:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:50:30,954 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 13:50:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:30,961 INFO L225 Difference]: With dead ends: 551 [2020-09-04 13:50:30,961 INFO L226 Difference]: Without dead ends: 333 [2020-09-04 13:50:30,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:50:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-09-04 13:50:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-09-04 13:50:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-09-04 13:50:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-09-04 13:50:31,006 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 104 [2020-09-04 13:50:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:31,007 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-09-04 13:50:31,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:50:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-09-04 13:50:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 13:50:31,009 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:31,009 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-09-04 13:50:31,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:50:31,010 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:31,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1802435784, now seen corresponding path program 1 times [2020-09-04 13:50:31,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:31,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700725520] [2020-09-04 13:50:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,287 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:31,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:50:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:50:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:31,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700725520] [2020-09-04 13:50:31,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:31,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:50:31,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396373588] [2020-09-04 13:50:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:50:31,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:50:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:50:31,676 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 16 states. [2020-09-04 13:50:31,878 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:33,222 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-09-04 13:50:33,362 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:50:33,496 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-09-04 13:50:33,930 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:36,166 INFO L93 Difference]: Finished difference Result 557 states and 768 transitions. [2020-09-04 13:50:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:50:36,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-09-04 13:50:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:36,170 INFO L225 Difference]: With dead ends: 557 [2020-09-04 13:50:36,171 INFO L226 Difference]: Without dead ends: 336 [2020-09-04 13:50:36,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:50:36,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-09-04 13:50:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2020-09-04 13:50:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-09-04 13:50:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-09-04 13:50:36,209 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 105 [2020-09-04 13:50:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:36,210 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-09-04 13:50:36,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:50:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-09-04 13:50:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 13:50:36,211 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:36,212 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:36,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:50:36,212 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1848316150, now seen corresponding path program 1 times [2020-09-04 13:50:36,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:36,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178679196] [2020-09-04 13:50:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,450 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:36,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 13:50:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:36,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178679196] [2020-09-04 13:50:36,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:36,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:36,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089394905] [2020-09-04 13:50:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:36,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:36,748 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 12 states. [2020-09-04 13:50:37,678 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:38,549 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-09-04 13:50:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:41,021 INFO L93 Difference]: Finished difference Result 791 states and 1096 transitions. [2020-09-04 13:50:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:41,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-09-04 13:50:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:41,029 INFO L225 Difference]: With dead ends: 791 [2020-09-04 13:50:41,030 INFO L226 Difference]: Without dead ends: 570 [2020-09-04 13:50:41,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-09-04 13:50:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-09-04 13:50:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-09-04 13:50:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 760 transitions. [2020-09-04 13:50:41,101 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 760 transitions. Word has length 107 [2020-09-04 13:50:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:41,102 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 760 transitions. [2020-09-04 13:50:41,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 760 transitions. [2020-09-04 13:50:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-04 13:50:41,104 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:41,104 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-09-04 13:50:41,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:50:41,105 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash -723997746, now seen corresponding path program 1 times [2020-09-04 13:50:41,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:41,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473510504] [2020-09-04 13:50:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,335 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:41,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:50:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:50:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:50:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:41,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473510504] [2020-09-04 13:50:41,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:41,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:41,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843199214] [2020-09-04 13:50:41,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:41,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:41,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:41,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:41,628 INFO L87 Difference]: Start difference. First operand 552 states and 760 transitions. Second operand 12 states. [2020-09-04 13:50:41,839 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:43,577 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:50:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:45,857 INFO L93 Difference]: Finished difference Result 968 states and 1350 transitions. [2020-09-04 13:50:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:45,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-09-04 13:50:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:45,863 INFO L225 Difference]: With dead ends: 968 [2020-09-04 13:50:45,864 INFO L226 Difference]: Without dead ends: 570 [2020-09-04 13:50:45,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-09-04 13:50:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-09-04 13:50:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-09-04 13:50:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 758 transitions. [2020-09-04 13:50:45,926 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 758 transitions. Word has length 109 [2020-09-04 13:50:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:45,927 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 758 transitions. [2020-09-04 13:50:45,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 758 transitions. [2020-09-04 13:50:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 13:50:45,929 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:45,929 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-09-04 13:50:45,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:50:45,929 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1067489879, now seen corresponding path program 1 times [2020-09-04 13:50:45,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:45,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324630482] [2020-09-04 13:50:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,151 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:46,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:46,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324630482] [2020-09-04 13:50:46,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:46,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:46,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982931185] [2020-09-04 13:50:46,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:46,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:46,501 INFO L87 Difference]: Start difference. First operand 552 states and 758 transitions. Second operand 12 states. [2020-09-04 13:50:47,807 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:48,003 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-09-04 13:50:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:50,768 INFO L93 Difference]: Finished difference Result 1311 states and 1841 transitions. [2020-09-04 13:50:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:50,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-09-04 13:50:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:50,775 INFO L225 Difference]: With dead ends: 1311 [2020-09-04 13:50:50,776 INFO L226 Difference]: Without dead ends: 913 [2020-09-04 13:50:50,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2020-09-04 13:50:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 907. [2020-09-04 13:50:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2020-09-04 13:50:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1263 transitions. [2020-09-04 13:50:50,878 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1263 transitions. Word has length 108 [2020-09-04 13:50:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:50,879 INFO L479 AbstractCegarLoop]: Abstraction has 907 states and 1263 transitions. [2020-09-04 13:50:50,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1263 transitions. [2020-09-04 13:50:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 13:50:50,881 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:50,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:50,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:50:50,882 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -212373799, now seen corresponding path program 1 times [2020-09-04 13:50:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:50,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183771330] [2020-09-04 13:50:50,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,114 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:51,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:51,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183771330] [2020-09-04 13:50:51,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:51,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:50:51,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101191272] [2020-09-04 13:50:51,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:50:51,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:50:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:50:51,410 INFO L87 Difference]: Start difference. First operand 907 states and 1263 transitions. Second operand 13 states. [2020-09-04 13:50:52,981 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:53,170 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:54,265 INFO L93 Difference]: Finished difference Result 1662 states and 2348 transitions. [2020-09-04 13:50:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:50:54,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-09-04 13:50:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:54,273 INFO L225 Difference]: With dead ends: 1662 [2020-09-04 13:50:54,273 INFO L226 Difference]: Without dead ends: 927 [2020-09-04 13:50:54,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:50:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-09-04 13:50:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2020-09-04 13:50:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-09-04 13:50:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1279 transitions. [2020-09-04 13:50:54,383 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1279 transitions. Word has length 108 [2020-09-04 13:50:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:54,383 INFO L479 AbstractCegarLoop]: Abstraction has 927 states and 1279 transitions. [2020-09-04 13:50:54,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:50:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1279 transitions. [2020-09-04 13:50:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-09-04 13:50:54,386 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:54,386 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:54,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:50:54,386 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1747753163, now seen corresponding path program 1 times [2020-09-04 13:50:54,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:54,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930458962] [2020-09-04 13:50:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,631 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:54,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:50:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:54,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930458962] [2020-09-04 13:50:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:54,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:50:54,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765743451] [2020-09-04 13:50:54,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:50:54,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:50:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:50:54,888 INFO L87 Difference]: Start difference. First operand 927 states and 1279 transitions. Second operand 13 states. [2020-09-04 13:50:56,620 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:56,789 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:57,832 INFO L93 Difference]: Finished difference Result 1702 states and 2392 transitions. [2020-09-04 13:50:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:50:57,832 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-09-04 13:50:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:57,839 INFO L225 Difference]: With dead ends: 1702 [2020-09-04 13:50:57,839 INFO L226 Difference]: Without dead ends: 947 [2020-09-04 13:50:57,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:50:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-09-04 13:50:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2020-09-04 13:50:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2020-09-04 13:50:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1295 transitions. [2020-09-04 13:50:57,942 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1295 transitions. Word has length 116 [2020-09-04 13:50:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:57,943 INFO L479 AbstractCegarLoop]: Abstraction has 947 states and 1295 transitions. [2020-09-04 13:50:57,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:50:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1295 transitions. [2020-09-04 13:50:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 13:50:57,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:57,947 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:57,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:50:57,947 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1289634625, now seen corresponding path program 1 times [2020-09-04 13:50:57,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:57,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596028601] [2020-09-04 13:50:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,260 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:58,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:50:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:50:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:50:58,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596028601] [2020-09-04 13:50:58,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:58,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:50:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113083309] [2020-09-04 13:50:58,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:50:58,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:50:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:50:58,577 INFO L87 Difference]: Start difference. First operand 947 states and 1295 transitions. Second operand 13 states. [2020-09-04 13:51:00,412 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:00,595 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:01,470 INFO L93 Difference]: Finished difference Result 1738 states and 2408 transitions. [2020-09-04 13:51:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:01,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-09-04 13:51:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:01,477 INFO L225 Difference]: With dead ends: 1738 [2020-09-04 13:51:01,477 INFO L226 Difference]: Without dead ends: 963 [2020-09-04 13:51:01,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2020-09-04 13:51:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2020-09-04 13:51:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-09-04 13:51:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1307 transitions. [2020-09-04 13:51:01,576 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1307 transitions. Word has length 124 [2020-09-04 13:51:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:01,577 INFO L479 AbstractCegarLoop]: Abstraction has 963 states and 1307 transitions. [2020-09-04 13:51:01,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1307 transitions. [2020-09-04 13:51:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 13:51:01,580 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:01,580 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:01,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:51:01,581 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1471497757, now seen corresponding path program 1 times [2020-09-04 13:51:01,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:01,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144003551] [2020-09-04 13:51:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:01,858 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:01,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:01,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:01,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:01,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:01,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:51:02,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144003551] [2020-09-04 13:51:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:02,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:51:02,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085107963] [2020-09-04 13:51:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:51:02,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:51:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:51:02,372 INFO L87 Difference]: Start difference. First operand 963 states and 1307 transitions. Second operand 18 states. [2020-09-04 13:51:02,839 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-09-04 13:51:03,017 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:03,472 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:04,559 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 13:51:05,072 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:05,268 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:05,452 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:07,397 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:07,607 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:10,101 INFO L93 Difference]: Finished difference Result 2594 states and 3626 transitions. [2020-09-04 13:51:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:51:10,102 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2020-09-04 13:51:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:10,113 INFO L225 Difference]: With dead ends: 2594 [2020-09-04 13:51:10,113 INFO L226 Difference]: Without dead ends: 1791 [2020-09-04 13:51:10,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 13:51:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2020-09-04 13:51:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1549. [2020-09-04 13:51:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2020-09-04 13:51:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2123 transitions. [2020-09-04 13:51:10,327 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2123 transitions. Word has length 124 [2020-09-04 13:51:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:10,327 INFO L479 AbstractCegarLoop]: Abstraction has 1549 states and 2123 transitions. [2020-09-04 13:51:10,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:51:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2123 transitions. [2020-09-04 13:51:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-04 13:51:10,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:10,330 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, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:10,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:51:10,330 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:10,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1891846081, now seen corresponding path program 1 times [2020-09-04 13:51:10,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:10,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817914534] [2020-09-04 13:51:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,579 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:10,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 13:51:10,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817914534] [2020-09-04 13:51:10,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:10,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:10,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239571260] [2020-09-04 13:51:10,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:10,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:10,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:10,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:10,915 INFO L87 Difference]: Start difference. First operand 1549 states and 2123 transitions. Second operand 13 states. [2020-09-04 13:51:12,632 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:12,806 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:13,849 INFO L93 Difference]: Finished difference Result 2816 states and 3937 transitions. [2020-09-04 13:51:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:13,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2020-09-04 13:51:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:13,864 INFO L225 Difference]: With dead ends: 2816 [2020-09-04 13:51:13,864 INFO L226 Difference]: Without dead ends: 1589 [2020-09-04 13:51:13,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2020-09-04 13:51:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2020-09-04 13:51:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-09-04 13:51:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2155 transitions. [2020-09-04 13:51:14,166 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2155 transitions. Word has length 131 [2020-09-04 13:51:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:14,170 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 2155 transitions. [2020-09-04 13:51:14,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2155 transitions. [2020-09-04 13:51:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-04 13:51:14,173 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:14,174 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:14,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:51:14,174 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:14,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1423528137, now seen corresponding path program 1 times [2020-09-04 13:51:14,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:14,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458350041] [2020-09-04 13:51:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,502 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:14,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 13:51:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-04 13:51:14,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458350041] [2020-09-04 13:51:14,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:14,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:14,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228878624] [2020-09-04 13:51:14,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:14,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:14,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:14,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:14,884 INFO L87 Difference]: Start difference. First operand 1589 states and 2155 transitions. Second operand 13 states. [2020-09-04 13:51:16,393 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 13:51:17,120 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:17,321 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:18,455 INFO L93 Difference]: Finished difference Result 2876 states and 3949 transitions. [2020-09-04 13:51:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:18,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-09-04 13:51:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:18,467 INFO L225 Difference]: With dead ends: 2876 [2020-09-04 13:51:18,468 INFO L226 Difference]: Without dead ends: 1621 [2020-09-04 13:51:18,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2020-09-04 13:51:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2020-09-04 13:51:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2020-09-04 13:51:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 2179 transitions. [2020-09-04 13:51:18,745 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 2179 transitions. Word has length 139 [2020-09-04 13:51:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:18,746 INFO L479 AbstractCegarLoop]: Abstraction has 1621 states and 2179 transitions. [2020-09-04 13:51:18,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 2179 transitions. [2020-09-04 13:51:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 13:51:18,750 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:18,751 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-04 13:51:18,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:51:18,751 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1915689711, now seen corresponding path program 1 times [2020-09-04 13:51:18,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:18,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932543421] [2020-09-04 13:51:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,012 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:19,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 13:51:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-09-04 13:51:19,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932543421] [2020-09-04 13:51:19,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:19,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:19,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243799247] [2020-09-04 13:51:19,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:19,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:19,328 INFO L87 Difference]: Start difference. First operand 1621 states and 2179 transitions. Second operand 13 states. [2020-09-04 13:51:21,414 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:21,587 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:22,139 INFO L93 Difference]: Finished difference Result 2784 states and 3753 transitions. [2020-09-04 13:51:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:22,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-09-04 13:51:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:22,151 INFO L225 Difference]: With dead ends: 2784 [2020-09-04 13:51:22,151 INFO L226 Difference]: Without dead ends: 1669 [2020-09-04 13:51:22,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2020-09-04 13:51:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2020-09-04 13:51:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-09-04 13:51:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2219 transitions. [2020-09-04 13:51:22,385 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2219 transitions. Word has length 140 [2020-09-04 13:51:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:22,385 INFO L479 AbstractCegarLoop]: Abstraction has 1669 states and 2219 transitions. [2020-09-04 13:51:22,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2219 transitions. [2020-09-04 13:51:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:22,388 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:22,388 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:22,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:51:22,389 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1178541992, now seen corresponding path program 1 times [2020-09-04 13:51:22,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:22,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240197101] [2020-09-04 13:51:22,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,745 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:22,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:51:23,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240197101] [2020-09-04 13:51:23,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226705789] [2020-09-04 13:51:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:23,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:51:23,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:23,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:51:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 13:51:23,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:23,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-09-04 13:51:23,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052383868] [2020-09-04 13:51:23,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:51:23,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:51:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:51:23,638 INFO L87 Difference]: Start difference. First operand 1669 states and 2219 transitions. Second operand 6 states. [2020-09-04 13:51:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:24,729 INFO L93 Difference]: Finished difference Result 3325 states and 4424 transitions. [2020-09-04 13:51:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:51:24,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-09-04 13:51:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:24,742 INFO L225 Difference]: With dead ends: 3325 [2020-09-04 13:51:24,742 INFO L226 Difference]: Without dead ends: 1694 [2020-09-04 13:51:24,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2020-09-04 13:51:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2020-09-04 13:51:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1691. [2020-09-04 13:51:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2020-09-04 13:51:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2237 transitions. [2020-09-04 13:51:25,028 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2237 transitions. Word has length 145 [2020-09-04 13:51:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:25,028 INFO L479 AbstractCegarLoop]: Abstraction has 1691 states and 2237 transitions. [2020-09-04 13:51:25,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:51:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2237 transitions. [2020-09-04 13:51:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:25,031 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:25,032 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-09-04 13:51:25,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-09-04 13:51:25,246 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -265465644, now seen corresponding path program 1 times [2020-09-04 13:51:25,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:25,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542446914] [2020-09-04 13:51:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,594 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:25,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:51:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:51:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 13:51:25,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542446914] [2020-09-04 13:51:25,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:25,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:25,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289674867] [2020-09-04 13:51:25,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:25,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:25,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:25,997 INFO L87 Difference]: Start difference. First operand 1691 states and 2237 transitions. Second operand 13 states. [2020-09-04 13:51:26,209 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:27,635 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:27,856 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-09-04 13:51:28,005 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:51:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:32,010 INFO L93 Difference]: Finished difference Result 2708 states and 3593 transitions. [2020-09-04 13:51:32,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 13:51:32,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 146 [2020-09-04 13:51:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:32,019 INFO L225 Difference]: With dead ends: 2708 [2020-09-04 13:51:32,019 INFO L226 Difference]: Without dead ends: 1702 [2020-09-04 13:51:32,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2020-09-04 13:51:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2020-09-04 13:51:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1696. [2020-09-04 13:51:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-09-04 13:51:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2238 transitions. [2020-09-04 13:51:32,296 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2238 transitions. Word has length 146 [2020-09-04 13:51:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:32,296 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2238 transitions. [2020-09-04 13:51:32,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2238 transitions. [2020-09-04 13:51:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:32,300 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:32,300 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:32,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:51:32,300 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 794623386, now seen corresponding path program 1 times [2020-09-04 13:51:32,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:32,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294050072] [2020-09-04 13:51:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,583 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:32,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:51:33,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294050072] [2020-09-04 13:51:33,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693348936] [2020-09-04 13:51:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:33,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-04 13:51:33,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:51:33,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:33,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-09-04 13:51:33,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886103194] [2020-09-04 13:51:33,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:51:33,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:33,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:51:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:51:33,367 INFO L87 Difference]: Start difference. First operand 1696 states and 2238 transitions. Second operand 6 states. [2020-09-04 13:51:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:34,932 INFO L93 Difference]: Finished difference Result 3209 states and 4250 transitions. [2020-09-04 13:51:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:51:34,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-09-04 13:51:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:34,942 INFO L225 Difference]: With dead ends: 3209 [2020-09-04 13:51:34,942 INFO L226 Difference]: Without dead ends: 1720 [2020-09-04 13:51:34,947 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2020-09-04 13:51:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2020-09-04 13:51:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1696. [2020-09-04 13:51:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-09-04 13:51:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2234 transitions. [2020-09-04 13:51:35,234 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2234 transitions. Word has length 145 [2020-09-04 13:51:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:35,234 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2234 transitions. [2020-09-04 13:51:35,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:51:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2234 transitions. [2020-09-04 13:51:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:35,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:35,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:51:35,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-09-04 13:51:35,450 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 265098833, now seen corresponding path program 1 times [2020-09-04 13:51:35,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:35,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639343473] [2020-09-04 13:51:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,762 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:35,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:35,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 13:51:36,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639343473] [2020-09-04 13:51:36,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:51:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118464433] [2020-09-04 13:51:36,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:51:36,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:36,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:51:36,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:51:36,205 INFO L87 Difference]: Start difference. First operand 1696 states and 2234 transitions. Second operand 16 states. [2020-09-04 13:51:36,398 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:36,767 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:37,996 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-09-04 13:51:38,134 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:51:39,506 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-09-04 13:51:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:41,037 INFO L93 Difference]: Finished difference Result 3221 states and 4270 transitions. [2020-09-04 13:51:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:51:41,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 145 [2020-09-04 13:51:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:41,046 INFO L225 Difference]: With dead ends: 3221 [2020-09-04 13:51:41,047 INFO L226 Difference]: Without dead ends: 1708 [2020-09-04 13:51:41,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:51:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2020-09-04 13:51:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1696. [2020-09-04 13:51:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-09-04 13:51:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2226 transitions. [2020-09-04 13:51:41,232 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2226 transitions. Word has length 145 [2020-09-04 13:51:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:41,234 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2226 transitions. [2020-09-04 13:51:41,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:51:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2226 transitions. [2020-09-04 13:51:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:41,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:41,237 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-09-04 13:51:41,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:51:41,237 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash 527509504, now seen corresponding path program 1 times [2020-09-04 13:51:41,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:41,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878915239] [2020-09-04 13:51:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,498 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:41,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:51:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:51:41,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878915239] [2020-09-04 13:51:41,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479105844] [2020-09-04 13:51:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:42,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-04 13:51:42,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:51:42,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:42,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2020-09-04 13:51:42,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917723151] [2020-09-04 13:51:42,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:51:42,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:51:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:42,289 INFO L87 Difference]: Start difference. First operand 1696 states and 2226 transitions. Second operand 5 states. [2020-09-04 13:51:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:42,525 INFO L93 Difference]: Finished difference Result 2417 states and 3178 transitions. [2020-09-04 13:51:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:51:42,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2020-09-04 13:51:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:42,531 INFO L225 Difference]: With dead ends: 2417 [2020-09-04 13:51:42,532 INFO L226 Difference]: Without dead ends: 1336 [2020-09-04 13:51:42,534 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:51:42,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2020-09-04 13:51:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2020-09-04 13:51:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2020-09-04 13:51:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1752 transitions. [2020-09-04 13:51:42,672 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1752 transitions. Word has length 146 [2020-09-04 13:51:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:42,672 INFO L479 AbstractCegarLoop]: Abstraction has 1336 states and 1752 transitions. [2020-09-04 13:51:42,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:51:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1752 transitions. [2020-09-04 13:51:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:42,674 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:42,675 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-09-04 13:51:42,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:42,888 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:42,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1761290840, now seen corresponding path program 1 times [2020-09-04 13:51:42,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:42,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15702865] [2020-09-04 13:51:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,198 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:43,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:51:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:51:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:51:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:51:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:51:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:51:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:51:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 13:51:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:51:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:51:43,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15702865] [2020-09-04 13:51:43,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806148316] [2020-09-04 13:51:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjunts are in the unsatisfiable core [2020-09-04 13:51:43,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:51:44,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:51:44,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 22 [2020-09-04 13:51:44,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26017642] [2020-09-04 13:51:44,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 13:51:44,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:44,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 13:51:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:44,081 INFO L87 Difference]: Start difference. First operand 1336 states and 1752 transitions. Second operand 22 states. [2020-09-04 13:51:44,379 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:51:44,597 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:44,951 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-04 13:51:45,817 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:46,997 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:51:47,247 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-09-04 13:51:47,831 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:48,030 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:48,237 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:48,830 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-09-04 13:51:50,342 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:50,564 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:50,795 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:51,039 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:51:51,283 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:51,635 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:51:52,783 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-09-04 13:51:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:56,523 INFO L93 Difference]: Finished difference Result 3170 states and 4169 transitions. [2020-09-04 13:51:56,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 13:51:56,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2020-09-04 13:51:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:56,532 INFO L225 Difference]: With dead ends: 3170 [2020-09-04 13:51:56,533 INFO L226 Difference]: Without dead ends: 2140 [2020-09-04 13:51:56,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=564, Invalid=2192, Unknown=0, NotChecked=0, Total=2756 [2020-09-04 13:51:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-09-04 13:51:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2032. [2020-09-04 13:51:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2020-09-04 13:51:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2673 transitions. [2020-09-04 13:51:56,825 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2673 transitions. Word has length 146 [2020-09-04 13:51:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:56,825 INFO L479 AbstractCegarLoop]: Abstraction has 2032 states and 2673 transitions. [2020-09-04 13:51:56,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 13:51:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2673 transitions. [2020-09-04 13:51:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-09-04 13:51:56,827 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:56,828 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-09-04 13:51:57,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:57,041 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash -647886319, now seen corresponding path program 1 times [2020-09-04 13:51:57,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:57,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151095761] [2020-09-04 13:51:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,332 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:57,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:51:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:51:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:51:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:51:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:51:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:51:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:51:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:51:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-09-04 13:51:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 13:51:57,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151095761] [2020-09-04 13:51:57,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:57,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:51:57,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516190368] [2020-09-04 13:51:57,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:51:57,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:51:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:51:57,767 INFO L87 Difference]: Start difference. First operand 2032 states and 2673 transitions. Second operand 14 states. [2020-09-04 13:51:57,997 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:59,393 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:52:00,450 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 13:52:00,592 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 13:52:00,928 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-09-04 13:52:02,175 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-09-04 13:52:02,317 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-09-04 13:52:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:06,004 INFO L93 Difference]: Finished difference Result 6362 states and 8425 transitions. [2020-09-04 13:52:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:52:06,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-09-04 13:52:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:06,028 INFO L225 Difference]: With dead ends: 6362 [2020-09-04 13:52:06,028 INFO L226 Difference]: Without dead ends: 4623 [2020-09-04 13:52:06,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 13:52:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-09-04 13:52:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4360. [2020-09-04 13:52:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2020-09-04 13:52:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 5721 transitions. [2020-09-04 13:52:06,620 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 5721 transitions. Word has length 147 [2020-09-04 13:52:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:06,621 INFO L479 AbstractCegarLoop]: Abstraction has 4360 states and 5721 transitions. [2020-09-04 13:52:06,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:52:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 5721 transitions. [2020-09-04 13:52:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 13:52:06,624 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:06,624 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:52:06,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:52:06,625 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1522611423, now seen corresponding path program 1 times [2020-09-04 13:52:06,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:06,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103375021] [2020-09-04 13:52:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,891 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:52:06,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:52:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:52:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:52:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:52:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:06,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:52:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:52:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:52:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:52:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:52:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:52:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:52:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:52:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:52:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 13:52:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:52:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 13:52:07,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103375021] [2020-09-04 13:52:07,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:52:07,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:52:07,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872705529] [2020-09-04 13:52:07,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:52:07,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:52:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:52:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:52:07,447 INFO L87 Difference]: Start difference. First operand 4360 states and 5721 transitions. Second operand 18 states. [2020-09-04 13:52:07,976 WARN L193 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-09-04 13:52:08,223 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:52:08,592 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-04 13:52:09,747 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-09-04 13:52:10,154 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-09-04 13:52:10,322 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-09-04 13:52:10,503 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-09-04 13:52:11,810 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-09-04 13:52:11,986 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-04 13:52:12,254 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:12,415 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:52:13,357 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:13,626 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:13,910 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:14,196 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:14,456 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:14,727 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:15,199 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-09-04 13:52:16,435 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-09-04 13:52:16,739 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:17,419 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:18,437 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:52:19,826 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-09-04 13:52:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:22,643 INFO L93 Difference]: Finished difference Result 8524 states and 11152 transitions. [2020-09-04 13:52:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 13:52:22,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-09-04 13:52:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:22,668 INFO L225 Difference]: With dead ends: 8524 [2020-09-04 13:52:22,668 INFO L226 Difference]: Without dead ends: 5300 [2020-09-04 13:52:22,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 13:52:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-09-04 13:52:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4471. [2020-09-04 13:52:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2020-09-04 13:52:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 5825 transitions. [2020-09-04 13:52:23,172 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 5825 transitions. Word has length 148 [2020-09-04 13:52:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:23,172 INFO L479 AbstractCegarLoop]: Abstraction has 4471 states and 5825 transitions. [2020-09-04 13:52:23,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:52:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 5825 transitions. [2020-09-04 13:52:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-04 13:52:23,175 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:23,176 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-09-04 13:52:23,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:52:23,176 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1902780761, now seen corresponding path program 1 times [2020-09-04 13:52:23,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:23,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976112344] [2020-09-04 13:52:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,459 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:52:23,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:52:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:52:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:52:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:52:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:52:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:52:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:52:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:52:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:52:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:52:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:52:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:52:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:52:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:52:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-09-04 13:52:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 13:52:23,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976112344] [2020-09-04 13:52:23,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:52:23,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:52:23,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001780793] [2020-09-04 13:52:23,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:52:23,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:52:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:52:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:52:23,977 INFO L87 Difference]: Start difference. First operand 4471 states and 5825 transitions. Second operand 18 states. [2020-09-04 13:52:24,277 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:24,540 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:52:24,905 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-04 13:52:27,063 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-09-04 13:52:27,360 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:27,528 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-09-04 13:52:27,794 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-09-04 13:52:27,946 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 13:52:29,363 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:29,613 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:29,869 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:30,119 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:30,394 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:30,658 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:31,559 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-09-04 13:52:31,787 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 13:52:32,187 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-09-04 13:52:32,512 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-09-04 13:52:33,961 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:37,881 INFO L93 Difference]: Finished difference Result 7727 states and 10193 transitions. [2020-09-04 13:52:37,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-04 13:52:37,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-09-04 13:52:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:37,905 INFO L225 Difference]: With dead ends: 7727 [2020-09-04 13:52:37,905 INFO L226 Difference]: Without dead ends: 4615 [2020-09-04 13:52:37,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-09-04 13:52:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2020-09-04 13:52:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4221. [2020-09-04 13:52:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4221 states. [2020-09-04 13:52:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 5483 transitions. [2020-09-04 13:52:38,467 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 5483 transitions. Word has length 149 [2020-09-04 13:52:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:38,467 INFO L479 AbstractCegarLoop]: Abstraction has 4221 states and 5483 transitions. [2020-09-04 13:52:38,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:52:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 5483 transitions. [2020-09-04 13:52:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-04 13:52:38,470 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:38,470 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-09-04 13:52:38,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:52:38,471 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1998716393, now seen corresponding path program 1 times [2020-09-04 13:52:38,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:38,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202273736] [2020-09-04 13:52:38,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:52:38,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:52:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:52:38,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:52:38,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:52:38,739 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:52:38,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:52:38,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:52:38 BoogieIcfgContainer [2020-09-04 13:52:38,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:52:38,998 INFO L168 Benchmark]: Toolchain (without parser) took 145245.50 ms. Allocated memory was 140.5 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 102.9 MB in the beginning and 95.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-09-04 13:52:38,999 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:52:39,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.94 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 176.0 MB in the end (delta: -73.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:39,000 INFO L168 Benchmark]: Boogie Preprocessor took 82.84 ms. Allocated memory is still 203.9 MB. Free memory was 176.0 MB in the beginning and 172.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:39,000 INFO L168 Benchmark]: RCFGBuilder took 982.07 ms. Allocated memory is still 203.9 MB. Free memory was 172.7 MB in the beginning and 109.9 MB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:39,002 INFO L168 Benchmark]: TraceAbstraction took 143523.95 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 986.2 MB). Free memory was 109.2 MB in the beginning and 95.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2020-09-04 13:52:39,004 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 650.94 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 176.0 MB in the end (delta: -73.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.84 ms. Allocated memory is still 203.9 MB. Free memory was 176.0 MB in the beginning and 172.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 982.07 ms. Allocated memory is still 203.9 MB. Free memory was 172.7 MB in the beginning and 109.9 MB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 143523.95 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 986.2 MB). Free memory was 109.2 MB in the beginning and 95.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 665]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=43, \old(active_side_History_1)=31, \old(active_side_History_2)=19, \old(cs1)=25, \old(cs1_new)=16, \old(cs1_old)=37, \old(cs2)=40, \old(cs2_new)=15, \old(cs2_old)=33, \old(manual_selection_History_0)=39, \old(manual_selection_History_1)=28, \old(manual_selection_History_2)=22, \old(nomsg)=23, \old(s1p)=41, \old(s1p_new)=12, \old(s1p_old)=7, \old(s1s1)=8, \old(s1s1_new)=44, \old(s1s1_old)=18, \old(s1s2)=4, \old(s1s2_new)=42, \old(s1s2_old)=13, \old(s2p)=27, \old(s2p_new)=29, \old(s2p_old)=24, \old(s2s1)=32, \old(s2s1_new)=20, \old(s2s1_old)=38, \old(s2s2)=21, \old(s2s2_new)=36, \old(s2s2_old)=45, \old(side1_written)=11, \old(side1Failed)=9, \old(side1Failed_History_0)=35, \old(side1Failed_History_1)=46, \old(side1Failed_History_2)=10, \old(side2_written)=5, \old(side2Failed)=34, \old(side2Failed_History_0)=6, \old(side2Failed_History_1)=14, \old(side2Failed_History_2)=30, active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] int c1 ; [L589] int i2 ; [L592] c1 = 0 [L593] side1Failed = __VERIFIER_nondet_bool() [L594] side2Failed = __VERIFIER_nondet_bool() [L595] side1_written = __VERIFIER_nondet_char() [L596] side2_written = __VERIFIER_nondet_char() [L597] side1Failed_History_0 = __VERIFIER_nondet_bool() [L598] side1Failed_History_1 = __VERIFIER_nondet_bool() [L599] side1Failed_History_2 = __VERIFIER_nondet_bool() [L600] side2Failed_History_0 = __VERIFIER_nondet_bool() [L601] side2Failed_History_1 = __VERIFIER_nondet_bool() [L602] side2Failed_History_2 = __VERIFIER_nondet_bool() [L603] active_side_History_0 = __VERIFIER_nondet_char() [L604] active_side_History_1 = __VERIFIER_nondet_char() [L605] active_side_History_2 = __VERIFIER_nondet_char() [L606] manual_selection_History_0 = __VERIFIER_nondet_char() [L607] manual_selection_History_1 = __VERIFIER_nondet_char() [L608] manual_selection_History_2 = __VERIFIER_nondet_char() [L609] CALL, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side1Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )side2Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )active_side_History_0 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )manual_selection_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side1Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )side2Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )active_side_History_1 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )manual_selection_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side1Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )side2Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )active_side_History_2 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L275] COND FALSE !((int )manual_selection_History_2 != 0) [L278] return (1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] RET, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, init()=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] i2 = init() [L610] CALL assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L610] RET assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] cs1_old = nomsg [L612] cs1_new = nomsg [L613] cs2_old = nomsg [L614] cs2_new = nomsg [L615] s1s2_old = nomsg [L616] s1s2_new = nomsg [L617] s1s1_old = nomsg [L618] s1s1_new = nomsg [L619] s2s1_old = nomsg [L620] s2s1_new = nomsg [L621] s2s2_old = nomsg [L622] s2s2_new = nomsg [L623] s1p_old = nomsg [L624] s1p_new = nomsg [L625] s2p_old = nomsg [L626] s2p_new = nomsg [L627] i2 = 0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L628] COND TRUE 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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] CALL Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L296] msg_t manual_selection ; [L297] char tmp ; [L300] tmp = __VERIFIER_nondet_char() [L301] manual_selection = tmp VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L302] CALL write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] manual_selection_History_2 = manual_selection_History_1 [L213] manual_selection_History_1 = manual_selection_History_0 [L214] manual_selection_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L302] RET write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L304] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L304] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L305] manual_selection = (msg_t )0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L630] RET Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] CALL Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L311] int8_t side1 ; [L312] int8_t side2 ; [L313] msg_t manual_selection ; [L314] int8_t next_state ; [L317] side1 = nomsg [L318] side2 = nomsg [L319] manual_selection = (msg_t )0 [L320] side1Failed = __VERIFIER_nondet_bool() [L321] CALL write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L122] side1Failed_History_2 = side1Failed_History_1 [L123] side1Failed_History_1 = side1Failed_History_0 [L124] side1Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L321] RET write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] COND FALSE !(\read(side1Failed)) [L329] side1 = s1s1_old [L330] s1s1_old = nomsg [L331] side2 = s2s1_old [L332] s2s1_old = nomsg [L333] manual_selection = cs1_old [L334] cs1_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )side2 [L336] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L360] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L360] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L361] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L362] side1_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] RET Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] CALL Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L368] int8_t side1 ; [L369] int8_t side2 ; [L370] msg_t manual_selection ; [L371] int8_t next_state ; [L374] side1 = nomsg [L375] side2 = nomsg [L376] manual_selection = (msg_t )0 [L377] side2Failed = __VERIFIER_nondet_bool() [L378] CALL write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L152] side2Failed_History_2 = side2Failed_History_1 [L153] side2Failed_History_1 = side2Failed_History_0 [L154] side2Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L378] RET write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L379] COND FALSE !(\read(side2Failed)) [L386] side1 = s1s2_old [L387] s1s2_old = nomsg [L388] side2 = s2s2_old [L389] s2s2_old = nomsg [L390] manual_selection = cs2_old [L391] cs2_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L392] COND TRUE (int )side1 == (int )side2 [L393] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L416] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L416] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L417] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L417] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L418] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L418] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L419] side2_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L632] RET Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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] [L633] CALL Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L425] int8_t active_side ; [L426] int8_t tmp ; [L427] int8_t side1 ; [L428] int8_t side2 ; VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L193] COND TRUE (int )index == 0 [L194] return (active_side_History_0); VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] RET, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L431] tmp = read_active_side_history((unsigned char)0) [L432] active_side = tmp [L433] side1 = nomsg [L434] side2 = nomsg [L435] side1 = s1p_old [L436] s1p_old = nomsg [L437] side2 = s2p_old [L438] s2p_old = nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L439] COND FALSE !((int )side1 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L442] COND FALSE !((int )side2 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L445] COND FALSE !((int )side1 == 0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L453] COND TRUE (int )side1 == (int )nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L454] COND FALSE !((int )side2 == 0) [L457] active_side = (int8_t )0 VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L462] CALL write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L182] active_side_History_2 = active_side_History_1 [L183] active_side_History_1 = active_side_History_0 [L184] active_side_History_0 = val VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L462] RET write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L633] RET Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-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] [L634] cs1_old = cs1_new [L635] cs1_new = nomsg [L636] cs2_old = cs2_new [L637] cs2_new = nomsg [L638] s1s2_old = s1s2_new [L639] s1s2_new = nomsg [L640] s1s1_old = s1s1_new [L641] s1s1_new = nomsg [L642] s2s1_old = s2s1_new [L643] s2s1_new = nomsg [L644] s2s2_old = s2s2_new [L645] s2s2_new = nomsg [L646] s1p_old = s1p_new [L647] s1p_new = nomsg [L648] s2p_old = s2p_new [L649] s2p_new = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-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] [L650] CALL, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L469] int tmp ; [L470] msg_t tmp___0 ; [L471] _Bool tmp___1 ; [L472] _Bool tmp___2 ; [L473] _Bool tmp___3 ; [L474] _Bool tmp___4 ; [L475] int8_t tmp___5 ; [L476] _Bool tmp___6 ; [L477] _Bool tmp___7 ; [L478] _Bool tmp___8 ; [L479] int8_t tmp___9 ; [L480] _Bool tmp___10 ; [L481] _Bool tmp___11 ; [L482] _Bool tmp___12 ; [L483] msg_t tmp___13 ; [L484] _Bool tmp___14 ; [L485] _Bool tmp___15 ; [L486] _Bool tmp___16 ; [L487] _Bool tmp___17 ; [L488] int8_t tmp___18 ; [L489] int8_t tmp___19 ; [L490] int8_t tmp___20 ; VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L493] COND TRUE ! side1Failed [L494] tmp = 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L501] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-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] [L501] RET assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L223] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L226] COND TRUE (int )index == 1 [L227] return (manual_selection_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L502] tmp___0 = read_manual_selection_history((unsigned char)1) [L503] COND TRUE ! tmp___0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L504] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L133] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L136] COND TRUE (int )index == 1 [L137] return (side1Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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_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] [L504] tmp___1 = read_side1_failed_history((unsigned char)1) [L505] COND TRUE ! tmp___1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L133] COND TRUE (int )index == 0 [L134] return (side1Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L506] tmp___2 = read_side1_failed_history((unsigned char)0) [L507] COND TRUE ! tmp___2 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L163] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L166] COND TRUE (int )index == 1 [L167] return (side2Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L508] tmp___3 = read_side2_failed_history((unsigned char)1) [L509] COND TRUE ! tmp___3 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L163] COND TRUE (int )index == 0 [L164] return (side2Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L510] tmp___4 = read_side2_failed_history((unsigned char)0) [L511] COND TRUE ! tmp___4 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L512] COND FALSE !(! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L517] COND FALSE !(! (! ((int )side1_written == 0))) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L522] COND TRUE ! (! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L523] COND TRUE ! ((int )side2_written == 0) [L524] return (0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L650] RET, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, check()=0, cs1=0, cs1_new=-1, cs1_old=-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] [L650] c1 = check() [L651] CALL assert(c1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L663] 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] [L665] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-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 20 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 143.1s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 119.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7367 SDtfs, 31120 SDslu, 4218 SDs, 0 SdLazy, 36633 SolverSat, 11909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1965 GetRequests, 1290 SyntacticMatches, 14 SemanticMatches, 661 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3955 ImplicationChecksByTransitivity, 49.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4471occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 1938 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 3688 NumberOfCodeBlocks, 3688 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3510 ConstructedInterpolants, 0 QuantifiedInterpolants, 1645867 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4072 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 233/245 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...