/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 04:56:04,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 04:56:04,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 04:56:04,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 04:56:04,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 04:56:04,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 04:56:04,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 04:56:04,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 04:56:04,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 04:56:04,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 04:56:04,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 04:56:04,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 04:56:04,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 04:56:04,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 04:56:04,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 04:56:04,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 04:56:04,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 04:56:04,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 04:56:04,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 04:56:04,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 04:56:04,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 04:56:04,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 04:56:04,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 04:56:04,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 04:56:04,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 04:56:04,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 04:56:04,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 04:56:04,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 04:56:04,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 04:56:04,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 04:56:04,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 04:56:04,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 04:56:04,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 04:56:04,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 04:56:04,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 04:56:04,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 04:56:04,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 04:56:04,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 04:56:04,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 04:56:04,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 04:56:04,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 04:56:04,448 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 [2023-04-02 04:56:04,465 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 04:56:04,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 04:56:04,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 04:56:04,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 04:56:04,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 04:56:04,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 04:56:04,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 04:56:04,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 04:56:04,467 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 04:56:04,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 04:56:04,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 04:56:04,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:56:04,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 04:56:04,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 04:56:04,470 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 04:56:04,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 04:56:04,470 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 04:56:04,470 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 04:56:04,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 04:56:04,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 04:56:04,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 04:56:04,652 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 04:56:04,653 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 04:56:04,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-04-02 04:56:05,642 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 04:56:05,849 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 04:56:05,850 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-04-02 04:56:05,856 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d680e29e/c8855fbded4742b48d01550b7aee1c9f/FLAG3ef2d49bb [2023-04-02 04:56:05,866 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d680e29e/c8855fbded4742b48d01550b7aee1c9f [2023-04-02 04:56:05,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 04:56:05,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 04:56:05,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 04:56:05,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 04:56:05,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 04:56:05,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:56:05" (1/1) ... [2023-04-02 04:56:05,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6ca4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:05, skipping insertion in model container [2023-04-02 04:56:05,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 04:56:05" (1/1) ... [2023-04-02 04:56:05,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 04:56:05,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 04:56:06,025 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2023-04-02 04:56:06,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:56:06,035 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 04:56:06,081 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2023-04-02 04:56:06,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 04:56:06,092 INFO L208 MainTranslator]: Completed translation [2023-04-02 04:56:06,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06 WrapperNode [2023-04-02 04:56:06,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 04:56:06,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 04:56:06,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 04:56:06,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 04:56:06,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,129 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 04:56:06,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 04:56:06,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 04:56:06,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 04:56:06,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (1/1) ... [2023-04-02 04:56:06,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 04:56:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 04:56:06,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 04:56:06,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 04:56:06,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 04:56:06,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2023-04-02 04:56:06,228 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 04:56:06,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-04-02 04:56:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 04:56:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 04:56:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 04:56:06,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2023-04-02 04:56:06,230 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure init [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 04:56:06,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 04:56:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 04:56:06,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 04:56:06,314 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 04:56:06,316 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 04:56:06,835 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 04:56:06,841 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 04:56:06,841 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 04:56:06,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:56:06 BoogieIcfgContainer [2023-04-02 04:56:06,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 04:56:06,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 04:56:06,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 04:56:06,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 04:56:06,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 04:56:05" (1/3) ... [2023-04-02 04:56:06,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afb686a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:56:06, skipping insertion in model container [2023-04-02 04:56:06,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 04:56:06" (2/3) ... [2023-04-02 04:56:06,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afb686a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 04:56:06, skipping insertion in model container [2023-04-02 04:56:06,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 04:56:06" (3/3) ... [2023-04-02 04:56:06,868 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2023-04-02 04:56:06,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 04:56:06,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 04:56:06,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 04:56:06,927 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36bd3b16, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 04:56:06,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 04:56:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 155 states have internal predecessors, (232), 43 states have call successors, (43), 19 states have call predecessors, (43), 19 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-04-02 04:56:06,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-04-02 04:56:06,939 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:06,963 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:06,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:06,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:06,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1915679699, now seen corresponding path program 1 times [2023-04-02 04:56:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325327731] [2023-04-02 04:56:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-04-02 04:56:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-04-02 04:56:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-04-02 04:56:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:56:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325327731] [2023-04-02 04:56:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325327731] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:07,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:07,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-04-02 04:56:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112418570] [2023-04-02 04:56:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:07,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 04:56:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 04:56:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:56:07,781 INFO L87 Difference]: Start difference. First operand has 218 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 155 states have internal predecessors, (232), 43 states have call successors, (43), 19 states have call predecessors, (43), 19 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-02 04:56:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:09,597 INFO L93 Difference]: Finished difference Result 427 states and 658 transitions. [2023-04-02 04:56:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 04:56:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2023-04-02 04:56:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:09,606 INFO L225 Difference]: With dead ends: 427 [2023-04-02 04:56:09,606 INFO L226 Difference]: Without dead ends: 223 [2023-04-02 04:56:09,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2023-04-02 04:56:09,613 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 680 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:09,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 172 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:56:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-04-02 04:56:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2023-04-02 04:56:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 151 states have (on average 1.4105960264900663) internal successors, (213), 151 states have internal predecessors, (213), 43 states have call successors, (43), 19 states have call predecessors, (43), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-04-02 04:56:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2023-04-02 04:56:09,719 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 56 [2023-04-02 04:56:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:09,719 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2023-04-02 04:56:09,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-02 04:56:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2023-04-02 04:56:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-04-02 04:56:09,722 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:09,722 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:09,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 04:56:09,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:09,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -726871496, now seen corresponding path program 1 times [2023-04-02 04:56:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068276226] [2023-04-02 04:56:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 04:56:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:10,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068276226] [2023-04-02 04:56:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068276226] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-04-02 04:56:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155406137] [2023-04-02 04:56:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:10,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 04:56:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 04:56:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-04-02 04:56:10,015 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-04-02 04:56:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:11,036 INFO L93 Difference]: Finished difference Result 406 states and 581 transitions. [2023-04-02 04:56:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-02 04:56:11,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 67 [2023-04-02 04:56:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:11,039 INFO L225 Difference]: With dead ends: 406 [2023-04-02 04:56:11,039 INFO L226 Difference]: Without dead ends: 217 [2023-04-02 04:56:11,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:56:11,041 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 706 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:11,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 95 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:56:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-04-02 04:56:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-04-02 04:56:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 154 states have (on average 1.4025974025974026) internal successors, (216), 154 states have internal predecessors, (216), 43 states have call successors, (43), 20 states have call predecessors, (43), 19 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-04-02 04:56:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2023-04-02 04:56:11,086 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 67 [2023-04-02 04:56:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:11,087 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2023-04-02 04:56:11,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 10 states have call predecessors, (13), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-04-02 04:56:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2023-04-02 04:56:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-04-02 04:56:11,088 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:11,088 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 04:56:11,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:11,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1355226864, now seen corresponding path program 1 times [2023-04-02 04:56:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159545698] [2023-04-02 04:56:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:56:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-04-02 04:56:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159545698] [2023-04-02 04:56:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159545698] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-04-02 04:56:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488842513] [2023-04-02 04:56:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 04:56:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 04:56:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:56:11,480 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-02 04:56:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:13,654 INFO L93 Difference]: Finished difference Result 476 states and 661 transitions. [2023-04-02 04:56:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:56:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 89 [2023-04-02 04:56:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:13,657 INFO L225 Difference]: With dead ends: 476 [2023-04-02 04:56:13,657 INFO L226 Difference]: Without dead ends: 283 [2023-04-02 04:56:13,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 04:56:13,659 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1981 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:13,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 82 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-02 04:56:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-04-02 04:56:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 282. [2023-04-02 04:56:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.3888888888888888) internal successors, (275), 200 states have internal predecessors, (275), 54 states have call successors, (54), 30 states have call predecessors, (54), 29 states have return successors, (54), 51 states have call predecessors, (54), 53 states have call successors, (54) [2023-04-02 04:56:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2023-04-02 04:56:13,701 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 383 transitions. Word has length 89 [2023-04-02 04:56:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:13,702 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 383 transitions. [2023-04-02 04:56:13,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 7 states have internal predecessors, (56), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-02 04:56:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 383 transitions. [2023-04-02 04:56:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-04-02 04:56:13,703 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:13,703 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:13,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 04:56:13,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:13,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2052023162, now seen corresponding path program 1 times [2023-04-02 04:56:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565028823] [2023-04-02 04:56:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-04-02 04:56:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-04-02 04:56:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565028823] [2023-04-02 04:56:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565028823] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-04-02 04:56:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094813292] [2023-04-02 04:56:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 04:56:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 04:56:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:56:14,071 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-02 04:56:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:15,999 INFO L93 Difference]: Finished difference Result 482 states and 669 transitions. [2023-04-02 04:56:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:56:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2023-04-02 04:56:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:16,012 INFO L225 Difference]: With dead ends: 482 [2023-04-02 04:56:16,012 INFO L226 Difference]: Without dead ends: 286 [2023-04-02 04:56:16,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 04:56:16,014 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1243 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:16,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 77 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:56:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-04-02 04:56:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2023-04-02 04:56:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 198 states have (on average 1.3888888888888888) internal successors, (275), 200 states have internal predecessors, (275), 54 states have call successors, (54), 30 states have call predecessors, (54), 29 states have return successors, (54), 51 states have call predecessors, (54), 53 states have call successors, (54) [2023-04-02 04:56:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2023-04-02 04:56:16,061 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 383 transitions. Word has length 90 [2023-04-02 04:56:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 383 transitions. [2023-04-02 04:56:16,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 7 states have internal predecessors, (57), 6 states have call successors, (17), 12 states have call predecessors, (17), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-04-02 04:56:16,062 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 383 transitions. [2023-04-02 04:56:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-04-02 04:56:16,063 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:16,063 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:16,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 04:56:16,063 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:16,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1833624268, now seen corresponding path program 1 times [2023-04-02 04:56:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561314125] [2023-04-02 04:56:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-02 04:56:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561314125] [2023-04-02 04:56:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561314125] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:16,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-02 04:56:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753422277] [2023-04-02 04:56:16,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:16,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 04:56:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 04:56:16,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 04:56:16,376 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:18,421 INFO L93 Difference]: Finished difference Result 691 states and 964 transitions. [2023-04-02 04:56:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 04:56:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 92 [2023-04-02 04:56:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:18,424 INFO L225 Difference]: With dead ends: 691 [2023-04-02 04:56:18,424 INFO L226 Difference]: Without dead ends: 495 [2023-04-02 04:56:18,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:56:18,426 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2129 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:18,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 81 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:56:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-04-02 04:56:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 480. [2023-04-02 04:56:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 336 states have (on average 1.4107142857142858) internal successors, (474), 341 states have internal predecessors, (474), 94 states have call successors, (94), 48 states have call predecessors, (94), 49 states have return successors, (98), 90 states have call predecessors, (98), 93 states have call successors, (98) [2023-04-02 04:56:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 666 transitions. [2023-04-02 04:56:18,530 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 666 transitions. Word has length 92 [2023-04-02 04:56:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:18,530 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 666 transitions. [2023-04-02 04:56:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 666 transitions. [2023-04-02 04:56:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-04-02 04:56:18,531 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:18,531 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:18,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 04:56:18,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:18,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1407518226, now seen corresponding path program 1 times [2023-04-02 04:56:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:18,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796396244] [2023-04-02 04:56:18,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:18,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796396244] [2023-04-02 04:56:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796396244] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-02 04:56:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622388716] [2023-04-02 04:56:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 04:56:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 04:56:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 04:56:18,792 INFO L87 Difference]: Start difference. First operand 480 states and 666 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:20,831 INFO L93 Difference]: Finished difference Result 1189 states and 1689 transitions. [2023-04-02 04:56:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 04:56:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 93 [2023-04-02 04:56:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:20,837 INFO L225 Difference]: With dead ends: 1189 [2023-04-02 04:56:20,837 INFO L226 Difference]: Without dead ends: 827 [2023-04-02 04:56:20,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:56:20,867 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 900 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:20,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 92 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:56:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2023-04-02 04:56:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 821. [2023-04-02 04:56:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 570 states have (on average 1.4157894736842105) internal successors, (807), 582 states have internal predecessors, (807), 167 states have call successors, (167), 77 states have call predecessors, (167), 83 states have return successors, (181), 161 states have call predecessors, (181), 166 states have call successors, (181) [2023-04-02 04:56:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1155 transitions. [2023-04-02 04:56:21,005 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1155 transitions. Word has length 93 [2023-04-02 04:56:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:21,006 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1155 transitions. [2023-04-02 04:56:21,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1155 transitions. [2023-04-02 04:56:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-02 04:56:21,007 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:21,007 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:21,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-02 04:56:21,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:21,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 853549932, now seen corresponding path program 1 times [2023-04-02 04:56:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653187159] [2023-04-02 04:56:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:56:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-04-02 04:56:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653187159] [2023-04-02 04:56:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653187159] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:21,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:21,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-02 04:56:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031304540] [2023-04-02 04:56:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:21,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 04:56:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 04:56:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 04:56:21,270 INFO L87 Difference]: Start difference. First operand 821 states and 1155 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:23,558 INFO L93 Difference]: Finished difference Result 1517 states and 2160 transitions. [2023-04-02 04:56:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 04:56:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 95 [2023-04-02 04:56:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:23,562 INFO L225 Difference]: With dead ends: 1517 [2023-04-02 04:56:23,562 INFO L226 Difference]: Without dead ends: 832 [2023-04-02 04:56:23,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:56:23,565 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 680 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:23,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 113 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-02 04:56:23,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-04-02 04:56:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 826. [2023-04-02 04:56:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 574 states have (on average 1.4128919860627178) internal successors, (811), 586 states have internal predecessors, (811), 167 states have call successors, (167), 78 states have call predecessors, (167), 84 states have return successors, (179), 161 states have call predecessors, (179), 166 states have call successors, (179) [2023-04-02 04:56:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1157 transitions. [2023-04-02 04:56:23,686 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1157 transitions. Word has length 95 [2023-04-02 04:56:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:23,687 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1157 transitions. [2023-04-02 04:56:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1157 transitions. [2023-04-02 04:56:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-04-02 04:56:23,688 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:23,688 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:23,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-02 04:56:23,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:23,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -115961068, now seen corresponding path program 1 times [2023-04-02 04:56:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:23,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746657994] [2023-04-02 04:56:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:56:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:56:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-04-02 04:56:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746657994] [2023-04-02 04:56:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746657994] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-04-02 04:56:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805439052] [2023-04-02 04:56:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:23,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-02 04:56:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-02 04:56:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-04-02 04:56:23,946 INFO L87 Difference]: Start difference. First operand 826 states and 1157 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:26,157 INFO L93 Difference]: Finished difference Result 1539 states and 2176 transitions. [2023-04-02 04:56:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-02 04:56:26,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 95 [2023-04-02 04:56:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:26,161 INFO L225 Difference]: With dead ends: 1539 [2023-04-02 04:56:26,161 INFO L226 Difference]: Without dead ends: 854 [2023-04-02 04:56:26,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-04-02 04:56:26,164 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1200 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:26,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 129 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-04-02 04:56:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2023-04-02 04:56:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 826. [2023-04-02 04:56:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 574 states have (on average 1.4094076655052266) internal successors, (809), 586 states have internal predecessors, (809), 167 states have call successors, (167), 78 states have call predecessors, (167), 84 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1153 transitions. [2023-04-02 04:56:26,280 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1153 transitions. Word has length 95 [2023-04-02 04:56:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:26,281 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1153 transitions. [2023-04-02 04:56:26,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-02 04:56:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1153 transitions. [2023-04-02 04:56:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-04-02 04:56:26,283 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:26,283 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:26,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-02 04:56:26,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:26,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1607585392, now seen corresponding path program 1 times [2023-04-02 04:56:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13846659] [2023-04-02 04:56:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13846659] [2023-04-02 04:56:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13846659] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532633462] [2023-04-02 04:56:26,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:26,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:26,650 INFO L87 Difference]: Start difference. First operand 826 states and 1153 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-04-02 04:56:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:28,039 INFO L93 Difference]: Finished difference Result 1531 states and 2169 transitions. [2023-04-02 04:56:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:28,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2023-04-02 04:56:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:28,042 INFO L225 Difference]: With dead ends: 1531 [2023-04-02 04:56:28,043 INFO L226 Difference]: Without dead ends: 846 [2023-04-02 04:56:28,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:28,045 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 703 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:28,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 97 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:56:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2023-04-02 04:56:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2023-04-02 04:56:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 590 states have (on average 1.3983050847457628) internal successors, (825), 602 states have internal predecessors, (825), 167 states have call successors, (167), 82 states have call predecessors, (167), 88 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1169 transitions. [2023-04-02 04:56:28,168 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1169 transitions. Word has length 93 [2023-04-02 04:56:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:28,168 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1169 transitions. [2023-04-02 04:56:28,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 12 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-04-02 04:56:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1169 transitions. [2023-04-02 04:56:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-04-02 04:56:28,170 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:28,170 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:28,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 04:56:28,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:28,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1947572812, now seen corresponding path program 1 times [2023-04-02 04:56:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985215248] [2023-04-02 04:56:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:28,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:28,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985215248] [2023-04-02 04:56:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985215248] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:28,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:28,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504444339] [2023-04-02 04:56:28,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:28,496 INFO L87 Difference]: Start difference. First operand 846 states and 1169 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-04-02 04:56:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:29,873 INFO L93 Difference]: Finished difference Result 1571 states and 2213 transitions. [2023-04-02 04:56:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:29,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 101 [2023-04-02 04:56:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:29,877 INFO L225 Difference]: With dead ends: 1571 [2023-04-02 04:56:29,877 INFO L226 Difference]: Without dead ends: 866 [2023-04-02 04:56:29,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:29,879 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 859 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:29,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 115 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:56:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2023-04-02 04:56:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2023-04-02 04:56:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 606 states have (on average 1.3877887788778878) internal successors, (841), 618 states have internal predecessors, (841), 167 states have call successors, (167), 86 states have call predecessors, (167), 92 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1185 transitions. [2023-04-02 04:56:30,013 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1185 transitions. Word has length 101 [2023-04-02 04:56:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:30,013 INFO L495 AbstractCegarLoop]: Abstraction has 866 states and 1185 transitions. [2023-04-02 04:56:30,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 12 states have call predecessors, (18), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-04-02 04:56:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1185 transitions. [2023-04-02 04:56:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:56:30,014 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:30,015 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:30,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-02 04:56:30,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:30,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash -773831850, now seen corresponding path program 1 times [2023-04-02 04:56:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264570936] [2023-04-02 04:56:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:56:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264570936] [2023-04-02 04:56:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264570936] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158733137] [2023-04-02 04:56:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:30,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:30,340 INFO L87 Difference]: Start difference. First operand 866 states and 1185 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-04-02 04:56:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:31,756 INFO L93 Difference]: Finished difference Result 1607 states and 2229 transitions. [2023-04-02 04:56:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:31,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2023-04-02 04:56:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:31,760 INFO L225 Difference]: With dead ends: 1607 [2023-04-02 04:56:31,760 INFO L226 Difference]: Without dead ends: 882 [2023-04-02 04:56:31,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:31,762 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1381 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:31,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 103 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:56:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-04-02 04:56:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2023-04-02 04:56:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 618 states have (on average 1.3802588996763754) internal successors, (853), 630 states have internal predecessors, (853), 167 states have call successors, (167), 90 states have call predecessors, (167), 96 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1197 transitions. [2023-04-02 04:56:31,881 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1197 transitions. Word has length 109 [2023-04-02 04:56:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:31,882 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1197 transitions. [2023-04-02 04:56:31,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-04-02 04:56:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1197 transitions. [2023-04-02 04:56:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-02 04:56:31,883 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:31,883 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-02 04:56:31,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:31,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -627314956, now seen corresponding path program 1 times [2023-04-02 04:56:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716250907] [2023-04-02 04:56:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:56:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 04:56:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716250907] [2023-04-02 04:56:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716250907] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:32,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995151616] [2023-04-02 04:56:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:32,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:32,193 INFO L87 Difference]: Start difference. First operand 882 states and 1197 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-04-02 04:56:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:33,699 INFO L93 Difference]: Finished difference Result 1643 states and 2269 transitions. [2023-04-02 04:56:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:33,699 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2023-04-02 04:56:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:33,703 INFO L225 Difference]: With dead ends: 1643 [2023-04-02 04:56:33,703 INFO L226 Difference]: Without dead ends: 902 [2023-04-02 04:56:33,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:33,705 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1347 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:33,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 109 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 04:56:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-04-02 04:56:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2023-04-02 04:56:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 634 states have (on average 1.3706624605678233) internal successors, (869), 646 states have internal predecessors, (869), 167 states have call successors, (167), 94 states have call predecessors, (167), 100 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1213 transitions. [2023-04-02 04:56:33,840 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1213 transitions. Word has length 109 [2023-04-02 04:56:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:33,840 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1213 transitions. [2023-04-02 04:56:33,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (19), 12 states have call predecessors, (19), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-04-02 04:56:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1213 transitions. [2023-04-02 04:56:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-04-02 04:56:33,841 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:33,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:56:33,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-04-02 04:56:33,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:33,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:33,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1597220470, now seen corresponding path program 1 times [2023-04-02 04:56:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217862647] [2023-04-02 04:56:33,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:56:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-02 04:56:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-02 04:56:34,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:34,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217862647] [2023-04-02 04:56:34,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217862647] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:34,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:34,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010903066] [2023-04-02 04:56:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:34,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:34,118 INFO L87 Difference]: Start difference. First operand 902 states and 1213 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-04-02 04:56:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:35,203 INFO L93 Difference]: Finished difference Result 1687 states and 2297 transitions. [2023-04-02 04:56:35,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-04-02 04:56:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:35,209 INFO L225 Difference]: With dead ends: 1687 [2023-04-02 04:56:35,209 INFO L226 Difference]: Without dead ends: 926 [2023-04-02 04:56:35,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:35,211 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 963 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:35,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 121 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-04-02 04:56:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-04-02 04:56:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2023-04-02 04:56:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 654 states have (on average 1.3593272171253823) internal successors, (889), 666 states have internal predecessors, (889), 167 states have call successors, (167), 98 states have call predecessors, (167), 104 states have return successors, (177), 161 states have call predecessors, (177), 166 states have call successors, (177) [2023-04-02 04:56:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1233 transitions. [2023-04-02 04:56:35,333 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1233 transitions. Word has length 117 [2023-04-02 04:56:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:35,333 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 1233 transitions. [2023-04-02 04:56:35,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (20), 12 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-04-02 04:56:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1233 transitions. [2023-04-02 04:56:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-04-02 04:56:35,335 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:35,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:56:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-04-02 04:56:35,335 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:35,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1944849540, now seen corresponding path program 1 times [2023-04-02 04:56:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674762826] [2023-04-02 04:56:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-04-02 04:56:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:56:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:56:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:56:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:56:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:56:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-02 04:56:35,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674762826] [2023-04-02 04:56:35,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674762826] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:35,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:35,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-04-02 04:56:35,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270123075] [2023-04-02 04:56:35,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:35,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 04:56:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 04:56:35,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:56:35,846 INFO L87 Difference]: Start difference. First operand 926 states and 1233 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-04-02 04:56:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:40,043 INFO L93 Difference]: Finished difference Result 2549 states and 3361 transitions. [2023-04-02 04:56:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-04-02 04:56:40,043 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) Word has length 122 [2023-04-02 04:56:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:40,050 INFO L225 Difference]: With dead ends: 2549 [2023-04-02 04:56:40,050 INFO L226 Difference]: Without dead ends: 1752 [2023-04-02 04:56:40,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2023-04-02 04:56:40,052 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1321 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 3214 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 3214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:40,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 181 Invalid, 3559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 3214 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 04:56:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2023-04-02 04:56:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1660. [2023-04-02 04:56:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1192 states have (on average 1.3380872483221478) internal successors, (1595), 1208 states have internal predecessors, (1595), 275 states have call successors, (275), 178 states have call predecessors, (275), 192 states have return successors, (293), 273 states have call predecessors, (293), 274 states have call successors, (293) [2023-04-02 04:56:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2163 transitions. [2023-04-02 04:56:40,302 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2163 transitions. Word has length 122 [2023-04-02 04:56:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:40,303 INFO L495 AbstractCegarLoop]: Abstraction has 1660 states and 2163 transitions. [2023-04-02 04:56:40,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 9 states have internal predecessors, (78), 6 states have call successors, (20), 11 states have call predecessors, (20), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2023-04-02 04:56:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2163 transitions. [2023-04-02 04:56:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-04-02 04:56:40,304 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:40,304 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:40,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-04-02 04:56:40,304 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:40,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash -598942713, now seen corresponding path program 1 times [2023-04-02 04:56:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003876622] [2023-04-02 04:56:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:56:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-02 04:56:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-04-02 04:56:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-02 04:56:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003876622] [2023-04-02 04:56:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003876622] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:40,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:40,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-04-02 04:56:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825651394] [2023-04-02 04:56:40,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:40,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-02 04:56:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:40,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-02 04:56:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-02 04:56:40,656 INFO L87 Difference]: Start difference. First operand 1660 states and 2163 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-04-02 04:56:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:42,147 INFO L93 Difference]: Finished difference Result 3033 states and 3979 transitions. [2023-04-02 04:56:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 04:56:42,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2023-04-02 04:56:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:42,152 INFO L225 Difference]: With dead ends: 3033 [2023-04-02 04:56:42,153 INFO L226 Difference]: Without dead ends: 1676 [2023-04-02 04:56:42,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-04-02 04:56:42,156 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 507 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:42,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 105 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-02 04:56:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2023-04-02 04:56:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1664. [2023-04-02 04:56:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1196 states have (on average 1.3252508361204014) internal successors, (1585), 1212 states have internal predecessors, (1585), 269 states have call successors, (269), 184 states have call predecessors, (269), 198 states have return successors, (287), 267 states have call predecessors, (287), 268 states have call successors, (287) [2023-04-02 04:56:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2141 transitions. [2023-04-02 04:56:42,386 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2141 transitions. Word has length 124 [2023-04-02 04:56:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:42,387 INFO L495 AbstractCegarLoop]: Abstraction has 1664 states and 2141 transitions. [2023-04-02 04:56:42,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (21), 12 states have call predecessors, (21), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-04-02 04:56:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2141 transitions. [2023-04-02 04:56:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-04-02 04:56:42,388 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:42,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:56:42,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-04-02 04:56:42,389 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:42,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash -996099967, now seen corresponding path program 1 times [2023-04-02 04:56:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965658912] [2023-04-02 04:56:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-04-02 04:56:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:56:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:56:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:56:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:56:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:56:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 04:56:42,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965658912] [2023-04-02 04:56:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965658912] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:42,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-04-02 04:56:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145041673] [2023-04-02 04:56:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:42,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 04:56:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 04:56:42,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:56:42,899 INFO L87 Difference]: Start difference. First operand 1664 states and 2141 transitions. Second operand has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-04-02 04:56:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:44,896 INFO L93 Difference]: Finished difference Result 1770 states and 2292 transitions. [2023-04-02 04:56:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-02 04:56:44,896 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2023-04-02 04:56:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:44,902 INFO L225 Difference]: With dead ends: 1770 [2023-04-02 04:56:44,902 INFO L226 Difference]: Without dead ends: 1768 [2023-04-02 04:56:44,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2023-04-02 04:56:44,903 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1233 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:44,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 289 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-04-02 04:56:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2023-04-02 04:56:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1692. [2023-04-02 04:56:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1212 states have (on average 1.3209570957095709) internal successors, (1601), 1236 states have internal predecessors, (1601), 271 states have call successors, (271), 186 states have call predecessors, (271), 208 states have return successors, (301), 269 states have call predecessors, (301), 270 states have call successors, (301) [2023-04-02 04:56:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2173 transitions. [2023-04-02 04:56:45,147 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 2173 transitions. Word has length 125 [2023-04-02 04:56:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:45,148 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 2173 transitions. [2023-04-02 04:56:45,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.588235294117647) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-04-02 04:56:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 2173 transitions. [2023-04-02 04:56:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-04-02 04:56:45,149 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:45,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 04:56:45,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-02 04:56:45,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:45,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1273536350, now seen corresponding path program 1 times [2023-04-02 04:56:45,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:45,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086505214] [2023-04-02 04:56:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:56:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-04-02 04:56:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-04-02 04:56:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-04-02 04:56:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-04-02 04:56:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 04:56:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086505214] [2023-04-02 04:56:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086505214] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:45,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:45,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-04-02 04:56:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035541819] [2023-04-02 04:56:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:45,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 04:56:45,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 04:56:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:56:45,514 INFO L87 Difference]: Start difference. First operand 1692 states and 2173 transitions. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2023-04-02 04:56:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:48,822 INFO L93 Difference]: Finished difference Result 3452 states and 4397 transitions. [2023-04-02 04:56:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-04-02 04:56:48,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) Word has length 126 [2023-04-02 04:56:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:48,829 INFO L225 Difference]: With dead ends: 3452 [2023-04-02 04:56:48,829 INFO L226 Difference]: Without dead ends: 2131 [2023-04-02 04:56:48,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=1659, Unknown=0, NotChecked=0, Total=2162 [2023-04-02 04:56:48,831 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1406 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:48,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 162 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-04-02 04:56:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2023-04-02 04:56:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1852. [2023-04-02 04:56:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1332 states have (on average 1.307057057057057) internal successors, (1741), 1356 states have internal predecessors, (1741), 291 states have call successors, (291), 206 states have call predecessors, (291), 228 states have return successors, (313), 289 states have call predecessors, (313), 290 states have call successors, (313) [2023-04-02 04:56:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2345 transitions. [2023-04-02 04:56:49,112 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2345 transitions. Word has length 126 [2023-04-02 04:56:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:49,113 INFO L495 AbstractCegarLoop]: Abstraction has 1852 states and 2345 transitions. [2023-04-02 04:56:49,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 8 states have internal predecessors, (80), 5 states have call successors, (21), 12 states have call predecessors, (21), 4 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) [2023-04-02 04:56:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2345 transitions. [2023-04-02 04:56:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-04-02 04:56:49,115 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:49,115 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:49,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-04-02 04:56:49,116 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:49,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1967630880, now seen corresponding path program 1 times [2023-04-02 04:56:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758339673] [2023-04-02 04:56:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-04-02 04:56:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:56:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:56:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:56:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:56:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-04-02 04:56:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-04-02 04:56:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-04-02 04:56:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:49,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758339673] [2023-04-02 04:56:49,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758339673] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:49,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-04-02 04:56:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757556113] [2023-04-02 04:56:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:49,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 04:56:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:49,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 04:56:49,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:56:49,562 INFO L87 Difference]: Start difference. First operand 1852 states and 2345 transitions. Second operand has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-04-02 04:56:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:53,729 INFO L93 Difference]: Finished difference Result 4825 states and 6087 transitions. [2023-04-02 04:56:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-04-02 04:56:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) Word has length 130 [2023-04-02 04:56:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:53,739 INFO L225 Difference]: With dead ends: 4825 [2023-04-02 04:56:53,739 INFO L226 Difference]: Without dead ends: 3400 [2023-04-02 04:56:53,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2023-04-02 04:56:53,742 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2093 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:53,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 188 Invalid, 4380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 04:56:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2023-04-02 04:56:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 2312. [2023-04-02 04:56:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 1657 states have (on average 1.304767652383826) internal successors, (2162), 1693 states have internal predecessors, (2162), 365 states have call successors, (365), 259 states have call predecessors, (365), 289 states have return successors, (395), 359 states have call predecessors, (395), 364 states have call successors, (395) [2023-04-02 04:56:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2922 transitions. [2023-04-02 04:56:54,131 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2922 transitions. Word has length 130 [2023-04-02 04:56:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:54,131 INFO L495 AbstractCegarLoop]: Abstraction has 2312 states and 2922 transitions. [2023-04-02 04:56:54,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.444444444444445) internal successors, (80), 9 states have internal predecessors, (80), 6 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-04-02 04:56:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2922 transitions. [2023-04-02 04:56:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-04-02 04:56:54,133 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:54,133 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:54,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-04-02 04:56:54,133 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:54,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 948082887, now seen corresponding path program 1 times [2023-04-02 04:56:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382496400] [2023-04-02 04:56:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-04-02 04:56:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-04-02 04:56:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-04-02 04:56:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-04-02 04:56:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-02 04:56:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-04-02 04:56:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-02 04:56:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-04-02 04:56:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-04-02 04:56:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 04:56:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382496400] [2023-04-02 04:56:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382496400] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:54,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:54,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-04-02 04:56:54,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265990362] [2023-04-02 04:56:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-02 04:56:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-02 04:56:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-04-02 04:56:54,567 INFO L87 Difference]: Start difference. First operand 2312 states and 2922 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) [2023-04-02 04:56:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:56:58,474 INFO L93 Difference]: Finished difference Result 4594 states and 5901 transitions. [2023-04-02 04:56:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-02 04:56:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) Word has length 131 [2023-04-02 04:56:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:56:58,483 INFO L225 Difference]: With dead ends: 4594 [2023-04-02 04:56:58,483 INFO L226 Difference]: Without dead ends: 2585 [2023-04-02 04:56:58,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=381, Invalid=1179, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 04:56:58,486 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1358 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:56:58,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 190 Invalid, 3385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-04-02 04:56:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2023-04-02 04:56:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2230. [2023-04-02 04:56:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 1593 states have (on average 1.2944130571249215) internal successors, (2062), 1625 states have internal predecessors, (2062), 357 states have call successors, (357), 253 states have call predecessors, (357), 279 states have return successors, (383), 351 states have call predecessors, (383), 356 states have call successors, (383) [2023-04-02 04:56:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 2802 transitions. [2023-04-02 04:56:58,881 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 2802 transitions. Word has length 131 [2023-04-02 04:56:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:56:58,881 INFO L495 AbstractCegarLoop]: Abstraction has 2230 states and 2802 transitions. [2023-04-02 04:56:58,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 8 states have internal predecessors, (85), 5 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) [2023-04-02 04:56:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 2802 transitions. [2023-04-02 04:56:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-04-02 04:56:58,882 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:56:58,883 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:56:58,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-04-02 04:56:58,883 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:56:58,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:56:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1823816089, now seen corresponding path program 1 times [2023-04-02 04:56:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:56:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260889225] [2023-04-02 04:56:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:56:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:56:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:56:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:56:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:56:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:56:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:56:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:56:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:56:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:56:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-04-02 04:56:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:56:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-02 04:56:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:56:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:56:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:56:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:56:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:56:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 04:56:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:56:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260889225] [2023-04-02 04:56:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260889225] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:56:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:56:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-04-02 04:56:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718411902] [2023-04-02 04:56:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:56:59,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 04:56:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:56:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 04:56:59,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-04-02 04:56:59,199 INFO L87 Difference]: Start difference. First operand 2230 states and 2802 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:57:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:57:02,393 INFO L93 Difference]: Finished difference Result 6285 states and 7996 transitions. [2023-04-02 04:57:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-02 04:57:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2023-04-02 04:57:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:57:02,405 INFO L225 Difference]: With dead ends: 6285 [2023-04-02 04:57:02,405 INFO L226 Difference]: Without dead ends: 4382 [2023-04-02 04:57:02,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 04:57:02,409 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1064 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-02 04:57:02,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 160 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-02 04:57:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2023-04-02 04:57:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 3926. [2023-04-02 04:57:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 2801 states have (on average 1.29382363441628) internal successors, (3624), 2863 states have internal predecessors, (3624), 635 states have call successors, (635), 440 states have call predecessors, (635), 489 states have return successors, (705), 622 states have call predecessors, (705), 634 states have call successors, (705) [2023-04-02 04:57:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 4964 transitions. [2023-04-02 04:57:03,120 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 4964 transitions. Word has length 132 [2023-04-02 04:57:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:57:03,120 INFO L495 AbstractCegarLoop]: Abstraction has 3926 states and 4964 transitions. [2023-04-02 04:57:03,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:57:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 4964 transitions. [2023-04-02 04:57:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-04-02 04:57:03,121 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:57:03,121 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:57:03,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-04-02 04:57:03,122 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:57:03,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:57:03,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1230300573, now seen corresponding path program 1 times [2023-04-02 04:57:03,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:57:03,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171887612] [2023-04-02 04:57:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:57:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:57:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:57:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:57:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:57:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:57:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:57:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-04-02 04:57:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:57:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-04-02 04:57:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:57:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-02 04:57:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:57:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:57:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:57:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-02 04:57:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:57:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171887612] [2023-04-02 04:57:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171887612] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:57:03,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:57:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-04-02 04:57:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462689615] [2023-04-02 04:57:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:57:03,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 04:57:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:57:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 04:57:03,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-04-02 04:57:03,536 INFO L87 Difference]: Start difference. First operand 3926 states and 4964 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 5 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:57:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:57:09,293 INFO L93 Difference]: Finished difference Result 7912 states and 10166 transitions. [2023-04-02 04:57:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-04-02 04:57:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 5 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2023-04-02 04:57:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:57:09,306 INFO L225 Difference]: With dead ends: 7912 [2023-04-02 04:57:09,306 INFO L226 Difference]: Without dead ends: 4395 [2023-04-02 04:57:09,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=503, Invalid=1849, Unknown=0, NotChecked=0, Total=2352 [2023-04-02 04:57:09,312 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2883 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 4622 mSolverCounterSat, 1201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2886 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1201 IncrementalHoareTripleChecker+Valid, 4622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:57:09,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2886 Valid, 187 Invalid, 5823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1201 Valid, 4622 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-04-02 04:57:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2023-04-02 04:57:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 3831. [2023-04-02 04:57:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 2721 states have (on average 1.2870268283719222) internal successors, (3502), 2786 states have internal predecessors, (3502), 636 states have call successors, (636), 421 states have call predecessors, (636), 473 states have return successors, (705), 623 states have call predecessors, (705), 635 states have call successors, (705) [2023-04-02 04:57:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 4843 transitions. [2023-04-02 04:57:10,044 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 4843 transitions. Word has length 134 [2023-04-02 04:57:10,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:57:10,044 INFO L495 AbstractCegarLoop]: Abstraction has 3831 states and 4843 transitions. [2023-04-02 04:57:10,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (21), 11 states have call predecessors, (21), 5 states have return successors, (19), 5 states have call predecessors, (19), 2 states have call successors, (19) [2023-04-02 04:57:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 4843 transitions. [2023-04-02 04:57:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-04-02 04:57:10,045 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:57:10,046 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:57:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-04-02 04:57:10,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:57:10,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:57:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1242438111, now seen corresponding path program 1 times [2023-04-02 04:57:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:57:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937090635] [2023-04-02 04:57:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:57:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:57:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:57:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:57:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:57:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:57:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:57:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:57:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:57:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:57:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:57:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-02 04:57:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:57:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:57:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:57:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 04:57:10,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:57:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937090635] [2023-04-02 04:57:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937090635] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:57:10,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:57:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-04-02 04:57:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367231353] [2023-04-02 04:57:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:57:10,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 04:57:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:57:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 04:57:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:57:10,455 INFO L87 Difference]: Start difference. First operand 3831 states and 4843 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (21), 11 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:57:13,043 INFO L93 Difference]: Finished difference Result 7487 states and 9471 transitions. [2023-04-02 04:57:13,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-02 04:57:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (21), 11 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 136 [2023-04-02 04:57:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:57:13,066 INFO L225 Difference]: With dead ends: 7487 [2023-04-02 04:57:13,066 INFO L226 Difference]: Without dead ends: 3867 [2023-04-02 04:57:13,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 04:57:13,106 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1727 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:57:13,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 94 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:57:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2023-04-02 04:57:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3831. [2023-04-02 04:57:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3831 states, 2721 states have (on average 1.2851892686512312) internal successors, (3497), 2786 states have internal predecessors, (3497), 636 states have call successors, (636), 421 states have call predecessors, (636), 473 states have return successors, (705), 623 states have call predecessors, (705), 635 states have call successors, (705) [2023-04-02 04:57:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 3831 states and 4838 transitions. [2023-04-02 04:57:13,850 INFO L78 Accepts]: Start accepts. Automaton has 3831 states and 4838 transitions. Word has length 136 [2023-04-02 04:57:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:57:13,851 INFO L495 AbstractCegarLoop]: Abstraction has 3831 states and 4838 transitions. [2023-04-02 04:57:13,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (21), 11 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3831 states and 4838 transitions. [2023-04-02 04:57:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-04-02 04:57:13,852 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:57:13,852 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:57:13,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-04-02 04:57:13,852 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:57:13,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:57:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash 985574680, now seen corresponding path program 1 times [2023-04-02 04:57:13,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:57:13,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259645246] [2023-04-02 04:57:13,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:57:13,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:57:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:57:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:57:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:57:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:57:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:57:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:57:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-04-02 04:57:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-04-02 04:57:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:57:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-02 04:57:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:57:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:57:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:57:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 04:57:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:57:14,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259645246] [2023-04-02 04:57:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259645246] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:57:14,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:57:14,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-04-02 04:57:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692940261] [2023-04-02 04:57:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:57:14,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 04:57:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:57:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 04:57:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:57:14,177 INFO L87 Difference]: Start difference. First operand 3831 states and 4838 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:57:16,868 INFO L93 Difference]: Finished difference Result 7500 states and 9495 transitions. [2023-04-02 04:57:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:57:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 136 [2023-04-02 04:57:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:57:16,878 INFO L225 Difference]: With dead ends: 7500 [2023-04-02 04:57:16,878 INFO L226 Difference]: Without dead ends: 3850 [2023-04-02 04:57:16,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 04:57:16,883 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1224 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-02 04:57:16,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 94 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-02 04:57:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2023-04-02 04:57:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3832. [2023-04-02 04:57:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 2722 states have (on average 1.281410727406319) internal successors, (3488), 2787 states have internal predecessors, (3488), 636 states have call successors, (636), 421 states have call predecessors, (636), 473 states have return successors, (705), 623 states have call predecessors, (705), 635 states have call successors, (705) [2023-04-02 04:57:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4829 transitions. [2023-04-02 04:57:17,624 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4829 transitions. Word has length 136 [2023-04-02 04:57:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:57:17,624 INFO L495 AbstractCegarLoop]: Abstraction has 3832 states and 4829 transitions. [2023-04-02 04:57:17,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4829 transitions. [2023-04-02 04:57:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-04-02 04:57:17,626 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:57:17,626 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:57:17,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-04-02 04:57:17,626 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:57:17,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:57:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1279636499, now seen corresponding path program 1 times [2023-04-02 04:57:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:57:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433029850] [2023-04-02 04:57:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:57:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:57:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 04:57:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-02 04:57:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-04-02 04:57:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-04-02 04:57:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-04-02 04:57:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-04-02 04:57:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-04-02 04:57:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-04-02 04:57:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-04-02 04:57:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-04-02 04:57:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-02 04:57:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-04-02 04:57:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-04-02 04:57:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-04-02 04:57:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-02 04:57:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 04:57:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-02 04:57:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 04:57:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433029850] [2023-04-02 04:57:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433029850] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 04:57:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 04:57:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-04-02 04:57:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779086353] [2023-04-02 04:57:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 04:57:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 04:57:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 04:57:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 04:57:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-04-02 04:57:17,973 INFO L87 Difference]: Start difference. First operand 3832 states and 4829 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 04:57:20,394 INFO L93 Difference]: Finished difference Result 7461 states and 9429 transitions. [2023-04-02 04:57:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 04:57:20,416 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 137 [2023-04-02 04:57:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 04:57:20,427 INFO L225 Difference]: With dead ends: 7461 [2023-04-02 04:57:20,427 INFO L226 Difference]: Without dead ends: 3850 [2023-04-02 04:57:20,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2023-04-02 04:57:20,433 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1179 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-04-02 04:57:20,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 89 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-04-02 04:57:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2023-04-02 04:57:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3832. [2023-04-02 04:57:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 2722 states have (on average 1.2795738427626746) internal successors, (3483), 2787 states have internal predecessors, (3483), 636 states have call successors, (636), 421 states have call predecessors, (636), 473 states have return successors, (705), 623 states have call predecessors, (705), 635 states have call successors, (705) [2023-04-02 04:57:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4824 transitions. [2023-04-02 04:57:21,296 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4824 transitions. Word has length 137 [2023-04-02 04:57:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 04:57:21,296 INFO L495 AbstractCegarLoop]: Abstraction has 3832 states and 4824 transitions. [2023-04-02 04:57:21,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (21), 12 states have call predecessors, (21), 3 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2023-04-02 04:57:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4824 transitions. [2023-04-02 04:57:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-04-02 04:57:21,298 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 04:57:21,298 INFO L195 NwaCegarLoop]: 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] [2023-04-02 04:57:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-04-02 04:57:21,298 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 04:57:21,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 04:57:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1329150959, now seen corresponding path program 1 times [2023-04-02 04:57:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 04:57:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346619258] [2023-04-02 04:57:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 04:57:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 04:57:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:57:21,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 04:57:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 04:57:21,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 04:57:21,478 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 04:57:21,480 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 04:57:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-04-02 04:57:21,484 INFO L445 BasicCegarLoop]: Path program 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] [2023-04-02 04:57:21,486 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 04:57:21,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 04:57:21 BoogieIcfgContainer [2023-04-02 04:57:21,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 04:57:21,614 INFO L158 Benchmark]: Toolchain (without parser) took 75745.14ms. Allocated memory was 264.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 224.2MB in the beginning and 995.2MB in the end (delta: -771.0MB). Peak memory consumption was 411.8MB. Max. memory is 8.0GB. [2023-04-02 04:57:21,614 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 04:57:21,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.15ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 206.1MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-04-02 04:57:21,614 INFO L158 Benchmark]: Boogie Preprocessor took 40.02ms. Allocated memory is still 264.2MB. Free memory was 206.1MB in the beginning and 203.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-02 04:57:21,615 INFO L158 Benchmark]: RCFGBuilder took 709.05ms. Allocated memory is still 264.2MB. Free memory was 203.4MB in the beginning and 167.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-04-02 04:57:21,615 INFO L158 Benchmark]: TraceAbstraction took 74769.29ms. Allocated memory was 264.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 167.3MB in the beginning and 995.2MB in the end (delta: -827.8MB). Peak memory consumption was 355.2MB. Max. memory is 8.0GB. [2023-04-02 04:57:21,618 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.15ms. Allocated memory is still 264.2MB. Free memory was 223.8MB in the beginning and 206.1MB in the end (delta: 17.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.02ms. Allocated memory is still 264.2MB. Free memory was 206.1MB in the beginning and 203.4MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.05ms. Allocated memory is still 264.2MB. Free memory was 203.4MB in the beginning and 167.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 74769.29ms. Allocated memory was 264.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 167.3MB in the beginning and 995.2MB in the end (delta: -827.8MB). Peak memory consumption was 355.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [\old(active_side_History_0)=2080, \old(active_side_History_1)=2071, \old(active_side_History_2)=2067, \old(cs1)=2089, \old(cs1_new)=2070, \old(cs1_old)=2050, \old(cs2)=2059, \old(cs2_new)=2088, \old(cs2_old)=2069, \old(manual_selection_History_0)=2086, \old(manual_selection_History_1)=2053, \old(manual_selection_History_2)=2049, \old(nomsg)=2075, \old(s1p)=2087, \old(s1p_new)=2073, \old(s1p_old)=2057, \old(s1s1)=2066, \old(s1s1_new)=2076, \old(s1s1_old)=2092, \old(s1s2)=2055, \old(s1s2_new)=2063, \old(s1s2_old)=2061, \old(s2p)=2064, \old(s2p_new)=2081, \old(s2p_old)=2093, \old(s2s1)=2072, \old(s2s1_new)=2062, \old(s2s1_old)=2083, \old(s2s2)=2051, \old(s2s2_new)=2060, \old(s2s2_old)=2078, \old(side1Failed)=31, \old(side1Failed_History_0)=6, \old(side1Failed_History_1)=29, \old(side1Failed_History_2)=43, \old(side1_written)=2082, \old(side2Failed)=8, \old(side2Failed_History_0)=4, \old(side2Failed_History_1)=36, \old(side2Failed_History_2)=26, \old(side2_written)=2065, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side2_written=4] [L197] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1_written=-3, side2_written=4] [L200] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1_written=-3, side2Failed_History_0=0, side2_written=4] [L203] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1_written=-3, side2Failed_History_0=0, side2_written=4] [L206] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1_written=-3, side2Failed_History_0=0, side2_written=4] [L209] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=-3, side2Failed_History_0=0, side2_written=4] [L212] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=4] [L215] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=4] [L218] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=4] [L221] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2_written=4] [L224] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L227] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L563] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L563] i2 = init() [L564] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L58] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L564] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L582] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L584] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, tmp=-1] [L257] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=-1, 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, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=-1, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, val=-1] [L257] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, tmp=-1] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, tmp=-1] [L584] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L585] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=20, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, val=0] [L276] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L290] COND TRUE (int )side1 == (int )side2 [L291] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_0=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-3, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] 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(side1Failed)=20, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=-3, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_0=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L585] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L586] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=37, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, \old(val)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, \old(val)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4, val=0] [L333] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, 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=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, 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=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L347] COND TRUE (int )side1 == (int )side2 [L348] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, 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=-1, manual_selection_History_0=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=4] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=37, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=4, 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=-1, manual_selection_History_0=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L587] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L394] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L397] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L400] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L408] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L417] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \old(val)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, val=0] [L417] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=-2] [L587] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L604] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L447] COND TRUE ! side1Failed [L448] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L455] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, 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, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \result=512, active_side_History_0=0, 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, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=512, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \result=2048, active_side_History_0=0, 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, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=2048, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \result=768, active_side_History_0=0, 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, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=768, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, \result=256, active_side_History_0=0, 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, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=256, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L604] c1 = check() [L605] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=0, active_side_History_0=0, 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=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L617] 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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L619] reach_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(side1Failed)=0, \old(side1Failed_History_0)=0, \old(side1Failed_History_1)=0, \old(side1Failed_History_2)=0, \old(side1_written)=0, \old(side2Failed)=0, \old(side2Failed_History_0)=0, \old(side2Failed_History_1)=0, \old(side2Failed_History_2)=0, \old(side2_written)=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31320 SdHoareTripleChecker+Valid, 29.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30767 mSDsluCounter, 3125 SdHoareTripleChecker+Invalid, 26.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2439 mSDsCounter, 9292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41841 IncrementalHoareTripleChecker+Invalid, 51133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9292 mSolverCounterUnsat, 686 mSDtfsCounter, 41841 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 722 SyntacticMatches, 2 SemanticMatches, 713 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4438 ImplicationChecksByTransitivity, 24.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3926occurred in iteration=20, InterpolantAutomatonStates: 503, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 3064 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2776 NumberOfCodeBlocks, 2776 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 10372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 187/187 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-02 04:57:21,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...