/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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:50:14,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:50:14,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:50:14,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:50:14,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:50:14,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:50:14,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:50:14,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:50:14,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:50:14,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:50:14,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:50:14,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:50:14,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:50:14,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:50:14,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:50:14,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:50:14,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:50:14,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:50:14,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:50:14,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:50:14,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:50:14,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:50:14,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:50:14,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:50:14,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:50:14,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:50:14,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:50:14,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:50:14,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:50:14,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:50:14,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:50:14,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:50:14,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:50:14,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:50:14,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:50:14,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:50:14,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:50:14,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:50:14,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:50:14,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:50:14,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:50:14,774 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:14,800 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:50:14,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:50:14,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:50:14,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:50:14,802 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:50:14,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:50:14,802 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:50:14,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:50:14,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:50:14,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:50:14,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:50:14,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:50:14,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:50:14,804 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:50:14,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:50:14,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:50:14,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:50:14,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:50:14,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:50:14,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:50:14,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:50:14,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:50:14,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:50:14,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:50:14,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:50:14,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:50:14,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:50:14,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:50:14,807 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:50:14,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:50:15,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:50:15,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:50:15,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:50:15,282 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:50:15,282 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:50:15,284 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.UNBOUNDED.pals.c [2020-09-04 13:50:15,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2be3c80b1/0c970566988b4528b505e8621dfbadc1/FLAG54cce1c52 [2020-09-04 13:50:15,959 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:50:15,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-09-04 13:50:15,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2be3c80b1/0c970566988b4528b505e8621dfbadc1/FLAG54cce1c52 [2020-09-04 13:50:16,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2be3c80b1/0c970566988b4528b505e8621dfbadc1 [2020-09-04 13:50:16,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:50:16,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:50:16,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:50:16,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:50:16,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:50:16,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:50:16" (1/1) ... [2020-09-04 13:50:16,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@366b14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:16, skipping insertion in model container [2020-09-04 13:50:16,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:50:16" (1/1) ... [2020-09-04 13:50:16,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:50:16,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:50:16,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:50:16,819 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:50:16,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:50:16,933 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:50:16,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:16 WrapperNode [2020-09-04 13:50:16,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:50:16,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:50:16,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:50:16,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:50:16,949 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:16" (1/1) ... [2020-09-04 13:50:16,949 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:16" (1/1) ... [2020-09-04 13:50:16,964 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:16" (1/1) ... [2020-09-04 13:50:16,965 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:16" (1/1) ... [2020-09-04 13:50:16,985 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:16" (1/1) ... [2020-09-04 13:50:16,999 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:16" (1/1) ... [2020-09-04 13:50:17,003 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:16" (1/1) ... [2020-09-04 13:50:17,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:50:17,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:50:17,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:50:17,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:50:17,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:16" (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:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:50:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:50:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 13:50:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-09-04 13:50:17,105 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-09-04 13:50:17,105 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-09-04 13:50:17,105 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-09-04 13:50:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-09-04 13:50:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-09-04 13:50:17,106 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-09-04 13:50:17,107 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-09-04 13:50:17,107 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-09-04 13:50:17,107 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-09-04 13:50:17,108 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-09-04 13:50:17,109 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-09-04 13:50:17,110 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-09-04 13:50:17,110 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-09-04 13:50:17,110 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-09-04 13:50:17,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:50:17,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-09-04 13:50:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:50:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 13:50:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-09-04 13:50:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-09-04 13:50:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-09-04 13:50:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-09-04 13:50:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 13:50:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-09-04 13:50:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-09-04 13:50:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-09-04 13:50:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-09-04 13:50:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-09-04 13:50:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-09-04 13:50:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:50:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:50:17,912 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:50:17,913 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:50:17,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:50:17 BoogieIcfgContainer [2020-09-04 13:50:17,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:50:17,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:50:17,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:50:17,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:50:17,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:50:16" (1/3) ... [2020-09-04 13:50:17,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1df111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:50:17, skipping insertion in model container [2020-09-04 13:50:17,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:50:16" (2/3) ... [2020-09-04 13:50:17,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e1df111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:50:17, skipping insertion in model container [2020-09-04 13:50:17,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:50:17" (3/3) ... [2020-09-04 13:50:17,929 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c [2020-09-04 13:50:17,940 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:50:17,951 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:50:17,972 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:50:18,002 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:50:18,003 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:50:18,003 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:50:18,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:50:18,003 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:50:18,003 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:50:18,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:50:18,003 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:50:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2020-09-04 13:50:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 13:50:18,045 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:18,046 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,047 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1549655252, now seen corresponding path program 1 times [2020-09-04 13:50:18,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:18,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626741397] [2020-09-04 13:50:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,599 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:18,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 13:50:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:50:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,878 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,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:18,929 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,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626741397] [2020-09-04 13:50:18,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:18,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:50:18,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728377412] [2020-09-04 13:50:18,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:50:18,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:18,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:50:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:50:18,960 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 9 states. [2020-09-04 13:50:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:20,649 INFO L93 Difference]: Finished difference Result 456 states and 705 transitions. [2020-09-04 13:50:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:50:20,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-09-04 13:50:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:20,684 INFO L225 Difference]: With dead ends: 456 [2020-09-04 13:50:20,684 INFO L226 Difference]: Without dead ends: 237 [2020-09-04 13:50:20,698 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:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-09-04 13:50:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-09-04 13:50:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-09-04 13:50:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 342 transitions. [2020-09-04 13:50:20,855 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 342 transitions. Word has length 71 [2020-09-04 13:50:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:20,857 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 342 transitions. [2020-09-04 13:50:20,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:50:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2020-09-04 13:50:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-09-04 13:50:20,872 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:20,874 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:20,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:50:20,875 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash 695502060, now seen corresponding path program 1 times [2020-09-04 13:50:20,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:20,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117487666] [2020-09-04 13:50:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,158 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:21,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 13:50:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:50:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 13:50:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:21,455 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:21,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117487666] [2020-09-04 13:50:21,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:21,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:50:21,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785920938] [2020-09-04 13:50:21,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:50:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:50:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:50:21,460 INFO L87 Difference]: Start difference. First operand 237 states and 342 transitions. Second operand 14 states. [2020-09-04 13:50:21,661 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:21,900 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:22,074 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:24,496 INFO L93 Difference]: Finished difference Result 455 states and 653 transitions. [2020-09-04 13:50:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:50:24,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-09-04 13:50:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:24,506 INFO L225 Difference]: With dead ends: 455 [2020-09-04 13:50:24,506 INFO L226 Difference]: Without dead ends: 237 [2020-09-04 13:50:24,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:50:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-09-04 13:50:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-09-04 13:50:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-09-04 13:50:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2020-09-04 13:50:24,557 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 71 [2020-09-04 13:50:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:24,557 INFO L479 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2020-09-04 13:50:24,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:50:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2020-09-04 13:50:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-04 13:50:24,559 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:24,559 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:24,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:50:24,560 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1333871800, now seen corresponding path program 1 times [2020-09-04 13:50:24,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:24,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966478310] [2020-09-04 13:50:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,819 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:24,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:24,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:25,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:25,032 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:25,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966478310] [2020-09-04 13:50:25,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:25,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:50:25,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796239124] [2020-09-04 13:50:25,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:50:25,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:50:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:50:25,035 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 11 states. [2020-09-04 13:50:26,009 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:26,180 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:27,363 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2020-09-04 13:50:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 13:50:27,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-09-04 13:50:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:27,367 INFO L225 Difference]: With dead ends: 454 [2020-09-04 13:50:27,367 INFO L226 Difference]: Without dead ends: 241 [2020-09-04 13:50:27,369 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:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-09-04 13:50:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2020-09-04 13:50:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-09-04 13:50:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 333 transitions. [2020-09-04 13:50:27,402 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 333 transitions. Word has length 82 [2020-09-04 13:50:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:27,403 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 333 transitions. [2020-09-04 13:50:27,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:50:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 333 transitions. [2020-09-04 13:50:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-09-04 13:50:27,405 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:27,405 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:27,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:50:27,405 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1250466386, now seen corresponding path program 1 times [2020-09-04 13:50:27,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:27,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206867225] [2020-09-04 13:50:27,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,661 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:27,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:27,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:50:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:28,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:50:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:28,053 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:28,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206867225] [2020-09-04 13:50:28,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:28,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:50:28,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779386721] [2020-09-04 13:50:28,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:50:28,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:50:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:50:28,056 INFO L87 Difference]: Start difference. First operand 241 states and 333 transitions. Second operand 16 states. [2020-09-04 13:50:28,269 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:29,711 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-09-04 13:50:29,831 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:50:30,449 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:32,491 INFO L93 Difference]: Finished difference Result 549 states and 758 transitions. [2020-09-04 13:50:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:50:32,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-09-04 13:50:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:32,497 INFO L225 Difference]: With dead ends: 549 [2020-09-04 13:50:32,498 INFO L226 Difference]: Without dead ends: 332 [2020-09-04 13:50:32,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:50:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-09-04 13:50:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2020-09-04 13:50:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-09-04 13:50:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-09-04 13:50:32,540 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 104 [2020-09-04 13:50:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:32,540 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-09-04 13:50:32,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:50:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-09-04 13:50:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 13:50:32,542 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:32,542 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:32,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:50:32,543 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1479117531, now seen corresponding path program 1 times [2020-09-04 13:50:32,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:32,544 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014589636] [2020-09-04 13:50:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,803 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:32,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:32,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:50:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:50:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:33,230 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:33,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014589636] [2020-09-04 13:50:33,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:33,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:50:33,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764543812] [2020-09-04 13:50:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:50:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:50:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:50:33,233 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 16 states. [2020-09-04 13:50:33,424 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:50:34,864 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:50:35,462 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:37,471 INFO L93 Difference]: Finished difference Result 555 states and 766 transitions. [2020-09-04 13:50:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:50:37,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-09-04 13:50:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:37,476 INFO L225 Difference]: With dead ends: 555 [2020-09-04 13:50:37,476 INFO L226 Difference]: Without dead ends: 335 [2020-09-04 13:50:37,478 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:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-09-04 13:50:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2020-09-04 13:50:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-09-04 13:50:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 448 transitions. [2020-09-04 13:50:37,511 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 448 transitions. Word has length 105 [2020-09-04 13:50:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:37,511 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 448 transitions. [2020-09-04 13:50:37,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:50:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 448 transitions. [2020-09-04 13:50:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 13:50:37,513 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:37,514 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:37,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:50:37,514 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash -717194829, now seen corresponding path program 1 times [2020-09-04 13:50:37,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:37,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393144153] [2020-09-04 13:50:37,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,750 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:37,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:37,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:38,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:38,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-09-04 13:50:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:38,035 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:38,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393144153] [2020-09-04 13:50:38,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:38,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:38,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301122641] [2020-09-04 13:50:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:38,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:38,038 INFO L87 Difference]: Start difference. First operand 331 states and 448 transitions. Second operand 12 states. [2020-09-04 13:50:38,912 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:41,912 INFO L93 Difference]: Finished difference Result 788 states and 1093 transitions. [2020-09-04 13:50:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:41,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-09-04 13:50:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:41,918 INFO L225 Difference]: With dead ends: 788 [2020-09-04 13:50:41,918 INFO L226 Difference]: Without dead ends: 568 [2020-09-04 13:50:41,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-09-04 13:50:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 551. [2020-09-04 13:50:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-09-04 13:50:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 759 transitions. [2020-09-04 13:50:41,983 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 759 transitions. Word has length 107 [2020-09-04 13:50:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:41,983 INFO L479 AbstractCegarLoop]: Abstraction has 551 states and 759 transitions. [2020-09-04 13:50:41,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 759 transitions. [2020-09-04 13:50:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 13:50:41,985 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:41,986 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:41,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:50:41,986 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:41,987 INFO L82 PathProgramCache]: Analyzing trace with hash 654438841, now seen corresponding path program 1 times [2020-09-04 13:50:41,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:41,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151614482] [2020-09-04 13:50:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,204 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:42,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:42,465 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:42,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151614482] [2020-09-04 13:50:42,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:42,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:42,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605178487] [2020-09-04 13:50:42,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:42,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:42,468 INFO L87 Difference]: Start difference. First operand 551 states and 759 transitions. Second operand 12 states. [2020-09-04 13:50:43,629 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:46,329 INFO L93 Difference]: Finished difference Result 1308 states and 1846 transitions. [2020-09-04 13:50:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:46,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-09-04 13:50:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:46,342 INFO L225 Difference]: With dead ends: 1308 [2020-09-04 13:50:46,342 INFO L226 Difference]: Without dead ends: 911 [2020-09-04 13:50:46,346 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2020-09-04 13:50:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 905. [2020-09-04 13:50:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2020-09-04 13:50:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1266 transitions. [2020-09-04 13:50:46,469 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1266 transitions. Word has length 108 [2020-09-04 13:50:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:46,469 INFO L479 AbstractCegarLoop]: Abstraction has 905 states and 1266 transitions. [2020-09-04 13:50:46,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1266 transitions. [2020-09-04 13:50:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-09-04 13:50:46,472 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:46,472 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:46,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:50:46,472 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:46,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:46,473 INFO L82 PathProgramCache]: Analyzing trace with hash 925446042, now seen corresponding path program 1 times [2020-09-04 13:50:46,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:46,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932201537] [2020-09-04 13:50:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,706 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:46,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:50:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:50:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:46,967 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,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932201537] [2020-09-04 13:50:46,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:46,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:46,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094783827] [2020-09-04 13:50:46,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:46,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:46,971 INFO L87 Difference]: Start difference. First operand 905 states and 1266 transitions. Second operand 12 states. [2020-09-04 13:50:47,124 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:50,854 INFO L93 Difference]: Finished difference Result 1649 states and 2335 transitions. [2020-09-04 13:50:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:50,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-09-04 13:50:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:50,861 INFO L225 Difference]: With dead ends: 1649 [2020-09-04 13:50:50,861 INFO L226 Difference]: Without dead ends: 916 [2020-09-04 13:50:50,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:50:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2020-09-04 13:50:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 910. [2020-09-04 13:50:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2020-09-04 13:50:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1268 transitions. [2020-09-04 13:50:50,971 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1268 transitions. Word has length 109 [2020-09-04 13:50:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:50,972 INFO L479 AbstractCegarLoop]: Abstraction has 910 states and 1268 transitions. [2020-09-04 13:50:50,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1268 transitions. [2020-09-04 13:50:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 13:50:50,974 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:50,974 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,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:50:50,974 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:50,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash -625424837, now seen corresponding path program 1 times [2020-09-04 13:50:50,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:50,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463503250] [2020-09-04 13:50:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,203 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:51,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:51,505 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,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463503250] [2020-09-04 13:50:51,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:51,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:50:51,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354097123] [2020-09-04 13:50:51,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:50:51,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:50:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:50:51,509 INFO L87 Difference]: Start difference. First operand 910 states and 1268 transitions. Second operand 13 states. [2020-09-04 13:50:53,148 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:50:53,312 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:50:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:54,335 INFO L93 Difference]: Finished difference Result 1663 states and 2354 transitions. [2020-09-04 13:50:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:50:54,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-09-04 13:50:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:54,342 INFO L225 Difference]: With dead ends: 1663 [2020-09-04 13:50:54,343 INFO L226 Difference]: Without dead ends: 930 [2020-09-04 13:50:54,347 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,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2020-09-04 13:50:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2020-09-04 13:50:54,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-09-04 13:50:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1284 transitions. [2020-09-04 13:50:54,444 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1284 transitions. Word has length 108 [2020-09-04 13:50:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:54,445 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1284 transitions. [2020-09-04 13:50:54,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:50:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1284 transitions. [2020-09-04 13:50:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 13:50:54,447 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:54,448 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:50:54,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:50:54,448 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 442586826, now seen corresponding path program 1 times [2020-09-04 13:50:54,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:54,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832337510] [2020-09-04 13:50:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,702 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:54,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:50:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:50:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 13:50:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-09-04 13:50:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:54,998 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,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832337510] [2020-09-04 13:50:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:54,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 13:50:54,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253894590] [2020-09-04 13:50:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:50:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:50:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:50:55,001 INFO L87 Difference]: Start difference. First operand 930 states and 1284 transitions. Second operand 12 states. [2020-09-04 13:50:55,225 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:50:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:50:59,081 INFO L93 Difference]: Finished difference Result 1715 states and 2391 transitions. [2020-09-04 13:50:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 13:50:59,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2020-09-04 13:50:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:50:59,088 INFO L225 Difference]: With dead ends: 1715 [2020-09-04 13:50:59,088 INFO L226 Difference]: Without dead ends: 962 [2020-09-04 13:50:59,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 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:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-09-04 13:50:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 930. [2020-09-04 13:50:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-09-04 13:50:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1280 transitions. [2020-09-04 13:50:59,189 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1280 transitions. Word has length 117 [2020-09-04 13:50:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:50:59,190 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 1280 transitions. [2020-09-04 13:50:59,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:50:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1280 transitions. [2020-09-04 13:50:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-09-04 13:50:59,192 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:50:59,193 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:59,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:50:59,193 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:50:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:50:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash -208311273, now seen corresponding path program 1 times [2020-09-04 13:50:59,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:50:59,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310447590] [2020-09-04 13:50:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:50:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,456 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:50:59,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:50:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:50:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:50:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:50:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:50:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:50:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:50:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:50:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:50:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:50:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:50:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:50:59,712 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:59,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310447590] [2020-09-04 13:50:59,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:50:59,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:50:59,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870559897] [2020-09-04 13:50:59,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:50:59,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:50:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:50:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:50:59,717 INFO L87 Difference]: Start difference. First operand 930 states and 1280 transitions. Second operand 13 states. [2020-09-04 13:51:01,193 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:01,366 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:02,383 INFO L93 Difference]: Finished difference Result 1703 states and 2388 transitions. [2020-09-04 13:51:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:02,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-09-04 13:51:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:02,390 INFO L225 Difference]: With dead ends: 1703 [2020-09-04 13:51:02,390 INFO L226 Difference]: Without dead ends: 950 [2020-09-04 13:51:02,394 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:51:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-09-04 13:51:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-09-04 13:51:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-09-04 13:51:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1296 transitions. [2020-09-04 13:51:02,490 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1296 transitions. Word has length 116 [2020-09-04 13:51:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:02,491 INFO L479 AbstractCegarLoop]: Abstraction has 950 states and 1296 transitions. [2020-09-04 13:51:02,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1296 transitions. [2020-09-04 13:51:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 13:51:02,494 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:02,494 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:51:02,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:51:02,494 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2072056031, now seen corresponding path program 1 times [2020-09-04 13:51:02,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:02,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424952981] [2020-09-04 13:51:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,733 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:02,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:02,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:03,082 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:51:03,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424952981] [2020-09-04 13:51:03,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:03,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:03,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089312614] [2020-09-04 13:51:03,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:03,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:03,086 INFO L87 Difference]: Start difference. First operand 950 states and 1296 transitions. Second operand 13 states. [2020-09-04 13:51:04,787 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:04,980 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:05,784 INFO L93 Difference]: Finished difference Result 1739 states and 2404 transitions. [2020-09-04 13:51:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:05,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-09-04 13:51:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:05,790 INFO L225 Difference]: With dead ends: 1739 [2020-09-04 13:51:05,790 INFO L226 Difference]: Without dead ends: 966 [2020-09-04 13:51:05,793 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 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:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-09-04 13:51:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2020-09-04 13:51:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2020-09-04 13:51:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1308 transitions. [2020-09-04 13:51:05,894 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1308 transitions. Word has length 124 [2020-09-04 13:51:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:05,895 INFO L479 AbstractCegarLoop]: Abstraction has 966 states and 1308 transitions. [2020-09-04 13:51:05,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1308 transitions. [2020-09-04 13:51:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 13:51:05,899 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:05,899 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:05,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:51:05,900 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash 689076351, now seen corresponding path program 1 times [2020-09-04 13:51:05,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:05,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530027449] [2020-09-04 13:51:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,149 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:06,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:06,525 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:06,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530027449] [2020-09-04 13:51:06,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:06,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:51:06,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115189747] [2020-09-04 13:51:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:51:06,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:51:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:51:06,528 INFO L87 Difference]: Start difference. First operand 966 states and 1308 transitions. Second operand 18 states. [2020-09-04 13:51:06,883 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-09-04 13:51:07,054 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:07,536 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:09,213 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:09,402 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:09,577 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:11,423 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:11,611 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:14,169 INFO L93 Difference]: Finished difference Result 2593 states and 3617 transitions. [2020-09-04 13:51:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:51:14,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2020-09-04 13:51:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:14,183 INFO L225 Difference]: With dead ends: 2593 [2020-09-04 13:51:14,184 INFO L226 Difference]: Without dead ends: 1792 [2020-09-04 13:51:14,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 13:51:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-09-04 13:51:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1552. [2020-09-04 13:51:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2020-09-04 13:51:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2122 transitions. [2020-09-04 13:51:14,468 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2122 transitions. Word has length 124 [2020-09-04 13:51:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:14,469 INFO L479 AbstractCegarLoop]: Abstraction has 1552 states and 2122 transitions. [2020-09-04 13:51:14,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:51:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2122 transitions. [2020-09-04 13:51:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-04 13:51:14,473 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:14,474 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:14,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:51:14,474 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1938608124, now seen corresponding path program 1 times [2020-09-04 13:51:14,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:14,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006021583] [2020-09-04 13:51:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,802 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:14,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:14,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:15,168 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:15,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006021583] [2020-09-04 13:51:15,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:15,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:15,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190966021] [2020-09-04 13:51:15,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:15,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:15,173 INFO L87 Difference]: Start difference. First operand 1552 states and 2122 transitions. Second operand 13 states. [2020-09-04 13:51:16,645 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 13:51:17,377 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:17,574 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:18,562 INFO L93 Difference]: Finished difference Result 2817 states and 3930 transitions. [2020-09-04 13:51:18,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:18,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2020-09-04 13:51:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:18,572 INFO L225 Difference]: With dead ends: 2817 [2020-09-04 13:51:18,572 INFO L226 Difference]: Without dead ends: 1592 [2020-09-04 13:51:18,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 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,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2020-09-04 13:51:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2020-09-04 13:51:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2020-09-04 13:51:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2154 transitions. [2020-09-04 13:51:18,739 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2154 transitions. Word has length 131 [2020-09-04 13:51:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:18,740 INFO L479 AbstractCegarLoop]: Abstraction has 1592 states and 2154 transitions. [2020-09-04 13:51:18,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2154 transitions. [2020-09-04 13:51:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-09-04 13:51:18,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:18,743 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:18,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:51:18,743 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -417494266, now seen corresponding path program 1 times [2020-09-04 13:51:18,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:18,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567092346] [2020-09-04 13:51:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:18,973 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:18,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:18,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:18,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,032 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 41 [2020-09-04 13:51:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-09-04 13:51:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:19,272 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:19,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567092346] [2020-09-04 13:51:19,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:19,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:19,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498450434] [2020-09-04 13:51:19,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:19,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:19,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:19,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:19,274 INFO L87 Difference]: Start difference. First operand 1592 states and 2154 transitions. Second operand 13 states. [2020-09-04 13:51:21,056 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:21,225 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:22,050 INFO L93 Difference]: Finished difference Result 2877 states and 3942 transitions. [2020-09-04 13:51:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:22,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-09-04 13:51:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:22,059 INFO L225 Difference]: With dead ends: 2877 [2020-09-04 13:51:22,059 INFO L226 Difference]: Without dead ends: 1624 [2020-09-04 13:51:22,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 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,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-09-04 13:51:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2020-09-04 13:51:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2020-09-04 13:51:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2178 transitions. [2020-09-04 13:51:22,293 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2178 transitions. Word has length 139 [2020-09-04 13:51:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:22,293 INFO L479 AbstractCegarLoop]: Abstraction has 1624 states and 2178 transitions. [2020-09-04 13:51:22,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2178 transitions. [2020-09-04 13:51:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 13:51:22,296 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:22,296 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:22,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:51:22,297 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 678570065, now seen corresponding path program 1 times [2020-09-04 13:51:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:22,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627239581] [2020-09-04 13:51:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,566 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:22,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:22,759 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 1 [2020-09-04 13:51:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-09-04 13:51:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-09-04 13:51:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 13:51:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 13:51:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 13:51:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:22,821 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:22,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627239581] [2020-09-04 13:51:22,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:22,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 13:51:22,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992658237] [2020-09-04 13:51:22,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:51:22,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:51:22,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:51:22,825 INFO L87 Difference]: Start difference. First operand 1624 states and 2178 transitions. Second operand 13 states. [2020-09-04 13:51:25,021 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:25,228 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-09-04 13:51:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:25,730 INFO L93 Difference]: Finished difference Result 2785 states and 3746 transitions. [2020-09-04 13:51:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:51:25,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-09-04 13:51:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:25,740 INFO L225 Difference]: With dead ends: 2785 [2020-09-04 13:51:25,740 INFO L226 Difference]: Without dead ends: 1672 [2020-09-04 13:51:25,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 2 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:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2020-09-04 13:51:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2020-09-04 13:51:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2020-09-04 13:51:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2218 transitions. [2020-09-04 13:51:25,883 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2218 transitions. Word has length 140 [2020-09-04 13:51:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:25,884 INFO L479 AbstractCegarLoop]: Abstraction has 1672 states and 2218 transitions. [2020-09-04 13:51:25,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:51:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2218 transitions. [2020-09-04 13:51:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:25,887 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:25,887 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:25,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:51:25,887 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:25,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1268279286, now seen corresponding path program 1 times [2020-09-04 13:51:25,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:25,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6073929] [2020-09-04 13:51:25,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,173 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:26,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,619 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:26,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6073929] [2020-09-04 13:51:26,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008947849] [2020-09-04 13:51:26,620 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:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:26,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:51:26,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:26,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-04 13:51:27,033 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:27,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:27,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-09-04 13:51:27,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950144005] [2020-09-04 13:51:27,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:51:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:51:27,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:51:27,035 INFO L87 Difference]: Start difference. First operand 1672 states and 2218 transitions. Second operand 6 states. [2020-09-04 13:51:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:28,232 INFO L93 Difference]: Finished difference Result 3331 states and 4422 transitions. [2020-09-04 13:51:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 13:51:28,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-09-04 13:51:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:28,245 INFO L225 Difference]: With dead ends: 3331 [2020-09-04 13:51:28,245 INFO L226 Difference]: Without dead ends: 1697 [2020-09-04 13:51:28,251 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:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2020-09-04 13:51:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1694. [2020-09-04 13:51:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-09-04 13:51:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2236 transitions. [2020-09-04 13:51:28,447 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2236 transitions. Word has length 145 [2020-09-04 13:51:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:28,447 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2236 transitions. [2020-09-04 13:51:28,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:51:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2236 transitions. [2020-09-04 13:51:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:28,450 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:28,450 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:28,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-09-04 13:51:28,663 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1053522632, now seen corresponding path program 1 times [2020-09-04 13:51:28,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:28,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656395021] [2020-09-04 13:51:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:28,957 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:28,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:28,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:28,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,416 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:29,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656395021] [2020-09-04 13:51:29,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149101860] [2020-09-04 13:51:29,417 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:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:29,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-04 13:51:29,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:29,716 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:29,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:29,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-09-04 13:51:29,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538339849] [2020-09-04 13:51:29,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 13:51:29,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:29,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 13:51:29,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-09-04 13:51:29,718 INFO L87 Difference]: Start difference. First operand 1694 states and 2236 transitions. Second operand 6 states. [2020-09-04 13:51:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:31,248 INFO L93 Difference]: Finished difference Result 3205 states and 4246 transitions. [2020-09-04 13:51:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:51:31,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-09-04 13:51:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:31,262 INFO L225 Difference]: With dead ends: 3205 [2020-09-04 13:51:31,262 INFO L226 Difference]: Without dead ends: 1718 [2020-09-04 13:51:31,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2020-09-04 13:51:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-09-04 13:51:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1694. [2020-09-04 13:51:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-09-04 13:51:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2232 transitions. [2020-09-04 13:51:31,560 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2232 transitions. Word has length 145 [2020-09-04 13:51:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:31,561 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2232 transitions. [2020-09-04 13:51:31,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 13:51:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2232 transitions. [2020-09-04 13:51:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-09-04 13:51:31,566 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:31,566 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:31,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-09-04 13:51:31,779 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1583047185, now seen corresponding path program 1 times [2020-09-04 13:51:31,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:31,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032021024] [2020-09-04 13:51:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,056 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:32,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 13:51:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:51:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:32,435 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:32,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032021024] [2020-09-04 13:51:32,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:32,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:51:32,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583829472] [2020-09-04 13:51:32,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:51:32,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:51:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:51:32,438 INFO L87 Difference]: Start difference. First operand 1694 states and 2232 transitions. Second operand 16 states. [2020-09-04 13:51:32,614 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:33,036 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:33,192 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-09-04 13:51:34,388 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-09-04 13:51:34,525 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:51:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:37,088 INFO L93 Difference]: Finished difference Result 3217 states and 4266 transitions. [2020-09-04 13:51:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:51:37,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 145 [2020-09-04 13:51:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:37,097 INFO L225 Difference]: With dead ends: 3217 [2020-09-04 13:51:37,097 INFO L226 Difference]: Without dead ends: 1706 [2020-09-04 13:51:37,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:51:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-09-04 13:51:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1694. [2020-09-04 13:51:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-09-04 13:51:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2224 transitions. [2020-09-04 13:51:37,350 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2224 transitions. Word has length 145 [2020-09-04 13:51:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:37,352 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2224 transitions. [2020-09-04 13:51:37,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:51:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2224 transitions. [2020-09-04 13:51:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:37,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:37,355 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:37,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:51:37,355 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2065307551, now seen corresponding path program 1 times [2020-09-04 13:51:37,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:37,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78952324] [2020-09-04 13:51:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,590 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:37,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:51:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:37,965 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:37,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78952324] [2020-09-04 13:51:37,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:37,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 13:51:37,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331851662] [2020-09-04 13:51:37,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:51:37,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:37,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:51:37,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:51:37,968 INFO L87 Difference]: Start difference. First operand 1694 states and 2224 transitions. Second operand 16 states. [2020-09-04 13:51:38,150 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:38,521 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:39,721 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-09-04 13:51:39,860 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-09-04 13:51:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:42,593 INFO L93 Difference]: Finished difference Result 3185 states and 4214 transitions. [2020-09-04 13:51:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:51:42,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2020-09-04 13:51:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:42,600 INFO L225 Difference]: With dead ends: 3185 [2020-09-04 13:51:42,600 INFO L226 Difference]: Without dead ends: 1706 [2020-09-04 13:51:42,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 13:51:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-09-04 13:51:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1694. [2020-09-04 13:51:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2020-09-04 13:51:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2220 transitions. [2020-09-04 13:51:42,790 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2220 transitions. Word has length 146 [2020-09-04 13:51:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:42,791 INFO L479 AbstractCegarLoop]: Abstraction has 1694 states and 2220 transitions. [2020-09-04 13:51:42,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:51:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2220 transitions. [2020-09-04 13:51:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:42,793 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:42,794 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,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:51:42,794 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1647910945, now seen corresponding path program 1 times [2020-09-04 13:51:42,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:42,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946160358] [2020-09-04 13:51:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,101 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:43,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:51:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:51:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 13:51:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:51:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:51:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:51:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:51:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 13:51:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-09-04 13:51:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,531 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,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946160358] [2020-09-04 13:51:43,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242971341] [2020-09-04 13:51:43,532 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:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:43,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-04 13:51:43,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:43,891 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:43,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:51:43,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2020-09-04 13:51:43,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065334370] [2020-09-04 13:51:43,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:51:43,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:51:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:43,894 INFO L87 Difference]: Start difference. First operand 1694 states and 2220 transitions. Second operand 5 states. [2020-09-04 13:51:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:44,061 INFO L93 Difference]: Finished difference Result 2413 states and 3170 transitions. [2020-09-04 13:51:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:51:44,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2020-09-04 13:51:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:44,068 INFO L225 Difference]: With dead ends: 2413 [2020-09-04 13:51:44,068 INFO L226 Difference]: Without dead ends: 1334 [2020-09-04 13:51:44,071 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:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2020-09-04 13:51:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2020-09-04 13:51:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-09-04 13:51:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1747 transitions. [2020-09-04 13:51:44,203 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1747 transitions. Word has length 146 [2020-09-04 13:51:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:44,203 INFO L479 AbstractCegarLoop]: Abstraction has 1334 states and 1747 transitions. [2020-09-04 13:51:44,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:51:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1747 transitions. [2020-09-04 13:51:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-09-04 13:51:44,206 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:44,206 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:44,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:44,422 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash -263464484, now seen corresponding path program 1 times [2020-09-04 13:51:44,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:44,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606844487] [2020-09-04 13:51:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,688 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:44,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:51:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:51:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:44,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:51:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:51:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:51:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:51:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:51:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 13:51:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:51:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,148 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:45,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606844487] [2020-09-04 13:51:45,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367766322] [2020-09-04 13:51:45,149 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:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:45,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjunts are in the unsatisfiable core [2020-09-04 13:51:45,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:51:45,522 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:45,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:51:45,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 22 [2020-09-04 13:51:45,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812413749] [2020-09-04 13:51:45,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 13:51:45,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:45,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 13:51:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:51:45,527 INFO L87 Difference]: Start difference. First operand 1334 states and 1747 transitions. Second operand 22 states. [2020-09-04 13:51:45,771 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:51:45,980 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:47,163 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-09-04 13:51:48,734 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:48,934 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:49,128 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:51,138 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:51,329 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:51,573 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:51:51,774 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:51:51,977 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-09-04 13:51:52,215 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:51:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:51:56,645 INFO L93 Difference]: Finished difference Result 3162 states and 4158 transitions. [2020-09-04 13:51:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 13:51:56,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2020-09-04 13:51:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:51:56,656 INFO L225 Difference]: With dead ends: 3162 [2020-09-04 13:51:56,656 INFO L226 Difference]: Without dead ends: 2134 [2020-09-04 13:51:56,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=564, Invalid=2192, Unknown=0, NotChecked=0, Total=2756 [2020-09-04 13:51:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-09-04 13:51:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 2030. [2020-09-04 13:51:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2020-09-04 13:51:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2668 transitions. [2020-09-04 13:51:56,860 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2668 transitions. Word has length 146 [2020-09-04 13:51:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:51:56,861 INFO L479 AbstractCegarLoop]: Abstraction has 2030 states and 2668 transitions. [2020-09-04 13:51:56,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 13:51:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2668 transitions. [2020-09-04 13:51:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-09-04 13:51:56,863 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:51:56,863 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,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:51:57,077 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:51:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:51:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash 981502446, now seen corresponding path program 1 times [2020-09-04 13:51:57,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:51:57,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404575897] [2020-09-04 13:51:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:51:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,350 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:51:57,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:51:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:51:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:51:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:51:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:51:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:51:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:51:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:51:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:51:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:51:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:51:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:51:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:51:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:51:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:51:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-09-04 13:51:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:51:57,783 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,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404575897] [2020-09-04 13:51:57,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:51:57,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 13:51:57,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773043451] [2020-09-04 13:51:57,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:51:57,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:51:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:51:57,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:51:57,787 INFO L87 Difference]: Start difference. First operand 2030 states and 2668 transitions. Second operand 14 states. [2020-09-04 13:51:57,960 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-09-04 13:51:59,087 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-09-04 13:52:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:04,665 INFO L93 Difference]: Finished difference Result 6354 states and 8412 transitions. [2020-09-04 13:52:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:52:04,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-09-04 13:52:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:04,758 INFO L225 Difference]: With dead ends: 6354 [2020-09-04 13:52:04,758 INFO L226 Difference]: Without dead ends: 4617 [2020-09-04 13:52:04,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 13:52:04,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2020-09-04 13:52:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 4356. [2020-09-04 13:52:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4356 states. [2020-09-04 13:52:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 5712 transitions. [2020-09-04 13:52:05,155 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 5712 transitions. Word has length 147 [2020-09-04 13:52:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:05,155 INFO L479 AbstractCegarLoop]: Abstraction has 4356 states and 5712 transitions. [2020-09-04 13:52:05,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:52:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 5712 transitions. [2020-09-04 13:52:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-09-04 13:52:05,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:05,159 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:05,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:52:05,159 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash -261787196, now seen corresponding path program 1 times [2020-09-04 13:52:05,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:05,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871011161] [2020-09-04 13:52:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,425 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:52:05,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:52:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:52:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:52:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:52:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:52:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 13:52:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:52:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:52:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:52:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:52:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 13:52:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:52:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 13:52:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-09-04 13:52:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-09-04 13:52:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:05,909 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:05,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871011161] [2020-09-04 13:52:05,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:52:05,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:52:05,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534943951] [2020-09-04 13:52:05,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:52:05,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:52:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:52:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:52:05,910 INFO L87 Difference]: Start difference. First operand 4356 states and 5712 transitions. Second operand 18 states. [2020-09-04 13:52:06,360 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-09-04 13:52:06,576 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:52:07,867 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-09-04 13:52:08,224 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-09-04 13:52:08,592 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-09-04 13:52:09,677 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-09-04 13:52:09,824 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-04 13:52:10,046 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:10,185 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:52:11,012 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:11,241 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:11,487 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:11,732 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:11,956 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-09-04 13:52:12,184 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-09-04 13:52:12,588 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-09-04 13:52:13,677 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-09-04 13:52:13,939 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:14,624 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:15,481 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-04 13:52:16,720 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-09-04 13:52:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:19,378 INFO L93 Difference]: Finished difference Result 8508 states and 11131 transitions. [2020-09-04 13:52:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 13:52:19,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-09-04 13:52:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:19,399 INFO L225 Difference]: With dead ends: 8508 [2020-09-04 13:52:19,399 INFO L226 Difference]: Without dead ends: 5288 [2020-09-04 13:52:19,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 13:52:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2020-09-04 13:52:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 4467. [2020-09-04 13:52:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2020-09-04 13:52:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 5816 transitions. [2020-09-04 13:52:20,133 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 5816 transitions. Word has length 148 [2020-09-04 13:52:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:20,134 INFO L479 AbstractCegarLoop]: Abstraction has 4467 states and 5816 transitions. [2020-09-04 13:52:20,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:52:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 5816 transitions. [2020-09-04 13:52:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-04 13:52:20,139 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:20,139 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:20,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:52:20,139 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash -314853532, now seen corresponding path program 1 times [2020-09-04 13:52:20,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:20,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037291925] [2020-09-04 13:52:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,437 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-09-04 13:52:20,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:52:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:52:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:52:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 13:52:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 13:52:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 13:52:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:52:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:52:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:52:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:52:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 13:52:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 13:52:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:52:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:52:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-09-04 13:52:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-09-04 13:52:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:52:20,875 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:20,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037291925] [2020-09-04 13:52:20,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:52:20,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 13:52:20,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943205387] [2020-09-04 13:52:20,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:52:20,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:52:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:52:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:52:20,877 INFO L87 Difference]: Start difference. First operand 4467 states and 5816 transitions. Second operand 18 states. [2020-09-04 13:52:21,132 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:21,354 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-09-04 13:52:23,421 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-09-04 13:52:23,746 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-09-04 13:52:23,885 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-09-04 13:52:25,445 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:25,654 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:25,877 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:26,090 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-09-04 13:52:26,324 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:26,546 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-09-04 13:52:29,286 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-09-04 13:52:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:52:32,918 INFO L93 Difference]: Finished difference Result 7719 states and 10180 transitions. [2020-09-04 13:52:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-04 13:52:32,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-09-04 13:52:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:52:32,939 INFO L225 Difference]: With dead ends: 7719 [2020-09-04 13:52:32,939 INFO L226 Difference]: Without dead ends: 4611 [2020-09-04 13:52:32,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-09-04 13:52:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2020-09-04 13:52:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4217. [2020-09-04 13:52:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4217 states. [2020-09-04 13:52:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 5474 transitions. [2020-09-04 13:52:33,545 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 5474 transitions. Word has length 149 [2020-09-04 13:52:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:52:33,546 INFO L479 AbstractCegarLoop]: Abstraction has 4217 states and 5474 transitions. [2020-09-04 13:52:33,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:52:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 5474 transitions. [2020-09-04 13:52:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-04 13:52:33,549 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:52:33,549 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:33,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:52:33,549 INFO L427 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:52:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:52:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 712531577, now seen corresponding path program 1 times [2020-09-04 13:52:33,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:52:33,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950428174] [2020-09-04 13:52:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:52:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:52:33,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:52:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:52:33,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:52:33,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:52:33,802 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:52:33,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 13:52:34,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:52:34 BoogieIcfgContainer [2020-09-04 13:52:34,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:52:34,020 INFO L168 Benchmark]: Toolchain (without parser) took 137763.27 ms. Allocated memory was 147.3 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 102.7 MB in the beginning and 918.6 MB in the end (delta: -815.9 MB). Peak memory consumption was 207.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:34,020 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 147.3 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:34,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.58 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.5 MB in the beginning and 175.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:34,021 INFO L168 Benchmark]: Boogie Preprocessor took 74.94 ms. Allocated memory is still 203.9 MB. Free memory was 175.3 MB in the beginning and 172.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:34,021 INFO L168 Benchmark]: RCFGBuilder took 909.80 ms. Allocated memory is still 203.9 MB. Free memory was 171.9 MB in the beginning and 109.0 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:34,021 INFO L168 Benchmark]: TraceAbstraction took 136097.13 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 966.3 MB). Free memory was 109.0 MB in the beginning and 918.6 MB in the end (delta: -809.5 MB). Peak memory consumption was 156.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:52:34,024 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 147.3 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 675.58 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.5 MB in the beginning and 175.3 MB in the end (delta: -72.8 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.94 ms. Allocated memory is still 203.9 MB. Free memory was 175.3 MB in the beginning and 172.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.80 ms. Allocated memory is still 203.9 MB. Free memory was 171.9 MB in the beginning and 109.0 MB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136097.13 ms. Allocated memory was 203.9 MB in the beginning and 1.2 GB in the end (delta: 966.3 MB). Free memory was 109.0 MB in the beginning and 918.6 MB in the end (delta: -809.5 MB). Peak memory consumption was 156.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 664]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=43, \old(active_side_History_1)=31, \old(active_side_History_2)=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 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-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] [L662] COND TRUE ! arg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-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] [L664] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-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, 242 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 135.8s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 112.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7470 SDtfs, 29154 SDslu, 3995 SDs, 0 SdLazy, 37817 SolverSat, 10897 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2016 GetRequests, 1314 SyntacticMatches, 14 SemanticMatches, 688 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 46.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4467occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 1937 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 3805 NumberOfCodeBlocks, 3805 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3626 ConstructedInterpolants, 0 QuantifiedInterpolants, 1681044 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4072 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 237/249 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...