/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 17:05:17,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 17:05:17,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 17:05:17,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 17:05:17,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 17:05:17,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 17:05:17,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 17:05:17,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 17:05:17,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 17:05:17,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 17:05:17,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 17:05:17,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 17:05:17,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 17:05:17,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 17:05:17,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 17:05:17,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 17:05:17,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 17:05:17,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 17:05:17,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 17:05:17,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 17:05:17,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 17:05:17,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 17:05:17,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 17:05:17,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 17:05:17,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 17:05:17,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 17:05:17,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 17:05:17,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 17:05:17,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 17:05:17,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 17:05:17,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 17:05:17,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 17:05:17,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 17:05:17,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 17:05:17,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 17:05:17,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 17:05:17,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 17:05:17,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 17:05:17,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 17:05:17,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 17:05:17,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 17:05:17,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 17:05:17,231 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 17:05:17,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 17:05:17,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 17:05:17,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 17:05:17,235 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 17:05:17,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 17:05:17,235 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 17:05:17,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 17:05:17,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 17:05:17,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 17:05:17,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 17:05:17,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 17:05:17,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 17:05:17,237 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 17:05:17,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 17:05:17,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 17:05:17,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 17:05:17,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 17:05:17,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 17:05:17,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 17:05:17,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 17:05:17,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:05:17,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 17:05:17,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 17:05:17,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 17:05:17,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 17:05:17,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 17:05:17,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 17:05:17,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 17:05:17,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 17:05:17,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 17:05:17,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 17:05:17,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 17:05:17,554 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 17:05:17,555 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 17:05:17,556 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-08-22 17:05:17,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425f45f6/38d12bb3a9824f259cd0e2bcc054ceeb/FLAG31bd6c9f8 [2020-08-22 17:05:18,181 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 17:05:18,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-08-22 17:05:18,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425f45f6/38d12bb3a9824f259cd0e2bcc054ceeb/FLAG31bd6c9f8 [2020-08-22 17:05:18,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5425f45f6/38d12bb3a9824f259cd0e2bcc054ceeb [2020-08-22 17:05:18,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 17:05:18,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 17:05:18,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 17:05:18,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 17:05:18,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 17:05:18,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:05:18" (1/1) ... [2020-08-22 17:05:18,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b970c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:18, skipping insertion in model container [2020-08-22 17:05:18,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:05:18" (1/1) ... [2020-08-22 17:05:18,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 17:05:18,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 17:05:19,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:05:19,116 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 17:05:19,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:05:19,214 INFO L208 MainTranslator]: Completed translation [2020-08-22 17:05:19,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19 WrapperNode [2020-08-22 17:05:19,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 17:05:19,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 17:05:19,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 17:05:19,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 17:05:19,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... [2020-08-22 17:05:19,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 17:05:19,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 17:05:19,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 17:05:19,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 17:05:19,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:05:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 17:05:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 17:05:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 17:05:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2020-08-22 17:05:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2020-08-22 17:05:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2020-08-22 17:05:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2020-08-22 17:05:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-08-22 17:05:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 17:05:19,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2020-08-22 17:05:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 17:05:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure read [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure write [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 17:05:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2020-08-22 17:05:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2020-08-22 17:05:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2020-08-22 17:05:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2020-08-22 17:05:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-08-22 17:05:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 17:05:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 17:05:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 17:05:20,186 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 17:05:20,187 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 17:05:20,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:05:20 BoogieIcfgContainer [2020-08-22 17:05:20,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 17:05:20,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 17:05:20,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 17:05:20,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 17:05:20,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:05:18" (1/3) ... [2020-08-22 17:05:20,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4435bc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:05:20, skipping insertion in model container [2020-08-22 17:05:20,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:05:19" (2/3) ... [2020-08-22 17:05:20,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4435bc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:05:20, skipping insertion in model container [2020-08-22 17:05:20,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:05:20" (3/3) ... [2020-08-22 17:05:20,203 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2020-08-22 17:05:20,215 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 17:05:20,223 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 17:05:20,236 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 17:05:20,259 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 17:05:20,259 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 17:05:20,260 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 17:05:20,260 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 17:05:20,260 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 17:05:20,260 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 17:05:20,260 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 17:05:20,261 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 17:05:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states. [2020-08-22 17:05:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-08-22 17:05:20,296 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:20,297 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-08-22 17:05:20,298 INFO L427 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1541207534, now seen corresponding path program 1 times [2020-08-22 17:05:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:20,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577029118] [2020-08-22 17:05:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,790 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:20,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 17:05:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:20,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 17:05:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:21,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577029118] [2020-08-22 17:05:21,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:21,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:05:21,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261054435] [2020-08-22 17:05:21,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:05:21,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:05:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:05:21,127 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 9 states. [2020-08-22 17:05:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:22,813 INFO L93 Difference]: Finished difference Result 463 states and 711 transitions. [2020-08-22 17:05:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:05:22,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2020-08-22 17:05:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:22,835 INFO L225 Difference]: With dead ends: 463 [2020-08-22 17:05:22,835 INFO L226 Difference]: Without dead ends: 238 [2020-08-22 17:05:22,843 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-08-22 17:05:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-22 17:05:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2020-08-22 17:05:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-08-22 17:05:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2020-08-22 17:05:22,933 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 71 [2020-08-22 17:05:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:22,934 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2020-08-22 17:05:22,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:05:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2020-08-22 17:05:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-08-22 17:05:22,938 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:22,938 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-08-22 17:05:22,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 17:05:22,939 INFO L427 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash -508602450, now seen corresponding path program 1 times [2020-08-22 17:05:22,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:22,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190438832] [2020-08-22 17:05:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,244 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:23,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 17:05:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:05:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-08-22 17:05:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:23,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190438832] [2020-08-22 17:05:23,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:23,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 17:05:23,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886022234] [2020-08-22 17:05:23,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:05:23,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:05:23,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:05:23,491 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand 14 states. [2020-08-22 17:05:23,666 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:23,899 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:24,083 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:26,727 INFO L93 Difference]: Finished difference Result 467 states and 671 transitions. [2020-08-22 17:05:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 17:05:26,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2020-08-22 17:05:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:26,731 INFO L225 Difference]: With dead ends: 467 [2020-08-22 17:05:26,731 INFO L226 Difference]: Without dead ends: 248 [2020-08-22 17:05:26,734 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-08-22 17:05:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-08-22 17:05:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2020-08-22 17:05:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2020-08-22 17:05:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 331 transitions. [2020-08-22 17:05:26,775 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 331 transitions. Word has length 71 [2020-08-22 17:05:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:26,775 INFO L479 AbstractCegarLoop]: Abstraction has 238 states and 331 transitions. [2020-08-22 17:05:26,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:05:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 331 transitions. [2020-08-22 17:05:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-22 17:05:26,779 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:26,779 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-08-22 17:05:26,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 17:05:26,779 INFO L427 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1489036951, now seen corresponding path program 1 times [2020-08-22 17:05:26,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:26,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236629386] [2020-08-22 17:05:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,004 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:27,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:05:27,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236629386] [2020-08-22 17:05:27,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:27,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 17:05:27,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429457] [2020-08-22 17:05:27,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 17:05:27,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 17:05:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:05:27,176 INFO L87 Difference]: Start difference. First operand 238 states and 331 transitions. Second operand 11 states. [2020-08-22 17:05:28,168 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:28,302 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:29,451 INFO L93 Difference]: Finished difference Result 456 states and 647 transitions. [2020-08-22 17:05:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:05:29,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-22 17:05:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:29,455 INFO L225 Difference]: With dead ends: 456 [2020-08-22 17:05:29,456 INFO L226 Difference]: Without dead ends: 242 [2020-08-22 17:05:29,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-08-22 17:05:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-08-22 17:05:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-08-22 17:05:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-08-22 17:05:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2020-08-22 17:05:29,491 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 82 [2020-08-22 17:05:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:29,491 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2020-08-22 17:05:29,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 17:05:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2020-08-22 17:05:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-08-22 17:05:29,494 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:29,494 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-08-22 17:05:29,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 17:05:29,495 INFO L427 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2124611218, now seen corresponding path program 1 times [2020-08-22 17:05:29,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:29,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47654700] [2020-08-22 17:05:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,745 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:29,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:29,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:30,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:30,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:05:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:30,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:05:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:30,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47654700] [2020-08-22 17:05:30,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:30,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:05:30,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354646387] [2020-08-22 17:05:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:05:30,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:05:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:05:30,108 INFO L87 Difference]: Start difference. First operand 242 states and 334 transitions. Second operand 16 states. [2020-08-22 17:05:30,326 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:32,234 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:34,055 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2020-08-22 17:05:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:05:34,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2020-08-22 17:05:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:34,061 INFO L225 Difference]: With dead ends: 551 [2020-08-22 17:05:34,061 INFO L226 Difference]: Without dead ends: 333 [2020-08-22 17:05:34,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:05:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-08-22 17:05:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2020-08-22 17:05:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-08-22 17:05:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-08-22 17:05:34,109 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 104 [2020-08-22 17:05:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:34,109 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-08-22 17:05:34,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:05:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-08-22 17:05:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-08-22 17:05:34,111 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:34,112 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-08-22 17:05:34,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 17:05:34,112 INFO L427 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1802435784, now seen corresponding path program 1 times [2020-08-22 17:05:34,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:34,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927459198] [2020-08-22 17:05:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,316 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:34,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 17:05:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 17:05:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:34,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927459198] [2020-08-22 17:05:34,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:34,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:05:34,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984918421] [2020-08-22 17:05:34,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:05:34,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:05:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:05:34,617 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 16 states. [2020-08-22 17:05:34,788 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:05:36,582 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:38,485 INFO L93 Difference]: Finished difference Result 557 states and 768 transitions. [2020-08-22 17:05:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:05:38,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-08-22 17:05:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:38,489 INFO L225 Difference]: With dead ends: 557 [2020-08-22 17:05:38,490 INFO L226 Difference]: Without dead ends: 336 [2020-08-22 17:05:38,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:05:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-08-22 17:05:38,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2020-08-22 17:05:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-08-22 17:05:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 449 transitions. [2020-08-22 17:05:38,528 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 449 transitions. Word has length 105 [2020-08-22 17:05:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:38,529 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 449 transitions. [2020-08-22 17:05:38,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:05:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 449 transitions. [2020-08-22 17:05:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-08-22 17:05:38,531 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:38,531 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-08-22 17:05:38,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 17:05:38,532 INFO L427 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:38,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1848316150, now seen corresponding path program 1 times [2020-08-22 17:05:38,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:38,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983749646] [2020-08-22 17:05:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,718 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:38,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-22 17:05:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:38,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983749646] [2020-08-22 17:05:38,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:38,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:05:38,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321089218] [2020-08-22 17:05:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:05:38,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:05:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:38,983 INFO L87 Difference]: Start difference. First operand 332 states and 449 transitions. Second operand 12 states. [2020-08-22 17:05:39,769 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:42,656 INFO L93 Difference]: Finished difference Result 791 states and 1096 transitions. [2020-08-22 17:05:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:05:42,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2020-08-22 17:05:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:42,662 INFO L225 Difference]: With dead ends: 791 [2020-08-22 17:05:42,663 INFO L226 Difference]: Without dead ends: 570 [2020-08-22 17:05:42,665 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:05:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-08-22 17:05:42,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-08-22 17:05:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-08-22 17:05:42,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 760 transitions. [2020-08-22 17:05:42,732 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 760 transitions. Word has length 107 [2020-08-22 17:05:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:42,732 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 760 transitions. [2020-08-22 17:05:42,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:05:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 760 transitions. [2020-08-22 17:05:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 17:05:42,734 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:42,735 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-08-22 17:05:42,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 17:05:42,735 INFO L427 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -723997746, now seen corresponding path program 1 times [2020-08-22 17:05:42,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:42,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108495059] [2020-08-22 17:05:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:42,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:05:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:05:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:05:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:43,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108495059] [2020-08-22 17:05:43,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:43,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:05:43,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562504828] [2020-08-22 17:05:43,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:05:43,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:43,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:05:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:43,144 INFO L87 Difference]: Start difference. First operand 552 states and 760 transitions. Second operand 12 states. [2020-08-22 17:05:43,334 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:05:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:46,858 INFO L93 Difference]: Finished difference Result 968 states and 1350 transitions. [2020-08-22 17:05:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:05:46,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2020-08-22 17:05:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:46,869 INFO L225 Difference]: With dead ends: 968 [2020-08-22 17:05:46,871 INFO L226 Difference]: Without dead ends: 570 [2020-08-22 17:05:46,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:05:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-08-22 17:05:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 552. [2020-08-22 17:05:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-08-22 17:05:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 758 transitions. [2020-08-22 17:05:46,955 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 758 transitions. Word has length 109 [2020-08-22 17:05:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:46,956 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 758 transitions. [2020-08-22 17:05:46,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:05:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 758 transitions. [2020-08-22 17:05:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 17:05:46,958 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:46,958 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-08-22 17:05:46,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 17:05:46,958 INFO L427 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1067489879, now seen corresponding path program 1 times [2020-08-22 17:05:46,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:46,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965277562] [2020-08-22 17:05:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,143 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:47,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:05:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:47,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965277562] [2020-08-22 17:05:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:05:47,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754400523] [2020-08-22 17:05:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:05:47,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:05:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:05:47,457 INFO L87 Difference]: Start difference. First operand 552 states and 758 transitions. Second operand 12 states. [2020-08-22 17:05:48,643 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:51,305 INFO L93 Difference]: Finished difference Result 1311 states and 1841 transitions. [2020-08-22 17:05:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:05:51,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-08-22 17:05:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:51,312 INFO L225 Difference]: With dead ends: 1311 [2020-08-22 17:05:51,313 INFO L226 Difference]: Without dead ends: 913 [2020-08-22 17:05:51,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:05:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2020-08-22 17:05:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 907. [2020-08-22 17:05:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2020-08-22 17:05:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1263 transitions. [2020-08-22 17:05:51,425 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1263 transitions. Word has length 108 [2020-08-22 17:05:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:51,426 INFO L479 AbstractCegarLoop]: Abstraction has 907 states and 1263 transitions. [2020-08-22 17:05:51,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:05:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1263 transitions. [2020-08-22 17:05:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-08-22 17:05:51,428 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:51,429 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-08-22 17:05:51,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 17:05:51,429 INFO L427 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash -212373799, now seen corresponding path program 1 times [2020-08-22 17:05:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:51,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218954017] [2020-08-22 17:05:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,633 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:51,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:05:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:51,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218954017] [2020-08-22 17:05:51,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:51,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:05:51,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96524681] [2020-08-22 17:05:51,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:05:51,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:05:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:05:51,918 INFO L87 Difference]: Start difference. First operand 907 states and 1263 transitions. Second operand 13 states. [2020-08-22 17:05:53,262 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:53,402 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:54,392 INFO L93 Difference]: Finished difference Result 1662 states and 2348 transitions. [2020-08-22 17:05:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:05:54,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2020-08-22 17:05:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:54,399 INFO L225 Difference]: With dead ends: 1662 [2020-08-22 17:05:54,399 INFO L226 Difference]: Without dead ends: 927 [2020-08-22 17:05:54,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:05:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-08-22 17:05:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2020-08-22 17:05:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-08-22 17:05:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1279 transitions. [2020-08-22 17:05:54,499 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1279 transitions. Word has length 108 [2020-08-22 17:05:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:54,500 INFO L479 AbstractCegarLoop]: Abstraction has 927 states and 1279 transitions. [2020-08-22 17:05:54,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:05:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1279 transitions. [2020-08-22 17:05:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-08-22 17:05:54,502 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:54,502 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-08-22 17:05:54,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 17:05:54,503 INFO L427 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1747753163, now seen corresponding path program 1 times [2020-08-22 17:05:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:54,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647669968] [2020-08-22 17:05:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,700 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:54,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:05:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:05:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:54,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647669968] [2020-08-22 17:05:54,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:54,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:05:54,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572729635] [2020-08-22 17:05:54,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:05:54,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:54,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:05:54,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:05:54,945 INFO L87 Difference]: Start difference. First operand 927 states and 1279 transitions. Second operand 13 states. [2020-08-22 17:05:56,424 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:56,542 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:05:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:05:57,469 INFO L93 Difference]: Finished difference Result 1702 states and 2392 transitions. [2020-08-22 17:05:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:05:57,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 116 [2020-08-22 17:05:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:05:57,477 INFO L225 Difference]: With dead ends: 1702 [2020-08-22 17:05:57,478 INFO L226 Difference]: Without dead ends: 947 [2020-08-22 17:05:57,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:05:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-08-22 17:05:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2020-08-22 17:05:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2020-08-22 17:05:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1295 transitions. [2020-08-22 17:05:57,587 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1295 transitions. Word has length 116 [2020-08-22 17:05:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:05:57,587 INFO L479 AbstractCegarLoop]: Abstraction has 947 states and 1295 transitions. [2020-08-22 17:05:57,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:05:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1295 transitions. [2020-08-22 17:05:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-08-22 17:05:57,592 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:05:57,592 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-08-22 17:05:57,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 17:05:57,593 INFO L427 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:05:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:05:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1289634625, now seen corresponding path program 1 times [2020-08-22 17:05:57,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:05:57,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892989212] [2020-08-22 17:05:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:05:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,797 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:05:57,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:05:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:05:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:05:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:05:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:05:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:05:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:05:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:57,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:05:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:58,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:05:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:58,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:05:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:58,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:05:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:58,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:05:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:05:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:05:58,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892989212] [2020-08-22 17:05:58,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:05:58,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:05:58,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278238541] [2020-08-22 17:05:58,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:05:58,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:05:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:05:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:05:58,040 INFO L87 Difference]: Start difference. First operand 947 states and 1295 transitions. Second operand 13 states. [2020-08-22 17:05:59,601 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:05:59,745 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:00,496 INFO L93 Difference]: Finished difference Result 1738 states and 2408 transitions. [2020-08-22 17:06:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:00,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2020-08-22 17:06:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:00,504 INFO L225 Difference]: With dead ends: 1738 [2020-08-22 17:06:00,504 INFO L226 Difference]: Without dead ends: 963 [2020-08-22 17:06:00,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2020-08-22 17:06:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2020-08-22 17:06:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-08-22 17:06:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1307 transitions. [2020-08-22 17:06:00,619 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1307 transitions. Word has length 124 [2020-08-22 17:06:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:00,619 INFO L479 AbstractCegarLoop]: Abstraction has 963 states and 1307 transitions. [2020-08-22 17:06:00,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1307 transitions. [2020-08-22 17:06:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-08-22 17:06:00,622 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:00,623 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-08-22 17:06:00,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 17:06:00,623 INFO L427 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1471497757, now seen corresponding path program 1 times [2020-08-22 17:06:00,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:00,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454168832] [2020-08-22 17:06:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,872 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:00,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:00,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 17:06:01,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454168832] [2020-08-22 17:06:01,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:01,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:06:01,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448253628] [2020-08-22 17:06:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:06:01,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:06:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:06:01,179 INFO L87 Difference]: Start difference. First operand 963 states and 1307 transitions. Second operand 18 states. [2020-08-22 17:06:01,481 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 133 [2020-08-22 17:06:01,656 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:02,083 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:03,454 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:03,607 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:03,755 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:05,364 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:05,523 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:07,692 INFO L93 Difference]: Finished difference Result 2594 states and 3626 transitions. [2020-08-22 17:06:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 17:06:07,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2020-08-22 17:06:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:07,704 INFO L225 Difference]: With dead ends: 2594 [2020-08-22 17:06:07,704 INFO L226 Difference]: Without dead ends: 1791 [2020-08-22 17:06:07,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2020-08-22 17:06:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2020-08-22 17:06:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1549. [2020-08-22 17:06:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2020-08-22 17:06:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2123 transitions. [2020-08-22 17:06:07,877 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2123 transitions. Word has length 124 [2020-08-22 17:06:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:07,878 INFO L479 AbstractCegarLoop]: Abstraction has 1549 states and 2123 transitions. [2020-08-22 17:06:07,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:06:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2123 transitions. [2020-08-22 17:06:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-08-22 17:06:07,881 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:07,881 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-08-22 17:06:07,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 17:06:07,882 INFO L427 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1891846081, now seen corresponding path program 1 times [2020-08-22 17:06:07,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:07,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239609006] [2020-08-22 17:06:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,063 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:08,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 17:06:08,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239609006] [2020-08-22 17:06:08,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:08,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:08,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464290858] [2020-08-22 17:06:08,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:08,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:08,323 INFO L87 Difference]: Start difference. First operand 1549 states and 2123 transitions. Second operand 13 states. [2020-08-22 17:06:09,811 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:09,947 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:10,922 INFO L93 Difference]: Finished difference Result 2816 states and 3937 transitions. [2020-08-22 17:06:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:10,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2020-08-22 17:06:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:10,936 INFO L225 Difference]: With dead ends: 2816 [2020-08-22 17:06:10,936 INFO L226 Difference]: Without dead ends: 1589 [2020-08-22 17:06:10,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2020-08-22 17:06:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1589. [2020-08-22 17:06:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-08-22 17:06:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2155 transitions. [2020-08-22 17:06:11,231 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2155 transitions. Word has length 131 [2020-08-22 17:06:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:11,234 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 2155 transitions. [2020-08-22 17:06:11,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2155 transitions. [2020-08-22 17:06:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 17:06:11,239 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:11,240 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 17:06:11,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 17:06:11,240 INFO L427 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1235243833, now seen corresponding path program 1 times [2020-08-22 17:06:11,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:11,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510182971] [2020-08-22 17:06:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,575 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:11,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 17:06:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-08-22 17:06:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2020-08-22 17:06:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-08-22 17:06:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-08-22 17:06:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 17:06:11,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510182971] [2020-08-22 17:06:11,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:11,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:06:11,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544920416] [2020-08-22 17:06:11,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:06:11,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:06:11,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:06:11,942 INFO L87 Difference]: Start difference. First operand 1589 states and 2155 transitions. Second operand 12 states. [2020-08-22 17:06:12,171 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:13,690 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 17:06:13,857 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-08-22 17:06:14,228 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-08-22 17:06:15,469 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-08-22 17:06:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:17,250 INFO L93 Difference]: Finished difference Result 2536 states and 3455 transitions. [2020-08-22 17:06:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 17:06:17,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-08-22 17:06:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:17,263 INFO L225 Difference]: With dead ends: 2536 [2020-08-22 17:06:17,264 INFO L226 Difference]: Without dead ends: 1600 [2020-08-22 17:06:17,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-08-22 17:06:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-08-22 17:06:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1594. [2020-08-22 17:06:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2020-08-22 17:06:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2156 transitions. [2020-08-22 17:06:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2156 transitions. Word has length 140 [2020-08-22 17:06:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:17,546 INFO L479 AbstractCegarLoop]: Abstraction has 1594 states and 2156 transitions. [2020-08-22 17:06:17,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:06:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2156 transitions. [2020-08-22 17:06:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-08-22 17:06:17,551 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:17,552 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-08-22 17:06:17,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 17:06:17,552 INFO L427 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1423528137, now seen corresponding path program 1 times [2020-08-22 17:06:17,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:17,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875787597] [2020-08-22 17:06:17,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,830 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:17,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:17,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-08-22 17:06:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-08-22 17:06:18,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875787597] [2020-08-22 17:06:18,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:18,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:18,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14667524] [2020-08-22 17:06:18,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:18,071 INFO L87 Difference]: Start difference. First operand 1594 states and 2156 transitions. Second operand 13 states. [2020-08-22 17:06:19,626 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:19,762 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:20,568 INFO L93 Difference]: Finished difference Result 2881 states and 3946 transitions. [2020-08-22 17:06:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:20,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-08-22 17:06:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:20,576 INFO L225 Difference]: With dead ends: 2881 [2020-08-22 17:06:20,577 INFO L226 Difference]: Without dead ends: 1626 [2020-08-22 17:06:20,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2020-08-22 17:06:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2020-08-22 17:06:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-08-22 17:06:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2180 transitions. [2020-08-22 17:06:20,781 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2180 transitions. Word has length 139 [2020-08-22 17:06:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:20,782 INFO L479 AbstractCegarLoop]: Abstraction has 1626 states and 2180 transitions. [2020-08-22 17:06:20,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2180 transitions. [2020-08-22 17:06:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-08-22 17:06:20,787 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:20,787 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-08-22 17:06:20,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-22 17:06:20,788 INFO L427 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1915689711, now seen corresponding path program 1 times [2020-08-22 17:06:20,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:20,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719083653] [2020-08-22 17:06:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:20,998 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:20,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-22 17:06:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 17:06:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-08-22 17:06:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:06:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-08-22 17:06:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-08-22 17:06:21,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719083653] [2020-08-22 17:06:21,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:21,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 17:06:21,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403293301] [2020-08-22 17:06:21,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 17:06:21,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:21,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 17:06:21,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-08-22 17:06:21,230 INFO L87 Difference]: Start difference. First operand 1626 states and 2180 transitions. Second operand 13 states. [2020-08-22 17:06:23,110 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:23,250 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-08-22 17:06:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:23,765 INFO L93 Difference]: Finished difference Result 2789 states and 3750 transitions. [2020-08-22 17:06:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 17:06:23,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2020-08-22 17:06:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:23,774 INFO L225 Difference]: With dead ends: 2789 [2020-08-22 17:06:23,774 INFO L226 Difference]: Without dead ends: 1674 [2020-08-22 17:06:23,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-08-22 17:06:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2020-08-22 17:06:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2020-08-22 17:06:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2220 transitions. [2020-08-22 17:06:23,970 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2220 transitions. Word has length 140 [2020-08-22 17:06:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:23,970 INFO L479 AbstractCegarLoop]: Abstraction has 1674 states and 2220 transitions. [2020-08-22 17:06:23,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 17:06:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2220 transitions. [2020-08-22 17:06:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:23,973 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:23,974 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-08-22 17:06:23,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-22 17:06:23,974 INFO L427 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1178541992, now seen corresponding path program 1 times [2020-08-22 17:06:23,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:23,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78063332] [2020-08-22 17:06:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,252 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:24,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:24,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78063332] [2020-08-22 17:06:24,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992557624] [2020-08-22 17:06:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-08-22 17:06:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:24,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 17:06:24,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:25,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-08-22 17:06:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-08-22 17:06:25,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:06:25,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-08-22 17:06:25,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204062134] [2020-08-22 17:06:25,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:06:25,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:06:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:06:25,098 INFO L87 Difference]: Start difference. First operand 1674 states and 2220 transitions. Second operand 6 states. [2020-08-22 17:06:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:26,169 INFO L93 Difference]: Finished difference Result 3335 states and 4426 transitions. [2020-08-22 17:06:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 17:06:26,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-08-22 17:06:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:26,183 INFO L225 Difference]: With dead ends: 3335 [2020-08-22 17:06:26,184 INFO L226 Difference]: Without dead ends: 1699 [2020-08-22 17:06:26,192 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-08-22 17:06:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2020-08-22 17:06:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2020-08-22 17:06:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-22 17:06:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2238 transitions. [2020-08-22 17:06:26,441 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2238 transitions. Word has length 145 [2020-08-22 17:06:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:26,442 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2238 transitions. [2020-08-22 17:06:26,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:06:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2238 transitions. [2020-08-22 17:06:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:26,448 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:26,448 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-08-22 17:06:26,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-08-22 17:06:26,661 INFO L427 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 794623386, now seen corresponding path program 1 times [2020-08-22 17:06:26,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:26,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736638090] [2020-08-22 17:06:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,893 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:26,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:26,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:27,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736638090] [2020-08-22 17:06:27,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283298033] [2020-08-22 17:06:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-08-22 17:06:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:27,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 9 conjunts are in the unsatisfiable core [2020-08-22 17:06:27,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 17:06:28,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:06:28,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2020-08-22 17:06:28,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006166100] [2020-08-22 17:06:28,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:06:28,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:28,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:06:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:06:28,005 INFO L87 Difference]: Start difference. First operand 1696 states and 2238 transitions. Second operand 6 states. [2020-08-22 17:06:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:29,423 INFO L93 Difference]: Finished difference Result 3209 states and 4250 transitions. [2020-08-22 17:06:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 17:06:29,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-08-22 17:06:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:29,436 INFO L225 Difference]: With dead ends: 3209 [2020-08-22 17:06:29,436 INFO L226 Difference]: Without dead ends: 1720 [2020-08-22 17:06:29,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2020-08-22 17:06:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2020-08-22 17:06:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1696. [2020-08-22 17:06:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-22 17:06:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2234 transitions. [2020-08-22 17:06:29,767 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2234 transitions. Word has length 145 [2020-08-22 17:06:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:29,767 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2234 transitions. [2020-08-22 17:06:29,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:06:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2234 transitions. [2020-08-22 17:06:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-08-22 17:06:29,774 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:29,774 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-08-22 17:06:29,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-08-22 17:06:29,987 INFO L427 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 265098833, now seen corresponding path program 1 times [2020-08-22 17:06:29,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:29,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24762552] [2020-08-22 17:06:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,172 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:30,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 17:06:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 17:06:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-08-22 17:06:30,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24762552] [2020-08-22 17:06:30,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:30,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-08-22 17:06:30,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572986351] [2020-08-22 17:06:30,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:06:30,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:06:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:06:30,498 INFO L87 Difference]: Start difference. First operand 1696 states and 2234 transitions. Second operand 16 states. [2020-08-22 17:06:30,649 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:31,010 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:34,672 INFO L93 Difference]: Finished difference Result 3221 states and 4270 transitions. [2020-08-22 17:06:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 17:06:34,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 145 [2020-08-22 17:06:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:34,682 INFO L225 Difference]: With dead ends: 3221 [2020-08-22 17:06:34,683 INFO L226 Difference]: Without dead ends: 1708 [2020-08-22 17:06:34,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:06:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2020-08-22 17:06:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1696. [2020-08-22 17:06:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2020-08-22 17:06:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2226 transitions. [2020-08-22 17:06:34,887 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2226 transitions. Word has length 145 [2020-08-22 17:06:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:34,890 INFO L479 AbstractCegarLoop]: Abstraction has 1696 states and 2226 transitions. [2020-08-22 17:06:34,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:06:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2226 transitions. [2020-08-22 17:06:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-08-22 17:06:34,894 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:34,895 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-08-22 17:06:34,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-08-22 17:06:34,895 INFO L427 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash 527509504, now seen corresponding path program 1 times [2020-08-22 17:06:34,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:34,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641003282] [2020-08-22 17:06:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,110 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:35,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-08-22 17:06:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:06:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-08-22 17:06:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:06:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:06:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:35,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641003282] [2020-08-22 17:06:35,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017543857] [2020-08-22 17:06:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-08-22 17:06:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:35,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 7 conjunts are in the unsatisfiable core [2020-08-22 17:06:35,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 17:06:35,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:06:35,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2020-08-22 17:06:35,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609086784] [2020-08-22 17:06:35,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 17:06:35,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 17:06:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:35,763 INFO L87 Difference]: Start difference. First operand 1696 states and 2226 transitions. Second operand 5 states. [2020-08-22 17:06:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:35,920 INFO L93 Difference]: Finished difference Result 2417 states and 3178 transitions. [2020-08-22 17:06:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 17:06:35,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2020-08-22 17:06:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:35,928 INFO L225 Difference]: With dead ends: 2417 [2020-08-22 17:06:35,928 INFO L226 Difference]: Without dead ends: 1336 [2020-08-22 17:06:35,933 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2020-08-22 17:06:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2020-08-22 17:06:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2020-08-22 17:06:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2020-08-22 17:06:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1752 transitions. [2020-08-22 17:06:36,142 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1752 transitions. Word has length 146 [2020-08-22 17:06:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:36,143 INFO L479 AbstractCegarLoop]: Abstraction has 1336 states and 1752 transitions. [2020-08-22 17:06:36,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 17:06:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1752 transitions. [2020-08-22 17:06:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-08-22 17:06:36,148 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:36,148 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-08-22 17:06:36,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:06:36,364 INFO L427 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1761290840, now seen corresponding path program 1 times [2020-08-22 17:06:36,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:36,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212632876] [2020-08-22 17:06:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,648 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:36,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:06:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:06:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:06:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:06:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:06:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:06:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:06:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 17:06:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:36,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 17:06:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 17:06:37,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212632876] [2020-08-22 17:06:37,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961861117] [2020-08-22 17:06:37,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-08-22 17:06:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:37,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjunts are in the unsatisfiable core [2020-08-22 17:06:37,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:06:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:06:37,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 17:06:37,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 22 [2020-08-22 17:06:37,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668124876] [2020-08-22 17:06:37,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-22 17:06:37,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-22 17:06:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-08-22 17:06:37,444 INFO L87 Difference]: Start difference. First operand 1336 states and 1752 transitions. Second operand 22 states. [2020-08-22 17:06:37,677 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:06:37,851 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:38,833 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-08-22 17:06:40,234 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:40,408 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:40,572 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:42,401 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:42,559 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:42,718 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:42,889 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:06:43,067 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-08-22 17:06:43,274 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:06:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:47,196 INFO L93 Difference]: Finished difference Result 3170 states and 4169 transitions. [2020-08-22 17:06:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-08-22 17:06:47,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2020-08-22 17:06:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:47,208 INFO L225 Difference]: With dead ends: 3170 [2020-08-22 17:06:47,208 INFO L226 Difference]: Without dead ends: 2140 [2020-08-22 17:06:47,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=564, Invalid=2192, Unknown=0, NotChecked=0, Total=2756 [2020-08-22 17:06:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-08-22 17:06:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2032. [2020-08-22 17:06:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2020-08-22 17:06:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2673 transitions. [2020-08-22 17:06:47,436 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2673 transitions. Word has length 146 [2020-08-22 17:06:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:47,437 INFO L479 AbstractCegarLoop]: Abstraction has 2032 states and 2673 transitions. [2020-08-22 17:06:47,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-22 17:06:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2673 transitions. [2020-08-22 17:06:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-08-22 17:06:47,439 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:47,440 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-08-22 17:06:47,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 17:06:47,653 INFO L427 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -647886319, now seen corresponding path program 1 times [2020-08-22 17:06:47,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:47,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291992687] [2020-08-22 17:06:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,812 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:47,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:47,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:06:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:06:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:06:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:06:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:06:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:06:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:06:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:06:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-22 17:06:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 17:06:48,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291992687] [2020-08-22 17:06:48,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:48,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-22 17:06:48,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985754692] [2020-08-22 17:06:48,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 17:06:48,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 17:06:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:06:48,202 INFO L87 Difference]: Start difference. First operand 2032 states and 2673 transitions. Second operand 14 states. [2020-08-22 17:06:48,380 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-08-22 17:06:49,381 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-08-22 17:06:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:06:54,801 INFO L93 Difference]: Finished difference Result 6362 states and 8425 transitions. [2020-08-22 17:06:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 17:06:54,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2020-08-22 17:06:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:06:54,822 INFO L225 Difference]: With dead ends: 6362 [2020-08-22 17:06:54,823 INFO L226 Difference]: Without dead ends: 4623 [2020-08-22 17:06:54,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2020-08-22 17:06:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-08-22 17:06:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4360. [2020-08-22 17:06:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2020-08-22 17:06:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 5721 transitions. [2020-08-22 17:06:55,262 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 5721 transitions. Word has length 147 [2020-08-22 17:06:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:06:55,262 INFO L479 AbstractCegarLoop]: Abstraction has 4360 states and 5721 transitions. [2020-08-22 17:06:55,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 17:06:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 5721 transitions. [2020-08-22 17:06:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-08-22 17:06:55,266 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:06:55,266 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-08-22 17:06:55,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-08-22 17:06:55,266 INFO L427 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:06:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:06:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1522611423, now seen corresponding path program 1 times [2020-08-22 17:06:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:06:55,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326373248] [2020-08-22 17:06:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:06:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,467 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:06:55,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:06:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:06:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:06:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:06:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:06:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 17:06:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:06:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:06:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:06:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:06:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:06:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 17:06:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 17:06:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 17:06:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-08-22 17:06:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 17:06:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:06:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-08-22 17:06:55,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326373248] [2020-08-22 17:06:55,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:06:55,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:06:55,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373252873] [2020-08-22 17:06:55,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:06:55,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:06:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:06:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:06:55,890 INFO L87 Difference]: Start difference. First operand 4360 states and 5721 transitions. Second operand 18 states. [2020-08-22 17:06:56,285 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 140 [2020-08-22 17:06:56,479 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:06:57,707 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-08-22 17:06:58,022 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2020-08-22 17:06:59,231 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-08-22 17:07:00,418 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:00,624 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:00,836 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:01,045 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:01,251 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2020-08-22 17:07:01,450 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2020-08-22 17:07:01,801 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-08-22 17:07:02,781 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2020-08-22 17:07:03,030 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-08-22 17:07:03,635 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:05,506 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-08-22 17:07:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:07,903 INFO L93 Difference]: Finished difference Result 8524 states and 11152 transitions. [2020-08-22 17:07:07,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 17:07:07,904 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2020-08-22 17:07:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:07,923 INFO L225 Difference]: With dead ends: 8524 [2020-08-22 17:07:07,923 INFO L226 Difference]: Without dead ends: 5300 [2020-08-22 17:07:07,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=576, Invalid=1974, Unknown=0, NotChecked=0, Total=2550 [2020-08-22 17:07:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-08-22 17:07:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4471. [2020-08-22 17:07:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2020-08-22 17:07:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 5825 transitions. [2020-08-22 17:07:08,383 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 5825 transitions. Word has length 148 [2020-08-22 17:07:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:08,383 INFO L479 AbstractCegarLoop]: Abstraction has 4471 states and 5825 transitions. [2020-08-22 17:07:08,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:07:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 5825 transitions. [2020-08-22 17:07:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-08-22 17:07:08,387 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:08,387 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-08-22 17:07:08,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-08-22 17:07:08,388 INFO L427 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1902780761, now seen corresponding path program 1 times [2020-08-22 17:07:08,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:08,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267139020] [2020-08-22 17:07:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,604 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-08-22 17:07:08,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:07:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:07:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:07:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 17:07:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 17:07:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 17:07:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:07:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:07:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:07:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 17:07:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-22 17:07:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-08-22 17:07:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-22 17:07:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 17:07:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:07:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:08,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-22 17:07:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:07:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-08-22 17:07:09,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267139020] [2020-08-22 17:07:09,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:07:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-08-22 17:07:09,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747121544] [2020-08-22 17:07:09,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 17:07:09,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:07:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 17:07:09,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2020-08-22 17:07:09,008 INFO L87 Difference]: Start difference. First operand 4471 states and 5825 transitions. Second operand 18 states. [2020-08-22 17:07:09,226 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:09,409 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-08-22 17:07:11,278 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-08-22 17:07:13,118 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:13,296 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:13,484 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:13,680 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2020-08-22 17:07:13,878 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:14,072 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-08-22 17:07:16,642 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-08-22 17:07:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:07:19,919 INFO L93 Difference]: Finished difference Result 7727 states and 10193 transitions. [2020-08-22 17:07:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-22 17:07:19,920 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 149 [2020-08-22 17:07:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:07:19,941 INFO L225 Difference]: With dead ends: 7727 [2020-08-22 17:07:19,942 INFO L226 Difference]: Without dead ends: 4615 [2020-08-22 17:07:19,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2020-08-22 17:07:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2020-08-22 17:07:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4221. [2020-08-22 17:07:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4221 states. [2020-08-22 17:07:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 5483 transitions. [2020-08-22 17:07:20,353 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 5483 transitions. Word has length 149 [2020-08-22 17:07:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:07:20,353 INFO L479 AbstractCegarLoop]: Abstraction has 4221 states and 5483 transitions. [2020-08-22 17:07:20,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 17:07:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 5483 transitions. [2020-08-22 17:07:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 17:07:20,356 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:07:20,357 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-08-22 17:07:20,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-08-22 17:07:20,357 INFO L427 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:07:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:07:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1998716393, now seen corresponding path program 1 times [2020-08-22 17:07:20,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:07:20,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95907951] [2020-08-22 17:07:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:07:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:07:20,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:07:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 17:07:20,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 17:07:20,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 17:07:20,540 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 17:07:20,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-08-22 17:07:20,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:07:20 BoogieIcfgContainer [2020-08-22 17:07:20,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 17:07:20,770 INFO L168 Benchmark]: Toolchain (without parser) took 122143.43 ms. Allocated memory was 139.5 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.0 MB in the beginning and 116.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,771 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.11 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 172.1 MB in the end (delta: -70.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,772 INFO L168 Benchmark]: Boogie Preprocessor took 72.06 ms. Allocated memory is still 201.9 MB. Free memory was 172.1 MB in the beginning and 169.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,773 INFO L168 Benchmark]: RCFGBuilder took 905.23 ms. Allocated memory is still 201.9 MB. Free memory was 169.4 MB in the beginning and 105.9 MB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,773 INFO L168 Benchmark]: TraceAbstraction took 120573.42 ms. Allocated memory was 201.9 MB in the beginning and 1.2 GB in the end (delta: 999.8 MB). Free memory was 105.3 MB in the beginning and 116.0 MB in the end (delta: -10.7 MB). Peak memory consumption was 989.1 MB. Max. memory is 7.1 GB. [2020-08-22 17:07:20,776 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.11 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 172.1 MB in the end (delta: -70.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.06 ms. Allocated memory is still 201.9 MB. Free memory was 172.1 MB in the beginning and 169.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 905.23 ms. Allocated memory is still 201.9 MB. Free memory was 169.4 MB in the beginning and 105.9 MB in the end (delta: 63.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120573.42 ms. Allocated memory was 201.9 MB in the beginning and 1.2 GB in the end (delta: 999.8 MB). Free memory was 105.3 MB in the beginning and 116.0 MB in the end (delta: -10.7 MB). Peak memory consumption was 989.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 665]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t cs1 ; [L71] int8_t cs1_old ; [L72] int8_t cs1_new ; [L73] port_t cs2 ; [L74] int8_t cs2_old ; [L75] int8_t cs2_new ; [L76] port_t s1s2 ; [L77] int8_t s1s2_old ; [L78] int8_t s1s2_new ; [L79] port_t s1s1 ; [L80] int8_t s1s1_old ; [L81] int8_t s1s1_new ; [L82] port_t s2s1 ; [L83] int8_t s2s1_old ; [L84] int8_t s2s1_new ; [L85] port_t s2s2 ; [L86] int8_t s2s2_old ; [L87] int8_t s2s2_new ; [L88] port_t s1p ; [L89] int8_t s1p_old ; [L90] int8_t s1p_new ; [L91] port_t s2p ; [L92] int8_t s2p_old ; [L93] int8_t s2p_new ; [L96] _Bool side1Failed ; [L97] _Bool side2Failed ; [L98] msg_t side1_written ; [L99] msg_t side2_written ; [L105] static _Bool side1Failed_History_0 ; [L106] static _Bool side1Failed_History_1 ; [L107] static _Bool side1Failed_History_2 ; [L108] static _Bool side2Failed_History_0 ; [L109] static _Bool side2Failed_History_1 ; [L110] static _Bool side2Failed_History_2 ; [L111] static int8_t active_side_History_0 ; [L112] static int8_t active_side_History_1 ; [L113] static int8_t active_side_History_2 ; [L114] static msg_t manual_selection_History_0 ; [L115] static msg_t manual_selection_History_1 ; [L116] static msg_t manual_selection_History_2 ; [L466] void (*nodes[4])(void) = { & Console_task_each_pals_period, & Side1_activestandby_task_each_pals_period, & Side2_activestandby_task_each_pals_period, & Pendulum_prism_task_each_pals_period}; VAL [\old(active_side_History_0)=43, \old(active_side_History_1)=31, \old(active_side_History_2)=19, \old(cs1)=25, \old(cs1_new)=16, \old(cs1_old)=37, \old(cs2)=40, \old(cs2_new)=15, \old(cs2_old)=33, \old(manual_selection_History_0)=39, \old(manual_selection_History_1)=28, \old(manual_selection_History_2)=22, \old(nomsg)=23, \old(s1p)=41, \old(s1p_new)=12, \old(s1p_old)=7, \old(s1s1)=8, \old(s1s1_new)=44, \old(s1s1_old)=18, \old(s1s2)=4, \old(s1s2_new)=42, \old(s1s2_old)=13, \old(s2p)=27, \old(s2p_new)=29, \old(s2p_old)=24, \old(s2s1)=32, \old(s2s1_new)=20, \old(s2s1_old)=38, \old(s2s2)=21, \old(s2s2_new)=36, \old(s2s2_old)=45, \old(side1_written)=11, \old(side1Failed)=9, \old(side1Failed_History_0)=35, \old(side1Failed_History_1)=46, \old(side1Failed_History_2)=10, \old(side2_written)=5, \old(side2Failed)=34, \old(side2Failed_History_0)=6, \old(side2Failed_History_1)=14, \old(side2Failed_History_2)=30, active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L588] int c1 ; [L589] int i2 ; [L592] c1 = 0 [L593] side1Failed = __VERIFIER_nondet_bool() [L594] side2Failed = __VERIFIER_nondet_bool() [L595] side1_written = __VERIFIER_nondet_char() [L596] side2_written = __VERIFIER_nondet_char() [L597] side1Failed_History_0 = __VERIFIER_nondet_bool() [L598] side1Failed_History_1 = __VERIFIER_nondet_bool() [L599] side1Failed_History_2 = __VERIFIER_nondet_bool() [L600] side2Failed_History_0 = __VERIFIER_nondet_bool() [L601] side2Failed_History_1 = __VERIFIER_nondet_bool() [L602] side2Failed_History_2 = __VERIFIER_nondet_bool() [L603] active_side_History_0 = __VERIFIER_nondet_char() [L604] active_side_History_1 = __VERIFIER_nondet_char() [L605] active_side_History_2 = __VERIFIER_nondet_char() [L606] manual_selection_History_0 = __VERIFIER_nondet_char() [L607] manual_selection_History_1 = __VERIFIER_nondet_char() [L608] manual_selection_History_2 = __VERIFIER_nondet_char() [L609] CALL, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L242] COND FALSE !((int )side1Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L245] COND FALSE !((int )side2Failed_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L248] COND FALSE !((int )active_side_History_0 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L251] COND FALSE !((int )manual_selection_History_0 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L254] COND FALSE !((int )side1Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L257] COND FALSE !((int )side2Failed_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L260] COND FALSE !((int )active_side_History_1 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L263] COND FALSE !((int )manual_selection_History_1 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L266] COND FALSE !((int )side1Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L269] COND FALSE !((int )side2Failed_History_2 != 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L272] COND FALSE !((int )active_side_History_2 != -2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L275] COND FALSE !((int )manual_selection_History_2 != 0) [L278] return (1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] RET, EXPR init() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, init()=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] i2 = init() [L610] CALL assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L610] RET assume_abort_if_not(i2) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L611] cs1_old = nomsg [L612] cs1_new = nomsg [L613] cs2_old = nomsg [L614] cs2_new = nomsg [L615] s1s2_old = nomsg [L616] s1s2_new = nomsg [L617] s1s1_old = nomsg [L618] s1s1_new = nomsg [L619] s2s1_old = nomsg [L620] s2s1_new = nomsg [L621] s2s2_old = nomsg [L622] s2s2_new = nomsg [L623] s1p_old = nomsg [L624] s1p_new = nomsg [L625] s2p_old = nomsg [L626] s2p_new = nomsg [L627] i2 = 0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L628] COND TRUE i2 < 10 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L630] CALL Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L296] msg_t manual_selection ; [L297] char tmp ; [L300] tmp = __VERIFIER_nondet_char() [L301] manual_selection = tmp VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L302] CALL write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] manual_selection_History_2 = manual_selection_History_1 [L213] manual_selection_History_1 = manual_selection_History_0 [L214] manual_selection_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L302] RET write_manual_selection_history(manual_selection) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L303] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L304] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L304] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L305] manual_selection = (msg_t )0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=-1, \old(cs1_old)=0, \old(cs2_new)=-1, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L630] RET Console_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] CALL Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=17, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L311] int8_t side1 ; [L312] int8_t side2 ; [L313] msg_t manual_selection ; [L314] int8_t next_state ; [L317] side1 = nomsg [L318] side2 = nomsg [L319] manual_selection = (msg_t )0 [L320] side1Failed = __VERIFIER_nondet_bool() [L321] CALL write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L122] side1Failed_History_2 = side1Failed_History_1 [L123] side1Failed_History_1 = side1Failed_History_0 [L124] side1Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L321] RET write_side1_failed_history(side1Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L322] COND FALSE !(\read(side1Failed)) [L329] side1 = s1s1_old [L330] s1s1_old = nomsg [L331] side2 = s2s1_old [L332] s2s1_old = nomsg [L333] manual_selection = cs1_old [L334] cs1_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L335] COND TRUE (int )side1 == (int )side2 [L336] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L359] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L360] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L360] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L361] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-3, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L361] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L362] side1_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=-1, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=-1, \old(s1p_old)=0, \old(s1s1_new)=-1, \old(s1s1_old)=-1, \old(s1s2_new)=-1, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=-1, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=-3, \old(side1Failed)=17, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L631] RET Side1_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] CALL Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=26, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L368] int8_t side1 ; [L369] int8_t side2 ; [L370] msg_t manual_selection ; [L371] int8_t next_state ; [L374] side1 = nomsg [L375] side2 = nomsg [L376] manual_selection = (msg_t )0 [L377] side2Failed = __VERIFIER_nondet_bool() [L378] CALL write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L152] side2Failed_History_2 = side2Failed_History_1 [L153] side2Failed_History_1 = side2Failed_History_0 [L154] side2Failed_History_0 = val VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L378] RET write_side2_failed_history(side2Failed) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L379] COND FALSE !(\read(side2Failed)) [L386] side1 = s1s2_old [L387] s1s2_old = nomsg [L388] side2 = s2s2_old [L389] s2s2_old = nomsg [L390] manual_selection = cs2_old [L391] cs2_old = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L392] COND TRUE (int )side1 == (int )side2 [L393] next_state = (int8_t )1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L416] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L417] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L417] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L418] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L418] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L419] side2_written = next_state VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=-1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=-1, \old(s2p_new)=-1, \old(s2p_old)=0, \old(s2s1_new)=-1, \old(s2s1_old)=0, \old(s2s2_new)=-1, \old(s2s2_old)=-1, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=26, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L632] RET Side2_activestandby_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L633] CALL Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L425] int8_t active_side ; [L426] int8_t tmp ; [L427] int8_t side1 ; [L428] int8_t side2 ; VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L193] COND TRUE (int )index == 0 [L194] return (active_side_History_0); VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] RET, EXPR read_active_side_history((unsigned char)0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L431] tmp = read_active_side_history((unsigned char)0) [L432] active_side = tmp [L433] side1 = nomsg [L434] side2 = nomsg [L435] side1 = s1p_old [L436] s1p_old = nomsg [L437] side2 = s2p_old [L438] s2p_old = nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L439] COND FALSE !((int )side1 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L442] COND FALSE !((int )side2 == 1) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L445] COND FALSE !((int )side1 == 0) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L453] COND TRUE (int )side1 == (int )nomsg VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L454] COND FALSE !((int )side2 == 0) [L457] active_side = (int8_t )0 VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L462] CALL write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L182] active_side_History_2 = active_side_History_1 [L183] active_side_History_1 = active_side_History_0 [L184] active_side_History_0 = val VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L462] RET write_active_side_history(active_side) VAL [\old(active_side_History_0)=-2, \old(active_side_History_1)=-2, \old(active_side_History_2)=-2, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=-1, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=-1, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L633] RET Pendulum_prism_task_each_pals_period() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L634] cs1_old = cs1_new [L635] cs1_new = nomsg [L636] cs2_old = cs2_new [L637] cs2_new = nomsg [L638] s1s2_old = s1s2_new [L639] s1s2_new = nomsg [L640] s1s1_old = s1s1_new [L641] s1s1_new = nomsg [L642] s2s1_old = s2s1_new [L643] s2s1_new = nomsg [L644] s2s2_old = s2s2_new [L645] s2s2_new = nomsg [L646] s1p_old = s1p_new [L647] s1p_new = nomsg [L648] s2p_old = s2p_new [L649] s2p_new = nomsg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] CALL, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L469] int tmp ; [L470] msg_t tmp___0 ; [L471] _Bool tmp___1 ; [L472] _Bool tmp___2 ; [L473] _Bool tmp___3 ; [L474] _Bool tmp___4 ; [L475] int8_t tmp___5 ; [L476] _Bool tmp___6 ; [L477] _Bool tmp___7 ; [L478] _Bool tmp___8 ; [L479] int8_t tmp___9 ; [L480] _Bool tmp___10 ; [L481] _Bool tmp___11 ; [L482] _Bool tmp___12 ; [L483] msg_t tmp___13 ; [L484] _Bool tmp___14 ; [L485] _Bool tmp___15 ; [L486] _Bool tmp___16 ; [L487] _Bool tmp___17 ; [L488] int8_t tmp___18 ; [L489] int8_t tmp___19 ; [L490] int8_t tmp___20 ; VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L493] COND TRUE ! side1Failed [L494] tmp = 1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L501] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L103] COND FALSE !(!cond) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cond)=1, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L501] RET assume_abort_if_not((_Bool )tmp) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L223] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L226] COND TRUE (int )index == 1 [L227] return (manual_selection_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L502] tmp___0 = read_manual_selection_history((unsigned char)1) [L503] COND TRUE ! tmp___0 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L136] COND TRUE (int )index == 1 [L137] return (side1Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L504] tmp___1 = read_side1_failed_history((unsigned char)1) [L505] COND TRUE ! tmp___1 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L133] COND TRUE (int )index == 0 [L134] return (side1Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L506] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L506] tmp___2 = read_side1_failed_history((unsigned char)0) [L507] COND TRUE ! tmp___2 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND FALSE !((int )index == 0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L166] COND TRUE (int )index == 1 [L167] return (side2Failed_History_1); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=1, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L508] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L508] tmp___3 = read_side2_failed_history((unsigned char)1) [L509] COND TRUE ! tmp___3 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L163] COND TRUE (int )index == 0 [L164] return (side2Failed_History_0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(index)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L510] tmp___4 = read_side2_failed_history((unsigned char)0) [L511] COND TRUE ! tmp___4 VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L512] COND FALSE !(! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L517] COND FALSE !(! (! ((int )side1_written == 0))) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L522] COND TRUE ! (! ((int )side1_written == 1)) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L523] COND TRUE ! ((int )side2_written == 0) [L524] return (0); VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L650] RET, EXPR check() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=0, check()=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L650] c1 = check() [L651] CALL assert(c1) VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L663] COND TRUE ! arg VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L665] __VERIFIER_error() VAL [\old(active_side_History_0)=0, \old(active_side_History_1)=0, \old(active_side_History_2)=0, \old(arg)=0, \old(cs1_new)=0, \old(cs1_old)=0, \old(cs2_new)=0, \old(cs2_old)=0, \old(manual_selection_History_0)=0, \old(manual_selection_History_1)=0, \old(manual_selection_History_2)=0, \old(s1p_new)=0, \old(s1p_old)=0, \old(s1s1_new)=0, \old(s1s1_old)=0, \old(s1s2_new)=0, \old(s1s2_old)=0, \old(s2p_new)=0, \old(s2p_old)=0, \old(s2s1_new)=0, \old(s2s1_old)=0, \old(s2s2_new)=0, \old(s2s2_old)=0, \old(side1_written)=0, \old(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side2_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 243 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 120.2s, OverallIterations: 25, TraceHistogramMax: 3, AutomataDifference: 99.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7312 SDtfs, 31037 SDslu, 4197 SDs, 0 SdLazy, 36058 SolverSat, 11921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1953 GetRequests, 1284 SyntacticMatches, 14 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3878 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4471occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 1938 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 3682 NumberOfCodeBlocks, 3682 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1626397 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4072 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 231/243 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...