/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:32:19,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:32:19,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:32:19,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:32:19,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:32:19,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:32:19,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:32:19,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:32:19,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:32:19,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:32:19,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:32:19,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:32:19,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:32:19,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:32:19,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:32:19,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:32:19,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:32:19,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:32:19,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:32:19,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:32:19,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:32:19,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:32:19,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:32:19,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:32:19,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:32:19,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:32:19,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:32:19,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:32:19,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:32:19,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:32:19,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:32:19,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:32:19,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:32:19,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:32:19,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:32:19,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:32:19,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:32:19,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:32:19,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:32:19,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:32:19,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:32:19,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:32:19,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:32:19,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:32:19,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:32:19,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:32:19,304 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:32:19,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:32:19,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:32:19,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:32:19,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:32:19,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:32:19,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:32:19,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:32:19,306 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:32:19,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:32:19,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:32:19,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:32:19,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:32:19,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:19,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:32:19,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:32:19,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:32:19,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:32:19,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:32:19,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:32:19,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:32:19,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/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 [2021-01-06 19:32:19,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:32:19,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:32:19,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:32:19,751 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:32:19,752 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:32:19,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:19,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7bda5e45c/bec9fca90bc34ec2b8469b3c92a16b1c/FLAGfa1a44a91 [2021-01-06 19:32:20,559 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:32:20,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:20,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7bda5e45c/bec9fca90bc34ec2b8469b3c92a16b1c/FLAGfa1a44a91 [2021-01-06 19:32:20,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7bda5e45c/bec9fca90bc34ec2b8469b3c92a16b1c [2021-01-06 19:32:20,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:32:20,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:32:20,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:20,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:32:20,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:32:20,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:20" (1/1) ... [2021-01-06 19:32:20,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9517f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:20, skipping insertion in model container [2021-01-06 19:32:20,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:20" (1/1) ... [2021-01-06 19:32:20,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:32:20,904 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~0,] left hand side expression in assignment: lhs: VariableLHS[~side1~0,] left hand side expression in assignment: lhs: VariableLHS[~side2~0,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~1,] left hand side expression in assignment: lhs: VariableLHS[~side1Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~1,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~1,] left hand side expression in assignment: lhs: VariableLHS[~side2~1,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~2,] left hand side expression in assignment: lhs: VariableLHS[~side2Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~1,] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~1,] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~2,] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~side1~2,] left hand side expression in assignment: lhs: VariableLHS[~side2~2,] left hand side expression in assignment: lhs: VariableLHS[~side1~2,] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~2,] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~side1Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:32:21,173 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-01-06 19:32:21,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:21,198 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~0,] left hand side expression in assignment: lhs: VariableLHS[~side1~0,] left hand side expression in assignment: lhs: VariableLHS[~side2~0,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~1,] left hand side expression in assignment: lhs: VariableLHS[~side1Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~1,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~next_state~0,] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~1,] left hand side expression in assignment: lhs: VariableLHS[~side2~1,] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~2,] left hand side expression in assignment: lhs: VariableLHS[~side2Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1~1,] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~1,] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection~2,] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~next_state~1,] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~side1~2,] left hand side expression in assignment: lhs: VariableLHS[~side2~2,] left hand side expression in assignment: lhs: VariableLHS[~side1~2,] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2~2,] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~active_side~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~side1Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2_written~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side1Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~side2Failed_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~active_side_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~manual_selection_History_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~cs1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~cs2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2s2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s1p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s2p_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:32:21,331 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2021-01-06 19:32:21,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:21,364 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:32:21,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21 WrapperNode [2021-01-06 19:32:21,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:21,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:21,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:32:21,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:32:21,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:21,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:32:21,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:32:21,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:32:21,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... [2021-01-06 19:32:21,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:32:21,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:32:21,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:32:21,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:32:21,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:32:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:32:21,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:32:21,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:32:22,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:32:22,945 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2021-01-06 19:32:22,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:22 BoogieIcfgContainer [2021-01-06 19:32:22,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:32:22,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:32:22,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:32:22,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:32:22,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:32:20" (1/3) ... [2021-01-06 19:32:22,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaa28b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:22, skipping insertion in model container [2021-01-06 19:32:22,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:21" (2/3) ... [2021-01-06 19:32:22,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaa28b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:22, skipping insertion in model container [2021-01-06 19:32:22,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:22" (3/3) ... [2021-01-06 19:32:22,958 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:22,964 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:32:22,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2021-01-06 19:32:22,989 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-01-06 19:32:23,020 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:32:23,021 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:32:23,021 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:32:23,021 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:32:23,021 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:32:23,022 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:32:23,022 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:32:23,022 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:32:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2021-01-06 19:32:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:32:23,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,076 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2021-01-06 19:32:23,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511302104] [2021-01-06 19:32:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:23,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511302104] [2021-01-06 19:32:23,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:23,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:23,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366776273] [2021-01-06 19:32:23,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:32:23,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:32:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:32:23,436 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 2 states. [2021-01-06 19:32:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:23,489 INFO L93 Difference]: Finished difference Result 574 states and 893 transitions. [2021-01-06 19:32:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:32:23,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:32:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:23,506 INFO L225 Difference]: With dead ends: 574 [2021-01-06 19:32:23,507 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 19:32:23,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:32:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 19:32:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-01-06 19:32:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2021-01-06 19:32:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2021-01-06 19:32:23,580 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 33 [2021-01-06 19:32:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:23,581 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2021-01-06 19:32:23,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:32:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2021-01-06 19:32:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:32:23,583 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:32:23,584 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2021-01-06 19:32:23,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149166005] [2021-01-06 19:32:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:23,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149166005] [2021-01-06 19:32:23,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:23,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:23,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415912350] [2021-01-06 19:32:23,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:23,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:23,735 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2021-01-06 19:32:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:23,845 INFO L93 Difference]: Finished difference Result 568 states and 824 transitions. [2021-01-06 19:32:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:23,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2021-01-06 19:32:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:23,854 INFO L225 Difference]: With dead ends: 568 [2021-01-06 19:32:23,854 INFO L226 Difference]: Without dead ends: 291 [2021-01-06 19:32:23,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-01-06 19:32:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-01-06 19:32:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2021-01-06 19:32:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2021-01-06 19:32:23,903 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 33 [2021-01-06 19:32:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:23,906 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2021-01-06 19:32:23,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2021-01-06 19:32:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 19:32:23,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:32:23,911 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,912 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2021-01-06 19:32:23,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549110718] [2021-01-06 19:32:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:24,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549110718] [2021-01-06 19:32:24,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:24,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835417235] [2021-01-06 19:32:24,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:24,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:24,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,071 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand 3 states. [2021-01-06 19:32:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,143 INFO L93 Difference]: Finished difference Result 599 states and 859 transitions. [2021-01-06 19:32:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:24,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 19:32:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,146 INFO L225 Difference]: With dead ends: 599 [2021-01-06 19:32:24,147 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 19:32:24,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 19:32:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 267. [2021-01-06 19:32:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2021-01-06 19:32:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2021-01-06 19:32:24,169 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 44 [2021-01-06 19:32:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:24,175 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2021-01-06 19:32:24,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2021-01-06 19:32:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 19:32:24,181 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:24,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:24,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:32:24,183 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash -777659854, now seen corresponding path program 1 times [2021-01-06 19:32:24,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:24,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610618964] [2021-01-06 19:32:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:24,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610618964] [2021-01-06 19:32:24,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:24,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324343099] [2021-01-06 19:32:24,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:24,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,315 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand 3 states. [2021-01-06 19:32:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,355 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2021-01-06 19:32:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:24,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 19:32:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,359 INFO L225 Difference]: With dead ends: 744 [2021-01-06 19:32:24,360 INFO L226 Difference]: Without dead ends: 494 [2021-01-06 19:32:24,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-01-06 19:32:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 300. [2021-01-06 19:32:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 19:32:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2021-01-06 19:32:24,375 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 53 [2021-01-06 19:32:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:24,375 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2021-01-06 19:32:24,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2021-01-06 19:32:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:32:24,377 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:24,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:24,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:32:24,378 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2137834776, now seen corresponding path program 1 times [2021-01-06 19:32:24,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:24,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921408076] [2021-01-06 19:32:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:24,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921408076] [2021-01-06 19:32:24,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:24,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717391440] [2021-01-06 19:32:24,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:24,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,455 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand 3 states. [2021-01-06 19:32:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,495 INFO L93 Difference]: Finished difference Result 822 states and 1175 transitions. [2021-01-06 19:32:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:24,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-06 19:32:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,499 INFO L225 Difference]: With dead ends: 822 [2021-01-06 19:32:24,500 INFO L226 Difference]: Without dead ends: 539 [2021-01-06 19:32:24,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-01-06 19:32:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 321. [2021-01-06 19:32:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2021-01-06 19:32:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2021-01-06 19:32:24,535 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 54 [2021-01-06 19:32:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:24,536 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2021-01-06 19:32:24,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2021-01-06 19:32:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:32:24,540 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:24,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:24,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:32:24,541 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:24,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1457776406, now seen corresponding path program 1 times [2021-01-06 19:32:24,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:24,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947737503] [2021-01-06 19:32:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:24,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947737503] [2021-01-06 19:32:24,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:24,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613483032] [2021-01-06 19:32:24,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:24,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:24,743 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand 5 states. [2021-01-06 19:32:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,032 INFO L93 Difference]: Finished difference Result 1003 states and 1436 transitions. [2021-01-06 19:32:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:25,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2021-01-06 19:32:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,038 INFO L225 Difference]: With dead ends: 1003 [2021-01-06 19:32:25,038 INFO L226 Difference]: Without dead ends: 699 [2021-01-06 19:32:25,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:32:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-06 19:32:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2021-01-06 19:32:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2021-01-06 19:32:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 592 transitions. [2021-01-06 19:32:25,063 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 592 transitions. Word has length 54 [2021-01-06 19:32:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,063 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 592 transitions. [2021-01-06 19:32:25,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 592 transitions. [2021-01-06 19:32:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 19:32:25,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:32:25,065 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash -588423898, now seen corresponding path program 1 times [2021-01-06 19:32:25,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987106399] [2021-01-06 19:32:25,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:25,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987106399] [2021-01-06 19:32:25,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:25,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299647114] [2021-01-06 19:32:25,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:25,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:25,161 INFO L87 Difference]: Start difference. First operand 419 states and 592 transitions. Second operand 5 states. [2021-01-06 19:32:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,415 INFO L93 Difference]: Finished difference Result 1003 states and 1428 transitions. [2021-01-06 19:32:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:25,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2021-01-06 19:32:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,420 INFO L225 Difference]: With dead ends: 1003 [2021-01-06 19:32:25,420 INFO L226 Difference]: Without dead ends: 699 [2021-01-06 19:32:25,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:32:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-06 19:32:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2021-01-06 19:32:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2021-01-06 19:32:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 588 transitions. [2021-01-06 19:32:25,466 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 588 transitions. Word has length 55 [2021-01-06 19:32:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,466 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 588 transitions. [2021-01-06 19:32:25,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 588 transitions. [2021-01-06 19:32:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 19:32:25,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:32:25,468 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1072428279, now seen corresponding path program 1 times [2021-01-06 19:32:25,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870561299] [2021-01-06 19:32:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:25,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870561299] [2021-01-06 19:32:25,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:25,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676637616] [2021-01-06 19:32:25,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:25,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,562 INFO L87 Difference]: Start difference. First operand 419 states and 588 transitions. Second operand 3 states. [2021-01-06 19:32:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,599 INFO L93 Difference]: Finished difference Result 843 states and 1199 transitions. [2021-01-06 19:32:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:25,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-01-06 19:32:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,603 INFO L225 Difference]: With dead ends: 843 [2021-01-06 19:32:25,603 INFO L226 Difference]: Without dead ends: 539 [2021-01-06 19:32:25,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-01-06 19:32:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 414. [2021-01-06 19:32:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2021-01-06 19:32:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 580 transitions. [2021-01-06 19:32:25,625 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 580 transitions. Word has length 56 [2021-01-06 19:32:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,626 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 580 transitions. [2021-01-06 19:32:25,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 580 transitions. [2021-01-06 19:32:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 19:32:25,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:32:25,627 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1887754801, now seen corresponding path program 1 times [2021-01-06 19:32:25,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265330231] [2021-01-06 19:32:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:25,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265330231] [2021-01-06 19:32:25,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:25,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135725314] [2021-01-06 19:32:25,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:25,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:25,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,706 INFO L87 Difference]: Start difference. First operand 414 states and 580 transitions. Second operand 3 states. [2021-01-06 19:32:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,791 INFO L93 Difference]: Finished difference Result 842 states and 1198 transitions. [2021-01-06 19:32:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:25,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-01-06 19:32:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,795 INFO L225 Difference]: With dead ends: 842 [2021-01-06 19:32:25,796 INFO L226 Difference]: Without dead ends: 543 [2021-01-06 19:32:25,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-01-06 19:32:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 394. [2021-01-06 19:32:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2021-01-06 19:32:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 548 transitions. [2021-01-06 19:32:25,818 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 548 transitions. Word has length 60 [2021-01-06 19:32:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,819 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 548 transitions. [2021-01-06 19:32:25,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 548 transitions. [2021-01-06 19:32:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:32:25,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:32:25,820 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash 803488295, now seen corresponding path program 1 times [2021-01-06 19:32:25,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984272633] [2021-01-06 19:32:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:25,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984272633] [2021-01-06 19:32:25,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:25,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136678792] [2021-01-06 19:32:25,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:25,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:25,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,888 INFO L87 Difference]: Start difference. First operand 394 states and 548 transitions. Second operand 3 states. [2021-01-06 19:32:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,953 INFO L93 Difference]: Finished difference Result 810 states and 1142 transitions. [2021-01-06 19:32:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:25,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 19:32:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,956 INFO L225 Difference]: With dead ends: 810 [2021-01-06 19:32:25,956 INFO L226 Difference]: Without dead ends: 531 [2021-01-06 19:32:25,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-01-06 19:32:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 382. [2021-01-06 19:32:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2021-01-06 19:32:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 530 transitions. [2021-01-06 19:32:25,979 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 530 transitions. Word has length 64 [2021-01-06 19:32:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,979 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 530 transitions. [2021-01-06 19:32:25,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 530 transitions. [2021-01-06 19:32:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:32:25,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:32:25,981 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -576016629, now seen corresponding path program 1 times [2021-01-06 19:32:25,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573266295] [2021-01-06 19:32:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:26,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573266295] [2021-01-06 19:32:26,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:26,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034609446] [2021-01-06 19:32:26,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:26,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:26,079 INFO L87 Difference]: Start difference. First operand 382 states and 530 transitions. Second operand 6 states. [2021-01-06 19:32:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,248 INFO L93 Difference]: Finished difference Result 1412 states and 1981 transitions. [2021-01-06 19:32:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:26,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2021-01-06 19:32:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:26,254 INFO L225 Difference]: With dead ends: 1412 [2021-01-06 19:32:26,254 INFO L226 Difference]: Without dead ends: 1145 [2021-01-06 19:32:26,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-01-06 19:32:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 403. [2021-01-06 19:32:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2021-01-06 19:32:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 554 transitions. [2021-01-06 19:32:26,285 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 554 transitions. Word has length 65 [2021-01-06 19:32:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:26,286 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 554 transitions. [2021-01-06 19:32:26,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 554 transitions. [2021-01-06 19:32:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:32:26,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:26,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:26,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:32:26,287 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash 30287562, now seen corresponding path program 1 times [2021-01-06 19:32:26,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:26,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529822385] [2021-01-06 19:32:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:26,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529822385] [2021-01-06 19:32:26,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:26,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693966434] [2021-01-06 19:32:26,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:26,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:26,360 INFO L87 Difference]: Start difference. First operand 403 states and 554 transitions. Second operand 3 states. [2021-01-06 19:32:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,450 INFO L93 Difference]: Finished difference Result 827 states and 1158 transitions. [2021-01-06 19:32:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:26,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:32:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:26,454 INFO L225 Difference]: With dead ends: 827 [2021-01-06 19:32:26,454 INFO L226 Difference]: Without dead ends: 560 [2021-01-06 19:32:26,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-01-06 19:32:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 383. [2021-01-06 19:32:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 19:32:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 522 transitions. [2021-01-06 19:32:26,483 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 522 transitions. Word has length 67 [2021-01-06 19:32:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:26,483 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 522 transitions. [2021-01-06 19:32:26,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 522 transitions. [2021-01-06 19:32:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:32:26,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:26,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:26,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:32:26,485 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:26,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1319402658, now seen corresponding path program 1 times [2021-01-06 19:32:26,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:26,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734408923] [2021-01-06 19:32:26,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:26,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734408923] [2021-01-06 19:32:26,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:26,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257921450] [2021-01-06 19:32:26,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:26,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:26,551 INFO L87 Difference]: Start difference. First operand 383 states and 522 transitions. Second operand 3 states. [2021-01-06 19:32:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,654 INFO L93 Difference]: Finished difference Result 795 states and 1102 transitions. [2021-01-06 19:32:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:26,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-06 19:32:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:26,658 INFO L225 Difference]: With dead ends: 795 [2021-01-06 19:32:26,658 INFO L226 Difference]: Without dead ends: 548 [2021-01-06 19:32:26,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-01-06 19:32:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 371. [2021-01-06 19:32:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2021-01-06 19:32:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions. [2021-01-06 19:32:26,691 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 71 [2021-01-06 19:32:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:26,691 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 504 transitions. [2021-01-06 19:32:26,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions. [2021-01-06 19:32:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:32:26,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:26,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:26,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:32:26,693 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2054231207, now seen corresponding path program 1 times [2021-01-06 19:32:26,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:26,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663174068] [2021-01-06 19:32:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:26,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663174068] [2021-01-06 19:32:26,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:32:26,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964150342] [2021-01-06 19:32:26,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:32:26,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:32:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:26,859 INFO L87 Difference]: Start difference. First operand 371 states and 504 transitions. Second operand 7 states. [2021-01-06 19:32:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:27,242 INFO L93 Difference]: Finished difference Result 1319 states and 1818 transitions. [2021-01-06 19:32:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:27,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2021-01-06 19:32:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:27,248 INFO L225 Difference]: With dead ends: 1319 [2021-01-06 19:32:27,248 INFO L226 Difference]: Without dead ends: 1084 [2021-01-06 19:32:27,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-01-06 19:32:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 392. [2021-01-06 19:32:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2021-01-06 19:32:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 527 transitions. [2021-01-06 19:32:27,288 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 527 transitions. Word has length 74 [2021-01-06 19:32:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:27,288 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 527 transitions. [2021-01-06 19:32:27,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:32:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 527 transitions. [2021-01-06 19:32:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:32:27,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:27,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:27,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:32:27,290 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -35466378, now seen corresponding path program 1 times [2021-01-06 19:32:27,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:27,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698122413] [2021-01-06 19:32:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:27,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698122413] [2021-01-06 19:32:27,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:27,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:27,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680345649] [2021-01-06 19:32:27,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:27,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:27,465 INFO L87 Difference]: Start difference. First operand 392 states and 527 transitions. Second operand 6 states. [2021-01-06 19:32:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:27,709 INFO L93 Difference]: Finished difference Result 1112 states and 1525 transitions. [2021-01-06 19:32:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:27,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2021-01-06 19:32:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:27,714 INFO L225 Difference]: With dead ends: 1112 [2021-01-06 19:32:27,715 INFO L226 Difference]: Without dead ends: 863 [2021-01-06 19:32:27,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-01-06 19:32:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 424. [2021-01-06 19:32:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2021-01-06 19:32:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 570 transitions. [2021-01-06 19:32:27,759 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 570 transitions. Word has length 74 [2021-01-06 19:32:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:27,759 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 570 transitions. [2021-01-06 19:32:27,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 570 transitions. [2021-01-06 19:32:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:32:27,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:27,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:27,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:32:27,761 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1972545423, now seen corresponding path program 1 times [2021-01-06 19:32:27,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:27,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867617914] [2021-01-06 19:32:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:27,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867617914] [2021-01-06 19:32:27,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:27,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:27,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333596457] [2021-01-06 19:32:27,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:27,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:27,839 INFO L87 Difference]: Start difference. First operand 424 states and 570 transitions. Second operand 4 states. [2021-01-06 19:32:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:27,998 INFO L93 Difference]: Finished difference Result 1099 states and 1491 transitions. [2021-01-06 19:32:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:27,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:32:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,003 INFO L225 Difference]: With dead ends: 1099 [2021-01-06 19:32:28,003 INFO L226 Difference]: Without dead ends: 840 [2021-01-06 19:32:28,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-01-06 19:32:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 637. [2021-01-06 19:32:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2021-01-06 19:32:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 846 transitions. [2021-01-06 19:32:28,087 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 846 transitions. Word has length 74 [2021-01-06 19:32:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,087 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 846 transitions. [2021-01-06 19:32:28,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 846 transitions. [2021-01-06 19:32:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:32:28,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:28,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:32:28,089 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 458372801, now seen corresponding path program 1 times [2021-01-06 19:32:28,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123209171] [2021-01-06 19:32:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:28,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123209171] [2021-01-06 19:32:28,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:28,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:28,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236757554] [2021-01-06 19:32:28,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:28,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:28,182 INFO L87 Difference]: Start difference. First operand 637 states and 846 transitions. Second operand 3 states. [2021-01-06 19:32:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:28,296 INFO L93 Difference]: Finished difference Result 1118 states and 1514 transitions. [2021-01-06 19:32:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:28,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:32:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,301 INFO L225 Difference]: With dead ends: 1118 [2021-01-06 19:32:28,301 INFO L226 Difference]: Without dead ends: 748 [2021-01-06 19:32:28,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-01-06 19:32:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 633. [2021-01-06 19:32:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2021-01-06 19:32:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 839 transitions. [2021-01-06 19:32:28,381 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 839 transitions. Word has length 75 [2021-01-06 19:32:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,381 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 839 transitions. [2021-01-06 19:32:28,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 839 transitions. [2021-01-06 19:32:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:32:28,384 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:28,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:32:28,384 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1558776470, now seen corresponding path program 1 times [2021-01-06 19:32:28,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163262054] [2021-01-06 19:32:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:28,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163262054] [2021-01-06 19:32:28,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:28,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:28,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434751237] [2021-01-06 19:32:28,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:28,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:28,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:28,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:28,472 INFO L87 Difference]: Start difference. First operand 633 states and 839 transitions. Second operand 4 states. [2021-01-06 19:32:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:28,729 INFO L93 Difference]: Finished difference Result 1425 states and 1907 transitions. [2021-01-06 19:32:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:28,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:32:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,738 INFO L225 Difference]: With dead ends: 1425 [2021-01-06 19:32:28,738 INFO L226 Difference]: Without dead ends: 1045 [2021-01-06 19:32:28,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-01-06 19:32:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 844. [2021-01-06 19:32:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2021-01-06 19:32:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1109 transitions. [2021-01-06 19:32:28,846 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1109 transitions. Word has length 76 [2021-01-06 19:32:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,847 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1109 transitions. [2021-01-06 19:32:28,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1109 transitions. [2021-01-06 19:32:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:32:28,849 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:28,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:32:28,849 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash -932876156, now seen corresponding path program 1 times [2021-01-06 19:32:28,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883053750] [2021-01-06 19:32:28,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:29,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883053750] [2021-01-06 19:32:29,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:29,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:29,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809301229] [2021-01-06 19:32:29,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:29,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:29,006 INFO L87 Difference]: Start difference. First operand 844 states and 1109 transitions. Second operand 6 states. [2021-01-06 19:32:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:29,606 INFO L93 Difference]: Finished difference Result 3164 states and 4201 transitions. [2021-01-06 19:32:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:29,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 19:32:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:29,620 INFO L225 Difference]: With dead ends: 3164 [2021-01-06 19:32:29,621 INFO L226 Difference]: Without dead ends: 2657 [2021-01-06 19:32:29,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2021-01-06 19:32:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 970. [2021-01-06 19:32:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-01-06 19:32:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1256 transitions. [2021-01-06 19:32:29,758 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1256 transitions. Word has length 76 [2021-01-06 19:32:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:29,758 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1256 transitions. [2021-01-06 19:32:29,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1256 transitions. [2021-01-06 19:32:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:32:29,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:29,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:29,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:32:29,760 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 542872594, now seen corresponding path program 1 times [2021-01-06 19:32:29,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:29,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58007813] [2021-01-06 19:32:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:29,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58007813] [2021-01-06 19:32:29,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:29,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:29,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793427291] [2021-01-06 19:32:29,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:29,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:29,826 INFO L87 Difference]: Start difference. First operand 970 states and 1256 transitions. Second operand 4 states. [2021-01-06 19:32:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:30,087 INFO L93 Difference]: Finished difference Result 2345 states and 3078 transitions. [2021-01-06 19:32:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:30,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 19:32:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:30,096 INFO L225 Difference]: With dead ends: 2345 [2021-01-06 19:32:30,096 INFO L226 Difference]: Without dead ends: 1790 [2021-01-06 19:32:30,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2021-01-06 19:32:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1311. [2021-01-06 19:32:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2021-01-06 19:32:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1691 transitions. [2021-01-06 19:32:30,245 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1691 transitions. Word has length 77 [2021-01-06 19:32:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:30,246 INFO L481 AbstractCegarLoop]: Abstraction has 1311 states and 1691 transitions. [2021-01-06 19:32:30,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1691 transitions. [2021-01-06 19:32:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:32:30,248 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:30,248 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:30,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:32:30,248 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash -871568132, now seen corresponding path program 1 times [2021-01-06 19:32:30,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:30,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951590347] [2021-01-06 19:32:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:30,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951590347] [2021-01-06 19:32:30,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:30,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:30,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381504027] [2021-01-06 19:32:30,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:30,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:30,287 INFO L87 Difference]: Start difference. First operand 1311 states and 1691 transitions. Second operand 3 states. [2021-01-06 19:32:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:30,575 INFO L93 Difference]: Finished difference Result 3105 states and 4022 transitions. [2021-01-06 19:32:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:30,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:32:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:30,585 INFO L225 Difference]: With dead ends: 3105 [2021-01-06 19:32:30,586 INFO L226 Difference]: Without dead ends: 2156 [2021-01-06 19:32:30,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-01-06 19:32:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1313. [2021-01-06 19:32:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2021-01-06 19:32:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1693 transitions. [2021-01-06 19:32:30,742 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1693 transitions. Word has length 78 [2021-01-06 19:32:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:30,742 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1693 transitions. [2021-01-06 19:32:30,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1693 transitions. [2021-01-06 19:32:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:32:30,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:30,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:30,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:32:30,745 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:30,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1539202707, now seen corresponding path program 1 times [2021-01-06 19:32:30,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:30,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689673105] [2021-01-06 19:32:30,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:30,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689673105] [2021-01-06 19:32:30,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:30,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:30,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641251353] [2021-01-06 19:32:30,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:30,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:30,902 INFO L87 Difference]: Start difference. First operand 1313 states and 1693 transitions. Second operand 6 states. [2021-01-06 19:32:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:31,322 INFO L93 Difference]: Finished difference Result 3105 states and 4111 transitions. [2021-01-06 19:32:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:31,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2021-01-06 19:32:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:31,333 INFO L225 Difference]: With dead ends: 3105 [2021-01-06 19:32:31,333 INFO L226 Difference]: Without dead ends: 2312 [2021-01-06 19:32:31,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2021-01-06 19:32:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1313. [2021-01-06 19:32:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2021-01-06 19:32:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1681 transitions. [2021-01-06 19:32:31,499 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1681 transitions. Word has length 79 [2021-01-06 19:32:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:31,499 INFO L481 AbstractCegarLoop]: Abstraction has 1313 states and 1681 transitions. [2021-01-06 19:32:31,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1681 transitions. [2021-01-06 19:32:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:32:31,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:31,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:31,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:32:31,502 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1856049885, now seen corresponding path program 1 times [2021-01-06 19:32:31,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:31,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906769884] [2021-01-06 19:32:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:31,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906769884] [2021-01-06 19:32:31,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:31,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:31,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213891832] [2021-01-06 19:32:31,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:31,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:31,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:31,572 INFO L87 Difference]: Start difference. First operand 1313 states and 1681 transitions. Second operand 4 states. [2021-01-06 19:32:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:31,768 INFO L93 Difference]: Finished difference Result 2621 states and 3380 transitions. [2021-01-06 19:32:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:31,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:32:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:31,775 INFO L225 Difference]: With dead ends: 2621 [2021-01-06 19:32:31,776 INFO L226 Difference]: Without dead ends: 1380 [2021-01-06 19:32:31,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:31,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2021-01-06 19:32:31,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1025. [2021-01-06 19:32:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2021-01-06 19:32:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1325 transitions. [2021-01-06 19:32:31,893 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1325 transitions. Word has length 79 [2021-01-06 19:32:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:31,894 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1325 transitions. [2021-01-06 19:32:31,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1325 transitions. [2021-01-06 19:32:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:32:31,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:31,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:31,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:32:31,896 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1593609901, now seen corresponding path program 1 times [2021-01-06 19:32:31,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:31,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016961698] [2021-01-06 19:32:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:31,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016961698] [2021-01-06 19:32:31,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:31,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:31,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863936805] [2021-01-06 19:32:31,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:31,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:31,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:31,971 INFO L87 Difference]: Start difference. First operand 1025 states and 1325 transitions. Second operand 3 states. [2021-01-06 19:32:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:32,261 INFO L93 Difference]: Finished difference Result 2427 states and 3157 transitions. [2021-01-06 19:32:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:32,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:32:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:32,269 INFO L225 Difference]: With dead ends: 2427 [2021-01-06 19:32:32,269 INFO L226 Difference]: Without dead ends: 1546 [2021-01-06 19:32:32,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2021-01-06 19:32:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1031. [2021-01-06 19:32:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2021-01-06 19:32:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1331 transitions. [2021-01-06 19:32:32,396 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1331 transitions. Word has length 80 [2021-01-06 19:32:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:32,396 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1331 transitions. [2021-01-06 19:32:32,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1331 transitions. [2021-01-06 19:32:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:32:32,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:32,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:32,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:32:32,398 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:32,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1333673785, now seen corresponding path program 1 times [2021-01-06 19:32:32,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:32,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540085859] [2021-01-06 19:32:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:32,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540085859] [2021-01-06 19:32:32,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:32,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:32,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494543738] [2021-01-06 19:32:32,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:32,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:32,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:32,473 INFO L87 Difference]: Start difference. First operand 1031 states and 1331 transitions. Second operand 4 states. [2021-01-06 19:32:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:32,719 INFO L93 Difference]: Finished difference Result 2375 states and 3081 transitions. [2021-01-06 19:32:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:32,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:32:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:32,726 INFO L225 Difference]: With dead ends: 2375 [2021-01-06 19:32:32,726 INFO L226 Difference]: Without dead ends: 1440 [2021-01-06 19:32:32,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2021-01-06 19:32:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 973. [2021-01-06 19:32:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2021-01-06 19:32:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1251 transitions. [2021-01-06 19:32:32,851 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1251 transitions. Word has length 80 [2021-01-06 19:32:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:32,852 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1251 transitions. [2021-01-06 19:32:32,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1251 transitions. [2021-01-06 19:32:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:32:32,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:32,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:32,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:32:32,854 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 426869325, now seen corresponding path program 1 times [2021-01-06 19:32:32,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:32,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523958275] [2021-01-06 19:32:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:32,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523958275] [2021-01-06 19:32:32,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:32,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:32,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840446219] [2021-01-06 19:32:32,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:32,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:32,996 INFO L87 Difference]: Start difference. First operand 973 states and 1251 transitions. Second operand 6 states. [2021-01-06 19:32:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:33,540 INFO L93 Difference]: Finished difference Result 3194 states and 4271 transitions. [2021-01-06 19:32:33,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:33,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2021-01-06 19:32:33,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:33,552 INFO L225 Difference]: With dead ends: 3194 [2021-01-06 19:32:33,552 INFO L226 Difference]: Without dead ends: 2412 [2021-01-06 19:32:33,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2021-01-06 19:32:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 961. [2021-01-06 19:32:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2021-01-06 19:32:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1239 transitions. [2021-01-06 19:32:33,698 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1239 transitions. Word has length 82 [2021-01-06 19:32:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:33,698 INFO L481 AbstractCegarLoop]: Abstraction has 961 states and 1239 transitions. [2021-01-06 19:32:33,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1239 transitions. [2021-01-06 19:32:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:32:33,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:33,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:33,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:32:33,700 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1753792748, now seen corresponding path program 1 times [2021-01-06 19:32:33,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:33,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110706921] [2021-01-06 19:32:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:33,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110706921] [2021-01-06 19:32:33,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:33,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:33,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956365750] [2021-01-06 19:32:33,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:33,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:33,793 INFO L87 Difference]: Start difference. First operand 961 states and 1239 transitions. Second operand 6 states. [2021-01-06 19:32:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,136 INFO L93 Difference]: Finished difference Result 1729 states and 2262 transitions. [2021-01-06 19:32:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:32:34,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2021-01-06 19:32:34,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,154 INFO L225 Difference]: With dead ends: 1729 [2021-01-06 19:32:34,154 INFO L226 Difference]: Without dead ends: 1727 [2021-01-06 19:32:34,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:32:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2021-01-06 19:32:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 963. [2021-01-06 19:32:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2021-01-06 19:32:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1241 transitions. [2021-01-06 19:32:34,289 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1241 transitions. Word has length 82 [2021-01-06 19:32:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,290 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 1241 transitions. [2021-01-06 19:32:34,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1241 transitions. [2021-01-06 19:32:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:32:34,291 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:32:34,291 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -565934258, now seen corresponding path program 1 times [2021-01-06 19:32:34,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052470644] [2021-01-06 19:32:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:34,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052470644] [2021-01-06 19:32:34,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:34,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627080230] [2021-01-06 19:32:34,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:34,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:34,382 INFO L87 Difference]: Start difference. First operand 963 states and 1241 transitions. Second operand 6 states. [2021-01-06 19:32:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,721 INFO L93 Difference]: Finished difference Result 2288 states and 3068 transitions. [2021-01-06 19:32:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:34,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2021-01-06 19:32:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,727 INFO L225 Difference]: With dead ends: 2288 [2021-01-06 19:32:34,727 INFO L226 Difference]: Without dead ends: 1504 [2021-01-06 19:32:34,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:32:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2021-01-06 19:32:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 969. [2021-01-06 19:32:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2021-01-06 19:32:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1247 transitions. [2021-01-06 19:32:34,925 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1247 transitions. Word has length 83 [2021-01-06 19:32:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,925 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1247 transitions. [2021-01-06 19:32:34,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1247 transitions. [2021-01-06 19:32:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:32:34,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,929 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:34,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:32:34,929 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1124853435, now seen corresponding path program 1 times [2021-01-06 19:32:34,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213213474] [2021-01-06 19:32:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:35,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213213474] [2021-01-06 19:32:35,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145429656] [2021-01-06 19:32:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:32:35,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:32:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:32:35,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:32:35,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-01-06 19:32:35,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407097526] [2021-01-06 19:32:35,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:35,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:32:35,726 INFO L87 Difference]: Start difference. First operand 969 states and 1247 transitions. Second operand 6 states. [2021-01-06 19:32:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,328 INFO L93 Difference]: Finished difference Result 2493 states and 3319 transitions. [2021-01-06 19:32:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:36,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2021-01-06 19:32:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,333 INFO L225 Difference]: With dead ends: 2493 [2021-01-06 19:32:36,333 INFO L226 Difference]: Without dead ends: 1703 [2021-01-06 19:32:36,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:32:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2021-01-06 19:32:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 969. [2021-01-06 19:32:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2021-01-06 19:32:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1246 transitions. [2021-01-06 19:32:36,532 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1246 transitions. Word has length 133 [2021-01-06 19:32:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,532 INFO L481 AbstractCegarLoop]: Abstraction has 969 states and 1246 transitions. [2021-01-06 19:32:36,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1246 transitions. [2021-01-06 19:32:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-06 19:32:36,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,536 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:36,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-06 19:32:36,750 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash 721735670, now seen corresponding path program 1 times [2021-01-06 19:32:36,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613443962] [2021-01-06 19:32:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613443962] [2021-01-06 19:32:36,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025752245] [2021-01-06 19:32:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:37,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:32:37,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:32:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:37,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:32:37,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-01-06 19:32:37,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490095772] [2021-01-06 19:32:37,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:32:37,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:32:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:37,419 INFO L87 Difference]: Start difference. First operand 969 states and 1246 transitions. Second operand 13 states. [2021-01-06 19:32:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:51,490 INFO L93 Difference]: Finished difference Result 16611 states and 22045 transitions. [2021-01-06 19:32:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2021-01-06 19:32:51,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2021-01-06 19:32:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:51,525 INFO L225 Difference]: With dead ends: 16611 [2021-01-06 19:32:51,526 INFO L226 Difference]: Without dead ends: 15827 [2021-01-06 19:32:51,558 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29009 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2021-01-06 19:32:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15827 states. [2021-01-06 19:32:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15827 to 2668. [2021-01-06 19:32:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2668 states. [2021-01-06 19:32:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3449 transitions. [2021-01-06 19:32:52,278 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3449 transitions. Word has length 137 [2021-01-06 19:32:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:52,279 INFO L481 AbstractCegarLoop]: Abstraction has 2668 states and 3449 transitions. [2021-01-06 19:32:52,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:32:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3449 transitions. [2021-01-06 19:32:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:32:52,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:52,286 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:52,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:52,502 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1033833522, now seen corresponding path program 1 times [2021-01-06 19:32:52,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:52,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722681075] [2021-01-06 19:32:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:32:52,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722681075] [2021-01-06 19:32:52,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:52,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:32:52,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113067294] [2021-01-06 19:32:52,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:32:52,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:32:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:52,680 INFO L87 Difference]: Start difference. First operand 2668 states and 3449 transitions. Second operand 7 states. [2021-01-06 19:32:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:53,783 INFO L93 Difference]: Finished difference Result 7058 states and 9434 transitions. [2021-01-06 19:32:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:53,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2021-01-06 19:32:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:53,793 INFO L225 Difference]: With dead ends: 7058 [2021-01-06 19:32:53,794 INFO L226 Difference]: Without dead ends: 4609 [2021-01-06 19:32:53,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2021-01-06 19:32:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 2325. [2021-01-06 19:32:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2021-01-06 19:32:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3008 transitions. [2021-01-06 19:32:54,215 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3008 transitions. Word has length 138 [2021-01-06 19:32:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:54,216 INFO L481 AbstractCegarLoop]: Abstraction has 2325 states and 3008 transitions. [2021-01-06 19:32:54,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:32:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3008 transitions. [2021-01-06 19:32:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 19:32:54,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:54,225 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:54,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:32:54,226 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1873250942, now seen corresponding path program 1 times [2021-01-06 19:32:54,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:54,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096009764] [2021-01-06 19:32:54,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-01-06 19:32:54,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096009764] [2021-01-06 19:32:54,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:54,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:32:54,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323032826] [2021-01-06 19:32:54,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:32:54,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:32:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:54,392 INFO L87 Difference]: Start difference. First operand 2325 states and 3008 transitions. Second operand 7 states. [2021-01-06 19:32:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:56,761 INFO L93 Difference]: Finished difference Result 13887 states and 18520 transitions. [2021-01-06 19:32:56,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:32:56,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2021-01-06 19:32:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:56,786 INFO L225 Difference]: With dead ends: 13887 [2021-01-06 19:32:56,786 INFO L226 Difference]: Without dead ends: 11821 [2021-01-06 19:32:56,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:32:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2021-01-06 19:32:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 2781. [2021-01-06 19:32:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2021-01-06 19:32:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3538 transitions. [2021-01-06 19:32:57,331 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3538 transitions. Word has length 139 [2021-01-06 19:32:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:57,331 INFO L481 AbstractCegarLoop]: Abstraction has 2781 states and 3538 transitions. [2021-01-06 19:32:57,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:32:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3538 transitions. [2021-01-06 19:32:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 19:32:57,338 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:57,338 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:57,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:32:57,339 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1119861603, now seen corresponding path program 1 times [2021-01-06 19:32:57,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:57,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361348367] [2021-01-06 19:32:57,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:32:57,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361348367] [2021-01-06 19:32:57,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:57,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:57,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32963689] [2021-01-06 19:32:57,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:57,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:57,467 INFO L87 Difference]: Start difference. First operand 2781 states and 3538 transitions. Second operand 4 states. [2021-01-06 19:32:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:57,829 INFO L93 Difference]: Finished difference Result 4915 states and 6288 transitions. [2021-01-06 19:32:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:57,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2021-01-06 19:32:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:57,835 INFO L225 Difference]: With dead ends: 4915 [2021-01-06 19:32:57,835 INFO L226 Difference]: Without dead ends: 2285 [2021-01-06 19:32:57,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2021-01-06 19:32:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2285. [2021-01-06 19:32:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2021-01-06 19:32:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2901 transitions. [2021-01-06 19:32:58,258 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2901 transitions. Word has length 140 [2021-01-06 19:32:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:58,258 INFO L481 AbstractCegarLoop]: Abstraction has 2285 states and 2901 transitions. [2021-01-06 19:32:58,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2901 transitions. [2021-01-06 19:32:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 19:32:58,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:58,264 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:32:58,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:32:58,264 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2051408537, now seen corresponding path program 1 times [2021-01-06 19:32:58,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:58,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957174389] [2021-01-06 19:32:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:58,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957174389] [2021-01-06 19:32:58,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855981269] [2021-01-06 19:32:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:58,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 19:32:58,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:32:58,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:32:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:59,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:32:59,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2021-01-06 19:32:59,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419755878] [2021-01-06 19:32:59,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 19:32:59,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 19:32:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:32:59,194 INFO L87 Difference]: Start difference. First operand 2285 states and 2901 transitions. Second operand 16 states. [2021-01-06 19:33:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:01,136 INFO L93 Difference]: Finished difference Result 6319 states and 8067 transitions. [2021-01-06 19:33:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 19:33:01,137 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2021-01-06 19:33:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:01,145 INFO L225 Difference]: With dead ends: 6319 [2021-01-06 19:33:01,145 INFO L226 Difference]: Without dead ends: 4243 [2021-01-06 19:33:01,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2021-01-06 19:33:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2021-01-06 19:33:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2535. [2021-01-06 19:33:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2021-01-06 19:33:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3212 transitions. [2021-01-06 19:33:01,749 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3212 transitions. Word has length 140 [2021-01-06 19:33:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:01,749 INFO L481 AbstractCegarLoop]: Abstraction has 2535 states and 3212 transitions. [2021-01-06 19:33:01,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 19:33:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3212 transitions. [2021-01-06 19:33:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 19:33:01,755 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:01,755 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:33:01,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-06 19:33:01,971 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash -90451941, now seen corresponding path program 1 times [2021-01-06 19:33:01,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:01,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6417542] [2021-01-06 19:33:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-01-06 19:33:02,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6417542] [2021-01-06 19:33:02,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:02,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:02,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519726485] [2021-01-06 19:33:02,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:02,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:02,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:02,079 INFO L87 Difference]: Start difference. First operand 2535 states and 3212 transitions. Second operand 5 states. [2021-01-06 19:33:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:02,504 INFO L93 Difference]: Finished difference Result 4786 states and 6108 transitions. [2021-01-06 19:33:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:02,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2021-01-06 19:33:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:02,509 INFO L225 Difference]: With dead ends: 4786 [2021-01-06 19:33:02,509 INFO L226 Difference]: Without dead ends: 2401 [2021-01-06 19:33:02,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-01-06 19:33:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2401. [2021-01-06 19:33:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2021-01-06 19:33:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3044 transitions. [2021-01-06 19:33:02,877 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3044 transitions. Word has length 140 [2021-01-06 19:33:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:02,877 INFO L481 AbstractCegarLoop]: Abstraction has 2401 states and 3044 transitions. [2021-01-06 19:33:02,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3044 transitions. [2021-01-06 19:33:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 19:33:02,881 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:02,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:33:02,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:33:02,882 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1205605747, now seen corresponding path program 1 times [2021-01-06 19:33:02,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:02,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107706363] [2021-01-06 19:33:02,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:03,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107706363] [2021-01-06 19:33:03,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103441479] [2021-01-06 19:33:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:03,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-06 19:33:03,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:03,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:33:03,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:33:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:03,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:03,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-01-06 19:33:03,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613416779] [2021-01-06 19:33:03,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:33:03,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:33:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:03,884 INFO L87 Difference]: Start difference. First operand 2401 states and 3044 transitions. Second operand 18 states. [2021-01-06 19:33:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:06,802 INFO L93 Difference]: Finished difference Result 6593 states and 8387 transitions. [2021-01-06 19:33:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 19:33:06,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2021-01-06 19:33:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:06,811 INFO L225 Difference]: With dead ends: 6593 [2021-01-06 19:33:06,811 INFO L226 Difference]: Without dead ends: 4401 [2021-01-06 19:33:06,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1579, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 19:33:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2021-01-06 19:33:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 2676. [2021-01-06 19:33:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2021-01-06 19:33:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3385 transitions. [2021-01-06 19:33:07,221 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3385 transitions. Word has length 141 [2021-01-06 19:33:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:07,221 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3385 transitions. [2021-01-06 19:33:07,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:33:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3385 transitions. [2021-01-06 19:33:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 19:33:07,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:07,226 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:33:07,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:07,440 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:07,441 INFO L82 PathProgramCache]: Analyzing trace with hash 582324145, now seen corresponding path program 1 times [2021-01-06 19:33:07,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:07,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742987665] [2021-01-06 19:33:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-01-06 19:33:07,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742987665] [2021-01-06 19:33:07,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:07,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:07,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401146891] [2021-01-06 19:33:07,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:07,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:07,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:07,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:07,511 INFO L87 Difference]: Start difference. First operand 2676 states and 3385 transitions. Second operand 4 states. [2021-01-06 19:33:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:08,008 INFO L93 Difference]: Finished difference Result 4995 states and 6358 transitions. [2021-01-06 19:33:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2021-01-06 19:33:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:08,012 INFO L225 Difference]: With dead ends: 4995 [2021-01-06 19:33:08,012 INFO L226 Difference]: Without dead ends: 2471 [2021-01-06 19:33:08,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-01-06 19:33:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2459. [2021-01-06 19:33:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2021-01-06 19:33:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3098 transitions. [2021-01-06 19:33:08,597 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3098 transitions. Word has length 141 [2021-01-06 19:33:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:08,597 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3098 transitions. [2021-01-06 19:33:08,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3098 transitions. [2021-01-06 19:33:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 19:33:08,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:08,602 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 19:33:08,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:33:08,602 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash 689093620, now seen corresponding path program 1 times [2021-01-06 19:33:08,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:08,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602219909] [2021-01-06 19:33:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:33:08,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:33:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:33:08,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:33:08,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:33:08,838 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:33:08,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:33:09,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:33:09 BoogieIcfgContainer [2021-01-06 19:33:09,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:33:09,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:33:09,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:33:09,087 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:33:09,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:22" (3/4) ... [2021-01-06 19:33:09,092 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:33:09,367 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c-witness.graphml [2021-01-06 19:33:09,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:33:09,369 INFO L168 Benchmark]: Toolchain (without parser) took 48540.85 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 124.3 MB in the beginning and 1.1 GB in the end (delta: -957.8 MB). Peak memory consumption was 242.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,369 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 151.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:33:09,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.78 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 106.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.57 ms. Allocated memory is still 151.0 MB. Free memory was 106.5 MB in the beginning and 101.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,370 INFO L168 Benchmark]: Boogie Preprocessor took 72.52 ms. Allocated memory is still 151.0 MB. Free memory was 101.6 MB in the beginning and 98.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,371 INFO L168 Benchmark]: RCFGBuilder took 1363.10 ms. Allocated memory is still 151.0 MB. Free memory was 97.9 MB in the beginning and 59.8 MB in the end (delta: 38.1 MB). Peak memory consumption was 37.5 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,371 INFO L168 Benchmark]: TraceAbstraction took 46136.39 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 59.3 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 131.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,372 INFO L168 Benchmark]: Witness Printer took 280.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:33:09,374 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.17 ms. Allocated memory is still 151.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 536.78 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 106.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 142.57 ms. Allocated memory is still 151.0 MB. Free memory was 106.5 MB in the beginning and 101.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.52 ms. Allocated memory is still 151.0 MB. Free memory was 101.6 MB in the beginning and 98.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1363.10 ms. Allocated memory is still 151.0 MB. Free memory was 97.9 MB in the beginning and 59.8 MB in the end (delta: 38.1 MB). Peak memory consumption was 37.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 46136.39 ms. Allocated memory was 151.0 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 59.3 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 131.1 MB. Max. memory is 8.0 GB. * Witness Printer took 280.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 611]: 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 [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] i2 = init() [L58] COND FALSE !(!cond) VAL [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=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [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 [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=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [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=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=3, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=2, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=-3, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=6, cs1_old=-1, cs2=0, cs2_new=6, cs2_old=-1, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L529] return (1); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L609] COND FALSE !(! arg) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=6, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=6, cs2=0, cs2_new=-1, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=6, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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() [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=6, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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() [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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 [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=6, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L596] c1 = check() [L609] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=6, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 295 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 45.8s, OverallIterations: 38, TraceHistogramMax: 2, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16903 SDtfs, 38293 SDslu, 41566 SDs, 0 SdLazy, 7059 SolverSat, 554 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 724 SyntacticMatches, 15 SemanticMatches, 494 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29874 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2781occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 40956 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3820 NumberOfCodeBlocks, 3820 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3637 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389960 SizeOfPredicates, 24 NumberOfNonLiveVariables, 3103 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 41 InterpolantComputations, 34 PerfectInterpolantSequences, 390/513 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...