/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_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:38:32,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:38:32,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:38:32,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:38:32,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:38:32,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:38:32,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:38:32,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:38:32,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:38:32,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:38:32,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:38:32,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:38:32,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:38:32,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:38:32,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:38:32,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:38:32,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:38:32,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:38:32,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:38:32,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:38:32,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:38:32,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:38:32,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:38:32,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:38:32,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:38:32,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:38:32,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:38:32,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:38:32,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:38:32,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:38:32,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:38:32,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:38:32,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:38:32,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:38:32,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:38:32,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:38:32,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:38:32,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:38:32,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:38:32,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:38:32,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:38:32,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:38:32,635 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:38:32,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:38:32,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:38:32,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:38:32,640 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:38:32,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:38:32,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:38:32,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:38:32,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:38:32,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:38:32,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:38:32,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:38:32,643 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:38:32,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:38:32,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:38:32,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:38:32,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:38:32,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:38:32,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:38:32,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:38:32,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:38:32,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:38:32,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:38:32,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:38:32,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:38:32,646 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 [2020-12-23 09:38:33,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:38:33,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:38:33,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:38:33,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:38:33,129 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:38:33,130 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_2.ufo.BOUNDED-10.pals.c [2020-12-23 09:38:33,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a85ee00b3/daaf29bef50642828a08c5d8f7dd5ea3/FLAGb05380125 [2020-12-23 09:38:33,907 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:38:33,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2020-12-23 09:38:33,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a85ee00b3/daaf29bef50642828a08c5d8f7dd5ea3/FLAGb05380125 [2020-12-23 09:38:34,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a85ee00b3/daaf29bef50642828a08c5d8f7dd5ea3 [2020-12-23 09:38:34,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:38:34,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:38:34,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:38:34,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:38:34,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:38:34,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32df33b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34, skipping insertion in model container [2020-12-23 09:38:34,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:38:34,260 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[~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,] [2020-12-23 09:38:34,585 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_2.ufo.BOUNDED-10.pals.c[14702,14715] [2020-12-23 09:38:34,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:38:34,601 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[~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,] [2020-12-23 09:38:34,686 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_2.ufo.BOUNDED-10.pals.c[14702,14715] [2020-12-23 09:38:34,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:38:34,718 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:38:34,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34 WrapperNode [2020-12-23 09:38:34,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:38:34,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:38:34,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:38:34,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:38:34,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:38:34,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:38:34,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:38:34,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:38:34,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (1/1) ... [2020-12-23 09:38:34,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:38:34,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:38:34,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:38:34,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:38:34,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (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 [2020-12-23 09:38:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:38:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:38:35,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:38:35,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:38:36,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:38:36,421 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2020-12-23 09:38:36,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:38:36 BoogieIcfgContainer [2020-12-23 09:38:36,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:38:36,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:38:36,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:38:36,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:38:36,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:38:34" (1/3) ... [2020-12-23 09:38:36,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581ac1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:38:36, skipping insertion in model container [2020-12-23 09:38:36,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:38:34" (2/3) ... [2020-12-23 09:38:36,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581ac1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:38:36, skipping insertion in model container [2020-12-23 09:38:36,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:38:36" (3/3) ... [2020-12-23 09:38:36,433 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2020-12-23 09:38:36,440 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:38:36,445 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2020-12-23 09:38:36,464 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2020-12-23 09:38:36,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:38:36,497 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:38:36,497 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:38:36,498 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:38:36,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:38:36,498 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:38:36,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:38:36,498 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:38:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states. [2020-12-23 09:38:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 09:38:36,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:36,548 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] [2020-12-23 09:38:36,549 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]=== [2020-12-23 09:38:36,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2020-12-23 09:38:36,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:36,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112177781] [2020-12-23 09:38:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:36,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112177781] [2020-12-23 09:38:36,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:36,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:38:36,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713115567] [2020-12-23 09:38:36,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 09:38:36,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 09:38:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:38:36,850 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 2 states. [2020-12-23 09:38:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:36,938 INFO L93 Difference]: Finished difference Result 578 states and 901 transitions. [2020-12-23 09:38:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 09:38:36,940 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2020-12-23 09:38:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:36,974 INFO L225 Difference]: With dead ends: 578 [2020-12-23 09:38:36,974 INFO L226 Difference]: Without dead ends: 293 [2020-12-23 09:38:36,988 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 [2020-12-23 09:38:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-12-23 09:38:37,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2020-12-23 09:38:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-12-23 09:38:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 429 transitions. [2020-12-23 09:38:37,096 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 429 transitions. Word has length 33 [2020-12-23 09:38:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:37,097 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 429 transitions. [2020-12-23 09:38:37,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 09:38:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 429 transitions. [2020-12-23 09:38:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 09:38:37,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:37,100 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] [2020-12-23 09:38:37,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:38:37,102 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]=== [2020-12-23 09:38:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2020-12-23 09:38:37,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:37,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246474885] [2020-12-23 09:38:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:37,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246474885] [2020-12-23 09:38:37,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:37,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:37,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712601954] [2020-12-23 09:38:37,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:37,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:37,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:37,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:37,254 INFO L87 Difference]: Start difference. First operand 293 states and 429 transitions. Second operand 4 states. [2020-12-23 09:38:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:37,330 INFO L93 Difference]: Finished difference Result 572 states and 832 transitions. [2020-12-23 09:38:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:37,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-23 09:38:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:37,333 INFO L225 Difference]: With dead ends: 572 [2020-12-23 09:38:37,333 INFO L226 Difference]: Without dead ends: 293 [2020-12-23 09:38:37,336 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 [2020-12-23 09:38:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-12-23 09:38:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2020-12-23 09:38:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2020-12-23 09:38:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 417 transitions. [2020-12-23 09:38:37,351 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 417 transitions. Word has length 33 [2020-12-23 09:38:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:37,351 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 417 transitions. [2020-12-23 09:38:37,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 417 transitions. [2020-12-23 09:38:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 09:38:37,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:37,353 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] [2020-12-23 09:38:37,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:38:37,354 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]=== [2020-12-23 09:38:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2020-12-23 09:38:37,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:37,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039622890] [2020-12-23 09:38:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:37,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039622890] [2020-12-23 09:38:37,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:37,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:37,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851046413] [2020-12-23 09:38:37,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:37,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:37,518 INFO L87 Difference]: Start difference. First operand 293 states and 417 transitions. Second operand 3 states. [2020-12-23 09:38:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:37,579 INFO L93 Difference]: Finished difference Result 603 states and 867 transitions. [2020-12-23 09:38:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:37,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 09:38:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:37,583 INFO L225 Difference]: With dead ends: 603 [2020-12-23 09:38:37,583 INFO L226 Difference]: Without dead ends: 327 [2020-12-23 09:38:37,585 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 [2020-12-23 09:38:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-23 09:38:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 269. [2020-12-23 09:38:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-12-23 09:38:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 381 transitions. [2020-12-23 09:38:37,600 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 381 transitions. Word has length 44 [2020-12-23 09:38:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:37,600 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 381 transitions. [2020-12-23 09:38:37,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 381 transitions. [2020-12-23 09:38:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 09:38:37,603 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:37,603 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] [2020-12-23 09:38:37,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:38:37,604 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]=== [2020-12-23 09:38:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1585020226, now seen corresponding path program 1 times [2020-12-23 09:38:37,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:37,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991236995] [2020-12-23 09:38:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:37,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991236995] [2020-12-23 09:38:37,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:37,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:37,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807083035] [2020-12-23 09:38:37,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:37,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:37,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:37,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:37,758 INFO L87 Difference]: Start difference. First operand 269 states and 381 transitions. Second operand 3 states. [2020-12-23 09:38:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:37,814 INFO L93 Difference]: Finished difference Result 750 states and 1074 transitions. [2020-12-23 09:38:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:37,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 09:38:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:37,820 INFO L225 Difference]: With dead ends: 750 [2020-12-23 09:38:37,820 INFO L226 Difference]: Without dead ends: 498 [2020-12-23 09:38:37,821 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 [2020-12-23 09:38:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-12-23 09:38:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 304. [2020-12-23 09:38:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-12-23 09:38:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 433 transitions. [2020-12-23 09:38:37,854 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 433 transitions. Word has length 53 [2020-12-23 09:38:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:37,856 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 433 transitions. [2020-12-23 09:38:37,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 433 transitions. [2020-12-23 09:38:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:38:37,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:37,867 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] [2020-12-23 09:38:37,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:38:37,868 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]=== [2020-12-23 09:38:37,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1396202520, now seen corresponding path program 1 times [2020-12-23 09:38:37,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:37,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766348766] [2020-12-23 09:38:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:38,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766348766] [2020-12-23 09:38:38,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:38,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:38,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602184722] [2020-12-23 09:38:38,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:38,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:38,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:38,031 INFO L87 Difference]: Start difference. First operand 304 states and 433 transitions. Second operand 3 states. [2020-12-23 09:38:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:38,077 INFO L93 Difference]: Finished difference Result 834 states and 1199 transitions. [2020-12-23 09:38:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:38,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-23 09:38:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:38,082 INFO L225 Difference]: With dead ends: 834 [2020-12-23 09:38:38,082 INFO L226 Difference]: Without dead ends: 547 [2020-12-23 09:38:38,083 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 [2020-12-23 09:38:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-12-23 09:38:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 329. [2020-12-23 09:38:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-12-23 09:38:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 471 transitions. [2020-12-23 09:38:38,100 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 471 transitions. Word has length 54 [2020-12-23 09:38:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:38,100 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 471 transitions. [2020-12-23 09:38:38,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 471 transitions. [2020-12-23 09:38:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 09:38:38,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:38,102 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] [2020-12-23 09:38:38,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:38:38,102 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]=== [2020-12-23 09:38:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash -716144150, now seen corresponding path program 1 times [2020-12-23 09:38:38,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:38,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540431298] [2020-12-23 09:38:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:38,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540431298] [2020-12-23 09:38:38,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:38,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:38,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959168625] [2020-12-23 09:38:38,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:38,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:38,211 INFO L87 Difference]: Start difference. First operand 329 states and 471 transitions. Second operand 5 states. [2020-12-23 09:38:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:38,448 INFO L93 Difference]: Finished difference Result 1023 states and 1476 transitions. [2020-12-23 09:38:38,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:38,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2020-12-23 09:38:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:38,453 INFO L225 Difference]: With dead ends: 1023 [2020-12-23 09:38:38,454 INFO L226 Difference]: Without dead ends: 711 [2020-12-23 09:38:38,455 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 [2020-12-23 09:38:38,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2020-12-23 09:38:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 427. [2020-12-23 09:38:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-23 09:38:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 608 transitions. [2020-12-23 09:38:38,478 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 608 transitions. Word has length 54 [2020-12-23 09:38:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:38,479 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 608 transitions. [2020-12-23 09:38:38,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 608 transitions. [2020-12-23 09:38:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-23 09:38:38,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:38,496 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] [2020-12-23 09:38:38,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:38:38,497 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]=== [2020-12-23 09:38:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash 153208358, now seen corresponding path program 1 times [2020-12-23 09:38:38,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:38,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059130761] [2020-12-23 09:38:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:38,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059130761] [2020-12-23 09:38:38,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:38,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:38,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085906619] [2020-12-23 09:38:38,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:38,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:38,598 INFO L87 Difference]: Start difference. First operand 427 states and 608 transitions. Second operand 5 states. [2020-12-23 09:38:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:38,818 INFO L93 Difference]: Finished difference Result 1027 states and 1476 transitions. [2020-12-23 09:38:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:38,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-23 09:38:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:38,823 INFO L225 Difference]: With dead ends: 1027 [2020-12-23 09:38:38,823 INFO L226 Difference]: Without dead ends: 715 [2020-12-23 09:38:38,825 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 [2020-12-23 09:38:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2020-12-23 09:38:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 435. [2020-12-23 09:38:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-12-23 09:38:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 616 transitions. [2020-12-23 09:38:38,849 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 616 transitions. Word has length 55 [2020-12-23 09:38:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:38,849 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 616 transitions. [2020-12-23 09:38:38,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 616 transitions. [2020-12-23 09:38:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 09:38:38,851 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:38,851 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] [2020-12-23 09:38:38,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:38:38,851 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]=== [2020-12-23 09:38:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash -748848364, now seen corresponding path program 1 times [2020-12-23 09:38:38,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:38,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354513740] [2020-12-23 09:38:38,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:38,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354513740] [2020-12-23 09:38:38,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:38,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:38,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112971564] [2020-12-23 09:38:38,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:38,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:38,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:38,937 INFO L87 Difference]: Start difference. First operand 435 states and 616 transitions. Second operand 4 states. [2020-12-23 09:38:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,156 INFO L93 Difference]: Finished difference Result 1027 states and 1468 transitions. [2020-12-23 09:38:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:39,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-23 09:38:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,161 INFO L225 Difference]: With dead ends: 1027 [2020-12-23 09:38:39,162 INFO L226 Difference]: Without dead ends: 715 [2020-12-23 09:38:39,163 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 [2020-12-23 09:38:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2020-12-23 09:38:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 435. [2020-12-23 09:38:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-12-23 09:38:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 612 transitions. [2020-12-23 09:38:39,191 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 612 transitions. Word has length 57 [2020-12-23 09:38:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:39,191 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 612 transitions. [2020-12-23 09:38:39,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 612 transitions. [2020-12-23 09:38:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 09:38:39,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:39,193 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] [2020-12-23 09:38:39,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:38:39,193 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]=== [2020-12-23 09:38:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2035065116, now seen corresponding path program 1 times [2020-12-23 09:38:39,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:39,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132499497] [2020-12-23 09:38:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:39,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132499497] [2020-12-23 09:38:39,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:39,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:39,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268046679] [2020-12-23 09:38:39,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:39,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:39,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:39,271 INFO L87 Difference]: Start difference. First operand 435 states and 612 transitions. Second operand 3 states. [2020-12-23 09:38:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,317 INFO L93 Difference]: Finished difference Result 875 states and 1255 transitions. [2020-12-23 09:38:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:39,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-12-23 09:38:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,321 INFO L225 Difference]: With dead ends: 875 [2020-12-23 09:38:39,322 INFO L226 Difference]: Without dead ends: 563 [2020-12-23 09:38:39,323 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 [2020-12-23 09:38:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2020-12-23 09:38:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 430. [2020-12-23 09:38:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-12-23 09:38:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 604 transitions. [2020-12-23 09:38:39,350 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 604 transitions. Word has length 58 [2020-12-23 09:38:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:39,350 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 604 transitions. [2020-12-23 09:38:39,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 604 transitions. [2020-12-23 09:38:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:38:39,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:39,351 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] [2020-12-23 09:38:39,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:38:39,352 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]=== [2020-12-23 09:38:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1833641356, now seen corresponding path program 1 times [2020-12-23 09:38:39,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:39,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504054907] [2020-12-23 09:38:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:39,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504054907] [2020-12-23 09:38:39,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:39,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:39,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820315969] [2020-12-23 09:38:39,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:39,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:39,424 INFO L87 Difference]: Start difference. First operand 430 states and 604 transitions. Second operand 3 states. [2020-12-23 09:38:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,501 INFO L93 Difference]: Finished difference Result 874 states and 1254 transitions. [2020-12-23 09:38:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:39,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 09:38:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,505 INFO L225 Difference]: With dead ends: 874 [2020-12-23 09:38:39,505 INFO L226 Difference]: Without dead ends: 567 [2020-12-23 09:38:39,506 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 [2020-12-23 09:38:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2020-12-23 09:38:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 410. [2020-12-23 09:38:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-12-23 09:38:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 572 transitions. [2020-12-23 09:38:39,532 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 572 transitions. Word has length 62 [2020-12-23 09:38:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:39,533 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 572 transitions. [2020-12-23 09:38:39,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 572 transitions. [2020-12-23 09:38:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:38:39,534 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:39,534 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] [2020-12-23 09:38:39,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:38:39,535 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]=== [2020-12-23 09:38:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash -532758708, now seen corresponding path program 1 times [2020-12-23 09:38:39,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:39,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556199107] [2020-12-23 09:38:39,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:39,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556199107] [2020-12-23 09:38:39,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:39,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:39,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773387656] [2020-12-23 09:38:39,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:39,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:39,618 INFO L87 Difference]: Start difference. First operand 410 states and 572 transitions. Second operand 3 states. [2020-12-23 09:38:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,683 INFO L93 Difference]: Finished difference Result 842 states and 1198 transitions. [2020-12-23 09:38:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:39,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:38:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,688 INFO L225 Difference]: With dead ends: 842 [2020-12-23 09:38:39,688 INFO L226 Difference]: Without dead ends: 555 [2020-12-23 09:38:39,689 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 [2020-12-23 09:38:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-12-23 09:38:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 398. [2020-12-23 09:38:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-12-23 09:38:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 554 transitions. [2020-12-23 09:38:39,718 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 554 transitions. Word has length 66 [2020-12-23 09:38:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:39,718 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 554 transitions. [2020-12-23 09:38:39,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 554 transitions. [2020-12-23 09:38:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 09:38:39,719 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:39,719 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] [2020-12-23 09:38:39,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:38:39,720 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]=== [2020-12-23 09:38:39,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash 949999250, now seen corresponding path program 1 times [2020-12-23 09:38:39,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:39,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963336072] [2020-12-23 09:38:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:39,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963336072] [2020-12-23 09:38:39,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:39,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:39,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686798775] [2020-12-23 09:38:39,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:39,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:39,794 INFO L87 Difference]: Start difference. First operand 398 states and 554 transitions. Second operand 6 states. [2020-12-23 09:38:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,964 INFO L93 Difference]: Finished difference Result 1460 states and 2069 transitions. [2020-12-23 09:38:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:38:39,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-12-23 09:38:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,971 INFO L225 Difference]: With dead ends: 1460 [2020-12-23 09:38:39,971 INFO L226 Difference]: Without dead ends: 1185 [2020-12-23 09:38:39,973 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 [2020-12-23 09:38:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-12-23 09:38:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 419. [2020-12-23 09:38:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-12-23 09:38:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 578 transitions. [2020-12-23 09:38:40,008 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 578 transitions. Word has length 67 [2020-12-23 09:38:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:40,009 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 578 transitions. [2020-12-23 09:38:40,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 578 transitions. [2020-12-23 09:38:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 09:38:40,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:40,010 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] [2020-12-23 09:38:40,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:38:40,011 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]=== [2020-12-23 09:38:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1947699729, now seen corresponding path program 1 times [2020-12-23 09:38:40,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:40,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890045125] [2020-12-23 09:38:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:40,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890045125] [2020-12-23 09:38:40,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:40,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:40,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034439082] [2020-12-23 09:38:40,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:40,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:40,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:40,132 INFO L87 Difference]: Start difference. First operand 419 states and 578 transitions. Second operand 3 states. [2020-12-23 09:38:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:40,237 INFO L93 Difference]: Finished difference Result 859 states and 1214 transitions. [2020-12-23 09:38:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:40,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-23 09:38:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:40,241 INFO L225 Difference]: With dead ends: 859 [2020-12-23 09:38:40,242 INFO L226 Difference]: Without dead ends: 584 [2020-12-23 09:38:40,243 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 [2020-12-23 09:38:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-12-23 09:38:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 399. [2020-12-23 09:38:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-12-23 09:38:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 546 transitions. [2020-12-23 09:38:40,273 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 546 transitions. Word has length 69 [2020-12-23 09:38:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:40,273 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 546 transitions. [2020-12-23 09:38:40,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 546 transitions. [2020-12-23 09:38:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 09:38:40,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:40,274 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] [2020-12-23 09:38:40,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:38:40,275 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]=== [2020-12-23 09:38:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -344815767, now seen corresponding path program 1 times [2020-12-23 09:38:40,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:40,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342036623] [2020-12-23 09:38:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:40,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342036623] [2020-12-23 09:38:40,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:40,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:40,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676874022] [2020-12-23 09:38:40,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:40,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:40,338 INFO L87 Difference]: Start difference. First operand 399 states and 546 transitions. Second operand 3 states. [2020-12-23 09:38:40,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:40,414 INFO L93 Difference]: Finished difference Result 827 states and 1158 transitions. [2020-12-23 09:38:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:40,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-23 09:38:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:40,418 INFO L225 Difference]: With dead ends: 827 [2020-12-23 09:38:40,418 INFO L226 Difference]: Without dead ends: 572 [2020-12-23 09:38:40,419 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 [2020-12-23 09:38:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-12-23 09:38:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 387. [2020-12-23 09:38:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-12-23 09:38:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 528 transitions. [2020-12-23 09:38:40,449 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 528 transitions. Word has length 73 [2020-12-23 09:38:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:40,449 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 528 transitions. [2020-12-23 09:38:40,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 528 transitions. [2020-12-23 09:38:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:38:40,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:40,451 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] [2020-12-23 09:38:40,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:38:40,451 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]=== [2020-12-23 09:38:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1959055909, now seen corresponding path program 1 times [2020-12-23 09:38:40,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:40,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574922280] [2020-12-23 09:38:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:40,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574922280] [2020-12-23 09:38:40,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:40,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:40,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181417578] [2020-12-23 09:38:40,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:40,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:40,632 INFO L87 Difference]: Start difference. First operand 387 states and 528 transitions. Second operand 6 states. [2020-12-23 09:38:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:40,874 INFO L93 Difference]: Finished difference Result 1103 states and 1542 transitions. [2020-12-23 09:38:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:38:40,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-23 09:38:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:40,879 INFO L225 Difference]: With dead ends: 1103 [2020-12-23 09:38:40,879 INFO L226 Difference]: Without dead ends: 860 [2020-12-23 09:38:40,885 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 [2020-12-23 09:38:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-12-23 09:38:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 412. [2020-12-23 09:38:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-12-23 09:38:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 563 transitions. [2020-12-23 09:38:40,929 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 563 transitions. Word has length 76 [2020-12-23 09:38:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:40,929 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 563 transitions. [2020-12-23 09:38:40,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 563 transitions. [2020-12-23 09:38:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:38:40,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:40,931 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] [2020-12-23 09:38:40,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:38:40,931 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]=== [2020-12-23 09:38:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash 317146558, now seen corresponding path program 1 times [2020-12-23 09:38:40,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:40,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693397197] [2020-12-23 09:38:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:41,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693397197] [2020-12-23 09:38:41,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:41,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:38:41,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183948018] [2020-12-23 09:38:41,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:38:41,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:38:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:41,099 INFO L87 Difference]: Start difference. First operand 412 states and 563 transitions. Second operand 7 states. [2020-12-23 09:38:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:41,503 INFO L93 Difference]: Finished difference Result 1432 states and 1991 transitions. [2020-12-23 09:38:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:38:41,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2020-12-23 09:38:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:41,509 INFO L225 Difference]: With dead ends: 1432 [2020-12-23 09:38:41,510 INFO L226 Difference]: Without dead ends: 1171 [2020-12-23 09:38:41,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:38:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-12-23 09:38:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 440. [2020-12-23 09:38:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 09:38:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 594 transitions. [2020-12-23 09:38:41,557 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 594 transitions. Word has length 76 [2020-12-23 09:38:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:41,558 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 594 transitions. [2020-12-23 09:38:41,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:38:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 594 transitions. [2020-12-23 09:38:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:38:41,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:41,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:41,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:38:41,560 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]=== [2020-12-23 09:38:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 917353494, now seen corresponding path program 1 times [2020-12-23 09:38:41,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:41,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438047698] [2020-12-23 09:38:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:41,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438047698] [2020-12-23 09:38:41,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:41,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:41,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746470056] [2020-12-23 09:38:41,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:41,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:41,654 INFO L87 Difference]: Start difference. First operand 440 states and 594 transitions. Second operand 4 states. [2020-12-23 09:38:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:41,873 INFO L93 Difference]: Finished difference Result 1131 states and 1543 transitions. [2020-12-23 09:38:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:41,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 09:38:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:41,881 INFO L225 Difference]: With dead ends: 1131 [2020-12-23 09:38:41,881 INFO L226 Difference]: Without dead ends: 864 [2020-12-23 09:38:41,882 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 [2020-12-23 09:38:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2020-12-23 09:38:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 661. [2020-12-23 09:38:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2020-12-23 09:38:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 882 transitions. [2020-12-23 09:38:41,971 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 882 transitions. Word has length 76 [2020-12-23 09:38:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:41,971 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 882 transitions. [2020-12-23 09:38:41,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 882 transitions. [2020-12-23 09:38:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 09:38:41,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:41,974 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] [2020-12-23 09:38:41,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:38:41,974 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]=== [2020-12-23 09:38:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash 956639496, now seen corresponding path program 1 times [2020-12-23 09:38:41,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:41,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522442468] [2020-12-23 09:38:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:42,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522442468] [2020-12-23 09:38:42,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:42,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:42,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098431426] [2020-12-23 09:38:42,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:42,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:42,110 INFO L87 Difference]: Start difference. First operand 661 states and 882 transitions. Second operand 3 states. [2020-12-23 09:38:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:42,226 INFO L93 Difference]: Finished difference Result 1154 states and 1574 transitions. [2020-12-23 09:38:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:42,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 09:38:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:42,232 INFO L225 Difference]: With dead ends: 1154 [2020-12-23 09:38:42,232 INFO L226 Difference]: Without dead ends: 772 [2020-12-23 09:38:42,234 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 [2020-12-23 09:38:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-12-23 09:38:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 657. [2020-12-23 09:38:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2020-12-23 09:38:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 875 transitions. [2020-12-23 09:38:42,299 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 875 transitions. Word has length 77 [2020-12-23 09:38:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:42,300 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 875 transitions. [2020-12-23 09:38:42,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 875 transitions. [2020-12-23 09:38:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:38:42,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:42,301 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] [2020-12-23 09:38:42,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:38:42,302 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]=== [2020-12-23 09:38:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:42,303 INFO L82 PathProgramCache]: Analyzing trace with hash 341178161, now seen corresponding path program 1 times [2020-12-23 09:38:42,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:42,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109314168] [2020-12-23 09:38:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:42,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109314168] [2020-12-23 09:38:42,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:42,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:42,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777384047] [2020-12-23 09:38:42,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:42,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:42,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:42,370 INFO L87 Difference]: Start difference. First operand 657 states and 875 transitions. Second operand 4 states. [2020-12-23 09:38:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:42,581 INFO L93 Difference]: Finished difference Result 1469 states and 1979 transitions. [2020-12-23 09:38:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:42,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 09:38:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:42,587 INFO L225 Difference]: With dead ends: 1469 [2020-12-23 09:38:42,587 INFO L226 Difference]: Without dead ends: 1077 [2020-12-23 09:38:42,589 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 [2020-12-23 09:38:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2020-12-23 09:38:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 876. [2020-12-23 09:38:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2020-12-23 09:38:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1157 transitions. [2020-12-23 09:38:42,707 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1157 transitions. Word has length 78 [2020-12-23 09:38:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:42,707 INFO L481 AbstractCegarLoop]: Abstraction has 876 states and 1157 transitions. [2020-12-23 09:38:42,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1157 transitions. [2020-12-23 09:38:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:38:42,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:42,709 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] [2020-12-23 09:38:42,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:38:42,709 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]=== [2020-12-23 09:38:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1360037685, now seen corresponding path program 1 times [2020-12-23 09:38:42,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:42,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109236778] [2020-12-23 09:38:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:42,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109236778] [2020-12-23 09:38:42,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:42,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:42,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254897924] [2020-12-23 09:38:42,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:42,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:42,880 INFO L87 Difference]: Start difference. First operand 876 states and 1157 transitions. Second operand 6 states. [2020-12-23 09:38:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:43,562 INFO L93 Difference]: Finished difference Result 3260 states and 4377 transitions. [2020-12-23 09:38:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:38:43,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2020-12-23 09:38:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:43,577 INFO L225 Difference]: With dead ends: 3260 [2020-12-23 09:38:43,577 INFO L226 Difference]: Without dead ends: 2737 [2020-12-23 09:38:43,579 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 [2020-12-23 09:38:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2020-12-23 09:38:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1002. [2020-12-23 09:38:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2020-12-23 09:38:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1304 transitions. [2020-12-23 09:38:43,704 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1304 transitions. Word has length 78 [2020-12-23 09:38:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:43,704 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1304 transitions. [2020-12-23 09:38:43,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1304 transitions. [2020-12-23 09:38:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:38:43,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:43,706 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] [2020-12-23 09:38:43,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:38:43,706 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]=== [2020-12-23 09:38:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash -504696615, now seen corresponding path program 1 times [2020-12-23 09:38:43,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:43,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779561054] [2020-12-23 09:38:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:43,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779561054] [2020-12-23 09:38:43,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:43,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:43,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870394808] [2020-12-23 09:38:43,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:43,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:43,769 INFO L87 Difference]: Start difference. First operand 1002 states and 1304 transitions. Second operand 4 states. [2020-12-23 09:38:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:44,078 INFO L93 Difference]: Finished difference Result 2409 states and 3182 transitions. [2020-12-23 09:38:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:44,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 09:38:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:44,089 INFO L225 Difference]: With dead ends: 2409 [2020-12-23 09:38:44,089 INFO L226 Difference]: Without dead ends: 1838 [2020-12-23 09:38:44,091 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 [2020-12-23 09:38:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2020-12-23 09:38:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1357. [2020-12-23 09:38:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2020-12-23 09:38:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1761 transitions. [2020-12-23 09:38:44,251 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1761 transitions. Word has length 79 [2020-12-23 09:38:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:44,252 INFO L481 AbstractCegarLoop]: Abstraction has 1357 states and 1761 transitions. [2020-12-23 09:38:44,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1761 transitions. [2020-12-23 09:38:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:38:44,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:44,254 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] [2020-12-23 09:38:44,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:38:44,254 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]=== [2020-12-23 09:38:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -676572605, now seen corresponding path program 1 times [2020-12-23 09:38:44,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:44,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88758683] [2020-12-23 09:38:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:44,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:44,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88758683] [2020-12-23 09:38:44,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:44,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:44,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155674719] [2020-12-23 09:38:44,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:44,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:44,301 INFO L87 Difference]: Start difference. First operand 1357 states and 1761 transitions. Second operand 3 states. [2020-12-23 09:38:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:44,708 INFO L93 Difference]: Finished difference Result 3205 states and 4182 transitions. [2020-12-23 09:38:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:44,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:38:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:44,720 INFO L225 Difference]: With dead ends: 3205 [2020-12-23 09:38:44,720 INFO L226 Difference]: Without dead ends: 2226 [2020-12-23 09:38:44,725 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 [2020-12-23 09:38:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2020-12-23 09:38:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1359. [2020-12-23 09:38:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2020-12-23 09:38:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1763 transitions. [2020-12-23 09:38:44,883 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1763 transitions. Word has length 80 [2020-12-23 09:38:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:44,884 INFO L481 AbstractCegarLoop]: Abstraction has 1359 states and 1763 transitions. [2020-12-23 09:38:44,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1763 transitions. [2020-12-23 09:38:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:38:44,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:44,886 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] [2020-12-23 09:38:44,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:38:44,886 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]=== [2020-12-23 09:38:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 614216993, now seen corresponding path program 1 times [2020-12-23 09:38:44,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:44,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378566991] [2020-12-23 09:38:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:44,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378566991] [2020-12-23 09:38:44,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:44,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:44,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909768153] [2020-12-23 09:38:44,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:44,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:44,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:44,995 INFO L87 Difference]: Start difference. First operand 1359 states and 1763 transitions. Second operand 6 states. [2020-12-23 09:38:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:45,347 INFO L93 Difference]: Finished difference Result 2147 states and 2830 transitions. [2020-12-23 09:38:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:38:45,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2020-12-23 09:38:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:45,358 INFO L225 Difference]: With dead ends: 2147 [2020-12-23 09:38:45,358 INFO L226 Difference]: Without dead ends: 2145 [2020-12-23 09:38:45,359 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 [2020-12-23 09:38:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2020-12-23 09:38:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1361. [2020-12-23 09:38:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-12-23 09:38:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1765 transitions. [2020-12-23 09:38:45,519 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1765 transitions. Word has length 81 [2020-12-23 09:38:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:45,519 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1765 transitions. [2020-12-23 09:38:45,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1765 transitions. [2020-12-23 09:38:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:38:45,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:45,522 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] [2020-12-23 09:38:45,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:38:45,522 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]=== [2020-12-23 09:38:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1500088230, now seen corresponding path program 1 times [2020-12-23 09:38:45,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:45,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734346768] [2020-12-23 09:38:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:45,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734346768] [2020-12-23 09:38:45,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:45,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:45,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620055763] [2020-12-23 09:38:45,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:45,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:45,678 INFO L87 Difference]: Start difference. First operand 1361 states and 1765 transitions. Second operand 6 states. [2020-12-23 09:38:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:46,252 INFO L93 Difference]: Finished difference Result 3233 states and 4335 transitions. [2020-12-23 09:38:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:38:46,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2020-12-23 09:38:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:46,265 INFO L225 Difference]: With dead ends: 3233 [2020-12-23 09:38:46,265 INFO L226 Difference]: Without dead ends: 2414 [2020-12-23 09:38:46,267 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 [2020-12-23 09:38:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2020-12-23 09:38:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 1361. [2020-12-23 09:38:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-12-23 09:38:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1753 transitions. [2020-12-23 09:38:46,429 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1753 transitions. Word has length 81 [2020-12-23 09:38:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:46,430 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1753 transitions. [2020-12-23 09:38:46,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1753 transitions. [2020-12-23 09:38:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:38:46,432 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:46,432 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] [2020-12-23 09:38:46,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:38:46,433 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]=== [2020-12-23 09:38:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:46,433 INFO L82 PathProgramCache]: Analyzing trace with hash -659983772, now seen corresponding path program 1 times [2020-12-23 09:38:46,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:46,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043833490] [2020-12-23 09:38:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:46,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043833490] [2020-12-23 09:38:46,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:46,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:46,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131496211] [2020-12-23 09:38:46,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:46,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:46,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:46,543 INFO L87 Difference]: Start difference. First operand 1361 states and 1753 transitions. Second operand 4 states. [2020-12-23 09:38:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:46,787 INFO L93 Difference]: Finished difference Result 2709 states and 3522 transitions. [2020-12-23 09:38:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:46,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 09:38:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:46,795 INFO L225 Difference]: With dead ends: 2709 [2020-12-23 09:38:46,795 INFO L226 Difference]: Without dead ends: 1424 [2020-12-23 09:38:46,797 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 [2020-12-23 09:38:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-12-23 09:38:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1061. [2020-12-23 09:38:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2020-12-23 09:38:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1385 transitions. [2020-12-23 09:38:46,933 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1385 transitions. Word has length 81 [2020-12-23 09:38:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:46,934 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1385 transitions. [2020-12-23 09:38:46,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1385 transitions. [2020-12-23 09:38:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:38:46,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:46,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:46,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:38:46,936 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]=== [2020-12-23 09:38:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash -63459148, now seen corresponding path program 1 times [2020-12-23 09:38:46,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:46,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793903083] [2020-12-23 09:38:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:46,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793903083] [2020-12-23 09:38:46,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:46,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:46,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314129441] [2020-12-23 09:38:46,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:46,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:46,978 INFO L87 Difference]: Start difference. First operand 1061 states and 1385 transitions. Second operand 3 states. [2020-12-23 09:38:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:47,279 INFO L93 Difference]: Finished difference Result 2507 states and 3293 transitions. [2020-12-23 09:38:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:47,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 09:38:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:47,285 INFO L225 Difference]: With dead ends: 2507 [2020-12-23 09:38:47,286 INFO L226 Difference]: Without dead ends: 1596 [2020-12-23 09:38:47,288 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 [2020-12-23 09:38:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-23 09:38:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1067. [2020-12-23 09:38:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2020-12-23 09:38:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1391 transitions. [2020-12-23 09:38:47,419 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1391 transitions. Word has length 82 [2020-12-23 09:38:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:47,420 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1391 transitions. [2020-12-23 09:38:47,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1391 transitions. [2020-12-23 09:38:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:38:47,421 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:47,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:47,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:38:47,422 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]=== [2020-12-23 09:38:47,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:47,422 INFO L82 PathProgramCache]: Analyzing trace with hash -753963456, now seen corresponding path program 1 times [2020-12-23 09:38:47,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:47,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716875162] [2020-12-23 09:38:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:47,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716875162] [2020-12-23 09:38:47,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:47,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:38:47,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025027489] [2020-12-23 09:38:47,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:47,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:47,491 INFO L87 Difference]: Start difference. First operand 1067 states and 1391 transitions. Second operand 4 states. [2020-12-23 09:38:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:47,716 INFO L93 Difference]: Finished difference Result 2451 states and 3213 transitions. [2020-12-23 09:38:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:38:47,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2020-12-23 09:38:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:47,721 INFO L225 Difference]: With dead ends: 2451 [2020-12-23 09:38:47,721 INFO L226 Difference]: Without dead ends: 1484 [2020-12-23 09:38:47,723 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 [2020-12-23 09:38:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-12-23 09:38:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1007. [2020-12-23 09:38:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2020-12-23 09:38:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1309 transitions. [2020-12-23 09:38:47,866 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1309 transitions. Word has length 82 [2020-12-23 09:38:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:47,866 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 1309 transitions. [2020-12-23 09:38:47,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1309 transitions. [2020-12-23 09:38:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:38:47,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:47,868 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, 1] [2020-12-23 09:38:47,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:38:47,868 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]=== [2020-12-23 09:38:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash -883855950, now seen corresponding path program 1 times [2020-12-23 09:38:47,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:47,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903406613] [2020-12-23 09:38:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:48,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903406613] [2020-12-23 09:38:48,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:48,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:48,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469307061] [2020-12-23 09:38:48,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:48,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:48,001 INFO L87 Difference]: Start difference. First operand 1007 states and 1309 transitions. Second operand 6 states. [2020-12-23 09:38:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:48,598 INFO L93 Difference]: Finished difference Result 3328 states and 4525 transitions. [2020-12-23 09:38:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:38:48,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2020-12-23 09:38:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:48,609 INFO L225 Difference]: With dead ends: 3328 [2020-12-23 09:38:48,610 INFO L226 Difference]: Without dead ends: 2520 [2020-12-23 09:38:48,612 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 [2020-12-23 09:38:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2020-12-23 09:38:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 995. [2020-12-23 09:38:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2020-12-23 09:38:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1297 transitions. [2020-12-23 09:38:48,791 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1297 transitions. Word has length 84 [2020-12-23 09:38:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:48,792 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1297 transitions. [2020-12-23 09:38:48,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1297 transitions. [2020-12-23 09:38:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:38:48,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:48,793 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, 1, 1] [2020-12-23 09:38:48,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:38:48,794 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]=== [2020-12-23 09:38:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1751255189, now seen corresponding path program 1 times [2020-12-23 09:38:48,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:48,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688579533] [2020-12-23 09:38:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:48,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688579533] [2020-12-23 09:38:48,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:48,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:38:48,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139727808] [2020-12-23 09:38:48,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:48,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:48,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:38:48,887 INFO L87 Difference]: Start difference. First operand 995 states and 1297 transitions. Second operand 6 states. [2020-12-23 09:38:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:49,232 INFO L93 Difference]: Finished difference Result 2392 states and 3268 transitions. [2020-12-23 09:38:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:38:49,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2020-12-23 09:38:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:49,238 INFO L225 Difference]: With dead ends: 2392 [2020-12-23 09:38:49,238 INFO L226 Difference]: Without dead ends: 1584 [2020-12-23 09:38:49,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:38:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2020-12-23 09:38:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1001. [2020-12-23 09:38:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2020-12-23 09:38:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1303 transitions. [2020-12-23 09:38:49,404 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1303 transitions. Word has length 85 [2020-12-23 09:38:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:49,404 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1303 transitions. [2020-12-23 09:38:49,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1303 transitions. [2020-12-23 09:38:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 09:38:49,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:49,408 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] [2020-12-23 09:38:49,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:38:49,409 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]=== [2020-12-23 09:38:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 125687478, now seen corresponding path program 1 times [2020-12-23 09:38:49,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:49,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688640585] [2020-12-23 09:38:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:49,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688640585] [2020-12-23 09:38:49,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52184304] [2020-12-23 09:38:49,608 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 [2020-12-23 09:38:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:49,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 09:38:49,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:38:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:38:50,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:38:50,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2020-12-23 09:38:50,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277981677] [2020-12-23 09:38:50,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:38:50,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:38:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:38:50,134 INFO L87 Difference]: Start difference. First operand 1001 states and 1303 transitions. Second operand 6 states. [2020-12-23 09:38:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:50,708 INFO L93 Difference]: Finished difference Result 2597 states and 3519 transitions. [2020-12-23 09:38:50,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:38:50,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2020-12-23 09:38:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:50,715 INFO L225 Difference]: With dead ends: 2597 [2020-12-23 09:38:50,716 INFO L226 Difference]: Without dead ends: 1783 [2020-12-23 09:38:50,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:38:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2020-12-23 09:38:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1001. [2020-12-23 09:38:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2020-12-23 09:38:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1302 transitions. [2020-12-23 09:38:50,931 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1302 transitions. Word has length 135 [2020-12-23 09:38:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:50,931 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1302 transitions. [2020-12-23 09:38:50,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:38:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1302 transitions. [2020-12-23 09:38:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 09:38:50,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:50,935 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, 1, 1] [2020-12-23 09:38:51,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:38:51,151 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]=== [2020-12-23 09:38:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2123135119, now seen corresponding path program 1 times [2020-12-23 09:38:51,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:51,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873673693] [2020-12-23 09:38:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:51,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873673693] [2020-12-23 09:38:51,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875879145] [2020-12-23 09:38:51,337 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 [2020-12-23 09:38:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:51,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 09:38:51,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:38:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:38:51,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:38:51,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-12-23 09:38:51,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018780851] [2020-12-23 09:38:51,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:38:51,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:38:51,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:38:51,864 INFO L87 Difference]: Start difference. First operand 1001 states and 1302 transitions. Second operand 13 states. [2020-12-23 09:39:01,783 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-23 09:39:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:07,000 INFO L93 Difference]: Finished difference Result 16835 states and 22485 transitions. [2020-12-23 09:39:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2020-12-23 09:39:07,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2020-12-23 09:39:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:07,046 INFO L225 Difference]: With dead ends: 16835 [2020-12-23 09:39:07,047 INFO L226 Difference]: Without dead ends: 16027 [2020-12-23 09:39:07,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28995 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2020-12-23 09:39:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16027 states. [2020-12-23 09:39:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16027 to 2722. [2020-12-23 09:39:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2020-12-23 09:39:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3549 transitions. [2020-12-23 09:39:07,804 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3549 transitions. Word has length 139 [2020-12-23 09:39:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:07,805 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 3549 transitions. [2020-12-23 09:39:07,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:39:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3549 transitions. [2020-12-23 09:39:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-23 09:39:07,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:07,812 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, 1, 1] [2020-12-23 09:39:08,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:08,027 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]=== [2020-12-23 09:39:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:08,028 INFO L82 PathProgramCache]: Analyzing trace with hash -57519925, now seen corresponding path program 1 times [2020-12-23 09:39:08,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:08,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414188640] [2020-12-23 09:39:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:08,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414188640] [2020-12-23 09:39:08,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419089777] [2020-12-23 09:39:08,269 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 [2020-12-23 09:39:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:08,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 09:39:08,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:39:08,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:39:08,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2020-12-23 09:39:08,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330878127] [2020-12-23 09:39:08,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:39:08,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:39:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:39:08,699 INFO L87 Difference]: Start difference. First operand 2722 states and 3549 transitions. Second operand 6 states. [2020-12-23 09:39:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:09,836 INFO L93 Difference]: Finished difference Result 7296 states and 9902 transitions. [2020-12-23 09:39:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:39:09,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2020-12-23 09:39:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:09,846 INFO L225 Difference]: With dead ends: 7296 [2020-12-23 09:39:09,846 INFO L226 Difference]: Without dead ends: 4801 [2020-12-23 09:39:09,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:39:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2020-12-23 09:39:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 2379. [2020-12-23 09:39:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2020-12-23 09:39:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3108 transitions. [2020-12-23 09:39:10,389 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3108 transitions. Word has length 140 [2020-12-23 09:39:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:10,389 INFO L481 AbstractCegarLoop]: Abstraction has 2379 states and 3108 transitions. [2020-12-23 09:39:10,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:39:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3108 transitions. [2020-12-23 09:39:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-12-23 09:39:10,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:10,394 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, 1, 1] [2020-12-23 09:39:10,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:10,609 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]=== [2020-12-23 09:39:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash -7531545, now seen corresponding path program 1 times [2020-12-23 09:39:10,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:10,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794467053] [2020-12-23 09:39:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 09:39:10,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794467053] [2020-12-23 09:39:10,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:10,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:39:10,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289390019] [2020-12-23 09:39:10,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:39:10,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:39:10,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:39:10,761 INFO L87 Difference]: Start difference. First operand 2379 states and 3108 transitions. Second operand 7 states. [2020-12-23 09:39:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:13,404 INFO L93 Difference]: Finished difference Result 14125 states and 18988 transitions. [2020-12-23 09:39:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 09:39:13,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2020-12-23 09:39:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:13,431 INFO L225 Difference]: With dead ends: 14125 [2020-12-23 09:39:13,431 INFO L226 Difference]: Without dead ends: 12013 [2020-12-23 09:39:13,438 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 [2020-12-23 09:39:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12013 states. [2020-12-23 09:39:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12013 to 2835. [2020-12-23 09:39:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2835 states. [2020-12-23 09:39:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3638 transitions. [2020-12-23 09:39:14,054 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3638 transitions. Word has length 141 [2020-12-23 09:39:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:14,054 INFO L481 AbstractCegarLoop]: Abstraction has 2835 states and 3638 transitions. [2020-12-23 09:39:14,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:39:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3638 transitions. [2020-12-23 09:39:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 09:39:14,060 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:14,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:14,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:39:14,061 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]=== [2020-12-23 09:39:14,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:14,062 INFO L82 PathProgramCache]: Analyzing trace with hash -781251252, now seen corresponding path program 1 times [2020-12-23 09:39:14,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:14,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581631171] [2020-12-23 09:39:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:14,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581631171] [2020-12-23 09:39:14,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854280600] [2020-12-23 09:39:14,245 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 [2020-12-23 09:39:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:14,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 09:39:14,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 09:39:14,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:14,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2020-12-23 09:39:14,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025187513] [2020-12-23 09:39:14,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:39:14,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:39:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:39:14,682 INFO L87 Difference]: Start difference. First operand 2835 states and 3638 transitions. Second operand 11 states. [2020-12-23 09:39:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:17,598 INFO L93 Difference]: Finished difference Result 8090 states and 10560 transitions. [2020-12-23 09:39:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-23 09:39:17,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2020-12-23 09:39:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:17,610 INFO L225 Difference]: With dead ends: 8090 [2020-12-23 09:39:17,611 INFO L226 Difference]: Without dead ends: 5319 [2020-12-23 09:39:17,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2020-12-23 09:39:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2020-12-23 09:39:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 2355. [2020-12-23 09:39:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2020-12-23 09:39:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3024 transitions. [2020-12-23 09:39:18,105 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3024 transitions. Word has length 143 [2020-12-23 09:39:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:18,106 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 3024 transitions. [2020-12-23 09:39:18,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:39:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3024 transitions. [2020-12-23 09:39:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 09:39:18,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:18,112 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, 1] [2020-12-23 09:39:18,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:18,327 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]=== [2020-12-23 09:39:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1655490771, now seen corresponding path program 1 times [2020-12-23 09:39:18,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:18,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135848012] [2020-12-23 09:39:18,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:18,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135848012] [2020-12-23 09:39:18,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999108128] [2020-12-23 09:39:18,581 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:18,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-23 09:39:18,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:18,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:39:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:19,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:19,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2020-12-23 09:39:19,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964158489] [2020-12-23 09:39:19,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 09:39:19,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 09:39:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-12-23 09:39:19,201 INFO L87 Difference]: Start difference. First operand 2355 states and 3024 transitions. Second operand 16 states. [2020-12-23 09:39:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:21,581 INFO L93 Difference]: Finished difference Result 6490 states and 8366 transitions. [2020-12-23 09:39:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 09:39:21,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 143 [2020-12-23 09:39:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:21,590 INFO L225 Difference]: With dead ends: 6490 [2020-12-23 09:39:21,590 INFO L226 Difference]: Without dead ends: 4350 [2020-12-23 09:39:21,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2020-12-23 09:39:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2020-12-23 09:39:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 2613. [2020-12-23 09:39:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2613 states. [2020-12-23 09:39:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3348 transitions. [2020-12-23 09:39:22,113 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3348 transitions. Word has length 143 [2020-12-23 09:39:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:22,113 INFO L481 AbstractCegarLoop]: Abstraction has 2613 states and 3348 transitions. [2020-12-23 09:39:22,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 09:39:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3348 transitions. [2020-12-23 09:39:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 09:39:22,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:22,121 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, 1] [2020-12-23 09:39:22,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-23 09:39:22,336 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]=== [2020-12-23 09:39:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 508125803, now seen corresponding path program 1 times [2020-12-23 09:39:22,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:22,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411554096] [2020-12-23 09:39:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 09:39:22,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411554096] [2020-12-23 09:39:22,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:22,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:39:22,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24090188] [2020-12-23 09:39:22,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:39:22,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:22,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:39:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:22,500 INFO L87 Difference]: Start difference. First operand 2613 states and 3348 transitions. Second operand 5 states. [2020-12-23 09:39:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:23,138 INFO L93 Difference]: Finished difference Result 4932 states and 6367 transitions. [2020-12-23 09:39:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:39:23,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2020-12-23 09:39:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:23,144 INFO L225 Difference]: With dead ends: 4932 [2020-12-23 09:39:23,144 INFO L226 Difference]: Without dead ends: 2473 [2020-12-23 09:39:23,147 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 [2020-12-23 09:39:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2020-12-23 09:39:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2020-12-23 09:39:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2473 states. [2020-12-23 09:39:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3171 transitions. [2020-12-23 09:39:23,772 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3171 transitions. Word has length 143 [2020-12-23 09:39:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:23,772 INFO L481 AbstractCegarLoop]: Abstraction has 2473 states and 3171 transitions. [2020-12-23 09:39:23,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:39:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3171 transitions. [2020-12-23 09:39:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 09:39:23,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:23,777 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, 1, 1, 1] [2020-12-23 09:39:23,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 09:39:23,779 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]=== [2020-12-23 09:39:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -529555049, now seen corresponding path program 1 times [2020-12-23 09:39:23,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:23,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521834488] [2020-12-23 09:39:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:24,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521834488] [2020-12-23 09:39:24,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312539605] [2020-12-23 09:39:24,061 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:24,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-23 09:39:24,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:24,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 09:39:24,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 09:39:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:24,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:24,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-12-23 09:39:24,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241769290] [2020-12-23 09:39:24,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 09:39:24,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 09:39:24,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-23 09:39:24,851 INFO L87 Difference]: Start difference. First operand 2473 states and 3171 transitions. Second operand 18 states. [2020-12-23 09:39:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:28,814 INFO L93 Difference]: Finished difference Result 7337 states and 9410 transitions. [2020-12-23 09:39:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-23 09:39:28,815 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 144 [2020-12-23 09:39:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:28,826 INFO L225 Difference]: With dead ends: 7337 [2020-12-23 09:39:28,826 INFO L226 Difference]: Without dead ends: 5079 [2020-12-23 09:39:28,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=612, Invalid=2250, Unknown=0, NotChecked=0, Total=2862 [2020-12-23 09:39:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2020-12-23 09:39:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 2765. [2020-12-23 09:39:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2020-12-23 09:39:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3537 transitions. [2020-12-23 09:39:29,444 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3537 transitions. Word has length 144 [2020-12-23 09:39:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:29,444 INFO L481 AbstractCegarLoop]: Abstraction has 2765 states and 3537 transitions. [2020-12-23 09:39:29,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-23 09:39:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3537 transitions. [2020-12-23 09:39:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 09:39:29,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:29,450 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, 1, 1, 1] [2020-12-23 09:39:29,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:29,665 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]=== [2020-12-23 09:39:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:29,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1568139623, now seen corresponding path program 1 times [2020-12-23 09:39:29,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:29,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199285359] [2020-12-23 09:39:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-23 09:39:29,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199285359] [2020-12-23 09:39:29,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:29,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:39:29,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32948818] [2020-12-23 09:39:29,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:39:29,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:39:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:39:29,737 INFO L87 Difference]: Start difference. First operand 2765 states and 3537 transitions. Second operand 4 states. [2020-12-23 09:39:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:30,267 INFO L93 Difference]: Finished difference Result 5161 states and 6645 transitions. [2020-12-23 09:39:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:30,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-12-23 09:39:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:30,271 INFO L225 Difference]: With dead ends: 5161 [2020-12-23 09:39:30,271 INFO L226 Difference]: Without dead ends: 2552 [2020-12-23 09:39:30,274 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 [2020-12-23 09:39:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2020-12-23 09:39:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2540. [2020-12-23 09:39:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2540 states. [2020-12-23 09:39:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3237 transitions. [2020-12-23 09:39:30,697 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3237 transitions. Word has length 144 [2020-12-23 09:39:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:30,698 INFO L481 AbstractCegarLoop]: Abstraction has 2540 states and 3237 transitions. [2020-12-23 09:39:30,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:39:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3237 transitions. [2020-12-23 09:39:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 09:39:30,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:30,701 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, 1, 1, 1, 1, 1] [2020-12-23 09:39:30,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 09:39:30,701 INFO L429 AbstractCegarLoop]: === Iteration 39 === [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]=== [2020-12-23 09:39:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1812744130, now seen corresponding path program 1 times [2020-12-23 09:39:30,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:30,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502060703] [2020-12-23 09:39:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:30,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502060703] [2020-12-23 09:39:30,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:30,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 09:39:30,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937250752] [2020-12-23 09:39:30,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 09:39:30,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 09:39:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:39:30,921 INFO L87 Difference]: Start difference. First operand 2540 states and 3237 transitions. Second operand 10 states. [2020-12-23 09:39:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:32,463 INFO L93 Difference]: Finished difference Result 6680 states and 8584 transitions. [2020-12-23 09:39:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 09:39:32,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2020-12-23 09:39:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:32,471 INFO L225 Difference]: With dead ends: 6680 [2020-12-23 09:39:32,471 INFO L226 Difference]: Without dead ends: 4355 [2020-12-23 09:39:32,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:39:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2020-12-23 09:39:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 2875. [2020-12-23 09:39:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2020-12-23 09:39:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 3660 transitions. [2020-12-23 09:39:33,287 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 3660 transitions. Word has length 144 [2020-12-23 09:39:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:33,288 INFO L481 AbstractCegarLoop]: Abstraction has 2875 states and 3660 transitions. [2020-12-23 09:39:33,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 09:39:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 3660 transitions. [2020-12-23 09:39:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 09:39:33,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:33,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:33,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 09:39:33,293 INFO L429 AbstractCegarLoop]: === Iteration 40 === [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]=== [2020-12-23 09:39:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 530571844, now seen corresponding path program 1 times [2020-12-23 09:39:33,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:33,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403907580] [2020-12-23 09:39:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-12-23 09:39:33,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403907580] [2020-12-23 09:39:33,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:33,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:39:33,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293652102] [2020-12-23 09:39:33,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:39:33,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:33,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:39:33,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:33,432 INFO L87 Difference]: Start difference. First operand 2875 states and 3660 transitions. Second operand 5 states. [2020-12-23 09:39:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:33,966 INFO L93 Difference]: Finished difference Result 5376 states and 6883 transitions. [2020-12-23 09:39:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:39:33,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2020-12-23 09:39:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:33,970 INFO L225 Difference]: With dead ends: 5376 [2020-12-23 09:39:33,970 INFO L226 Difference]: Without dead ends: 2658 [2020-12-23 09:39:33,973 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 [2020-12-23 09:39:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2020-12-23 09:39:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658. [2020-12-23 09:39:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2020-12-23 09:39:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3387 transitions. [2020-12-23 09:39:34,717 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3387 transitions. Word has length 144 [2020-12-23 09:39:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:34,717 INFO L481 AbstractCegarLoop]: Abstraction has 2658 states and 3387 transitions. [2020-12-23 09:39:34,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:39:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3387 transitions. [2020-12-23 09:39:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:39:34,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:34,722 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, 1, 1, 1] [2020-12-23 09:39:34,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 09:39:34,722 INFO L429 AbstractCegarLoop]: === Iteration 41 === [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]=== [2020-12-23 09:39:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash -922037262, now seen corresponding path program 1 times [2020-12-23 09:39:34,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:34,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043166089] [2020-12-23 09:39:34,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:35,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043166089] [2020-12-23 09:39:35,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010041936] [2020-12-23 09:39:35,001 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:35,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-23 09:39:35,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:35,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 09:39:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:35,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:35,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-12-23 09:39:35,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673949648] [2020-12-23 09:39:35,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:39:35,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:39:35,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:39:35,566 INFO L87 Difference]: Start difference. First operand 2658 states and 3387 transitions. Second operand 11 states. [2020-12-23 09:39:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:37,132 INFO L93 Difference]: Finished difference Result 7344 states and 9367 transitions. [2020-12-23 09:39:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 09:39:37,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2020-12-23 09:39:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:37,137 INFO L225 Difference]: With dead ends: 7344 [2020-12-23 09:39:37,137 INFO L226 Difference]: Without dead ends: 4901 [2020-12-23 09:39:37,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:39:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4901 states. [2020-12-23 09:39:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4901 to 2669. [2020-12-23 09:39:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2020-12-23 09:39:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3398 transitions. [2020-12-23 09:39:37,588 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3398 transitions. Word has length 145 [2020-12-23 09:39:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:37,588 INFO L481 AbstractCegarLoop]: Abstraction has 2669 states and 3398 transitions. [2020-12-23 09:39:37,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:39:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3398 transitions. [2020-12-23 09:39:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:39:37,592 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:37,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:37,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:37,793 INFO L429 AbstractCegarLoop]: === Iteration 42 === [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]=== [2020-12-23 09:39:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash -169521162, now seen corresponding path program 1 times [2020-12-23 09:39:37,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:37,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412230019] [2020-12-23 09:39:37,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:38,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412230019] [2020-12-23 09:39:38,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613312855] [2020-12-23 09:39:38,013 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:38,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-23 09:39:38,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 09:39:38,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:39:38,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2020-12-23 09:39:38,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911980831] [2020-12-23 09:39:38,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:39:38,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:38,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:39:38,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:39:38,457 INFO L87 Difference]: Start difference. First operand 2669 states and 3398 transitions. Second operand 6 states. [2020-12-23 09:39:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:39,765 INFO L93 Difference]: Finished difference Result 8721 states and 11381 transitions. [2020-12-23 09:39:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 09:39:39,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2020-12-23 09:39:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:39,774 INFO L225 Difference]: With dead ends: 8721 [2020-12-23 09:39:39,774 INFO L226 Difference]: Without dead ends: 6227 [2020-12-23 09:39:39,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:39:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2020-12-23 09:39:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 2669. [2020-12-23 09:39:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2020-12-23 09:39:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3396 transitions. [2020-12-23 09:39:40,261 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3396 transitions. Word has length 145 [2020-12-23 09:39:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:40,262 INFO L481 AbstractCegarLoop]: Abstraction has 2669 states and 3396 transitions. [2020-12-23 09:39:40,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:39:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3396 transitions. [2020-12-23 09:39:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 09:39:40,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:40,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:40,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-12-23 09:39:40,479 INFO L429 AbstractCegarLoop]: === Iteration 43 === [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]=== [2020-12-23 09:39:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash -601450378, now seen corresponding path program 1 times [2020-12-23 09:39:40,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:40,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801602061] [2020-12-23 09:39:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:40,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801602061] [2020-12-23 09:39:40,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625220578] [2020-12-23 09:39:40,668 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:40,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:39:40,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:41,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:41,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2020-12-23 09:39:41,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401949428] [2020-12-23 09:39:41,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:39:41,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:39:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:39:41,100 INFO L87 Difference]: Start difference. First operand 2669 states and 3396 transitions. Second operand 8 states. [2020-12-23 09:39:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:42,895 INFO L93 Difference]: Finished difference Result 10255 states and 13077 transitions. [2020-12-23 09:39:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 09:39:42,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2020-12-23 09:39:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:42,903 INFO L225 Difference]: With dead ends: 10255 [2020-12-23 09:39:42,904 INFO L226 Difference]: Without dead ends: 7801 [2020-12-23 09:39:42,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2020-12-23 09:39:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7801 states. [2020-12-23 09:39:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7801 to 4102. [2020-12-23 09:39:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4102 states. [2020-12-23 09:39:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5214 transitions. [2020-12-23 09:39:43,604 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5214 transitions. Word has length 146 [2020-12-23 09:39:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:43,604 INFO L481 AbstractCegarLoop]: Abstraction has 4102 states and 5214 transitions. [2020-12-23 09:39:43,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:39:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5214 transitions. [2020-12-23 09:39:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-12-23 09:39:43,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:43,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:43,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:43,811 INFO L429 AbstractCegarLoop]: === Iteration 44 === [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]=== [2020-12-23 09:39:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1640034952, now seen corresponding path program 1 times [2020-12-23 09:39:43,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:43,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505314566] [2020-12-23 09:39:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-12-23 09:39:43,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505314566] [2020-12-23 09:39:43,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:43,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:39:43,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845026071] [2020-12-23 09:39:43,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:39:43,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:43,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:39:43,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:39:43,884 INFO L87 Difference]: Start difference. First operand 4102 states and 5214 transitions. Second operand 4 states. [2020-12-23 09:39:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:44,547 INFO L93 Difference]: Finished difference Result 7148 states and 9168 transitions. [2020-12-23 09:39:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:44,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2020-12-23 09:39:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:44,551 INFO L225 Difference]: With dead ends: 7148 [2020-12-23 09:39:44,551 INFO L226 Difference]: Without dead ends: 3261 [2020-12-23 09:39:44,554 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 [2020-12-23 09:39:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2020-12-23 09:39:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 3242. [2020-12-23 09:39:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3242 states. [2020-12-23 09:39:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 4119 transitions. [2020-12-23 09:39:45,054 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 4119 transitions. Word has length 146 [2020-12-23 09:39:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:45,054 INFO L481 AbstractCegarLoop]: Abstraction has 3242 states and 4119 transitions. [2020-12-23 09:39:45,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:39:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4119 transitions. [2020-12-23 09:39:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 09:39:45,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:45,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:45,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 09:39:45,058 INFO L429 AbstractCegarLoop]: === Iteration 45 === [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]=== [2020-12-23 09:39:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1772878816, now seen corresponding path program 1 times [2020-12-23 09:39:45,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:45,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973527435] [2020-12-23 09:39:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:45,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973527435] [2020-12-23 09:39:45,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959690640] [2020-12-23 09:39:45,265 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:45,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 09:39:45,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:39:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:39:45,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:39:45,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2020-12-23 09:39:45,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305156864] [2020-12-23 09:39:45,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:39:45,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:39:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:39:45,822 INFO L87 Difference]: Start difference. First operand 3242 states and 4119 transitions. Second operand 15 states. [2020-12-23 09:39:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:58,307 INFO L93 Difference]: Finished difference Result 19168 states and 24742 transitions. [2020-12-23 09:39:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2020-12-23 09:39:58,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 148 [2020-12-23 09:39:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:58,324 INFO L225 Difference]: With dead ends: 19168 [2020-12-23 09:39:58,325 INFO L226 Difference]: Without dead ends: 16141 [2020-12-23 09:39:58,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12816 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4607, Invalid=26899, Unknown=0, NotChecked=0, Total=31506 [2020-12-23 09:39:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16141 states. [2020-12-23 09:39:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16141 to 3124. [2020-12-23 09:39:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-12-23 09:39:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 3913 transitions. [2020-12-23 09:39:59,029 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 3913 transitions. Word has length 148 [2020-12-23 09:39:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:59,029 INFO L481 AbstractCegarLoop]: Abstraction has 3124 states and 3913 transitions. [2020-12-23 09:39:59,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:39:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3913 transitions. [2020-12-23 09:39:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 09:39:59,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:59,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:59,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:39:59,233 INFO L429 AbstractCegarLoop]: === Iteration 46 === [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]=== [2020-12-23 09:39:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2043778853, now seen corresponding path program 1 times [2020-12-23 09:39:59,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:59,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235402303] [2020-12-23 09:39:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:39:59,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235402303] [2020-12-23 09:39:59,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:59,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:39:59,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062772611] [2020-12-23 09:39:59,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:39:59,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:39:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:39:59,418 INFO L87 Difference]: Start difference. First operand 3124 states and 3913 transitions. Second operand 6 states. [2020-12-23 09:40:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:01,433 INFO L93 Difference]: Finished difference Result 10605 states and 13605 transitions. [2020-12-23 09:40:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:40:01,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2020-12-23 09:40:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:01,441 INFO L225 Difference]: With dead ends: 10605 [2020-12-23 09:40:01,441 INFO L226 Difference]: Without dead ends: 7764 [2020-12-23 09:40:01,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:40:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2020-12-23 09:40:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 3205. [2020-12-23 09:40:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-12-23 09:40:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 4009 transitions. [2020-12-23 09:40:02,110 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 4009 transitions. Word has length 150 [2020-12-23 09:40:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:02,111 INFO L481 AbstractCegarLoop]: Abstraction has 3205 states and 4009 transitions. [2020-12-23 09:40:02,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:40:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 4009 transitions. [2020-12-23 09:40:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 09:40:02,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:02,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:02,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 09:40:02,114 INFO L429 AbstractCegarLoop]: === Iteration 47 === [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]=== [2020-12-23 09:40:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1490980259, now seen corresponding path program 1 times [2020-12-23 09:40:02,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:02,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000340567] [2020-12-23 09:40:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:40:02,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:40:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:40:02,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:40:02,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:40:02,357 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:40:02,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 09:40:02,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:40:02 BoogieIcfgContainer [2020-12-23 09:40:02,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:40:02,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:40:02,632 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:40:02,633 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:40:02,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:38:36" (3/4) ... [2020-12-23 09:40:02,636 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:40:02,877 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c-witness.graphml [2020-12-23 09:40:02,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:40:02,879 INFO L168 Benchmark]: Toolchain (without parser) took 88713.47 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 125.3 MB in the beginning and 1.0 GB in the end (delta: -905.9 MB). Peak memory consumption was 293.8 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 123.3 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:40:02,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 548.54 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 107.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.40 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 102.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,880 INFO L168 Benchmark]: Boogie Preprocessor took 163.11 ms. Allocated memory is still 151.0 MB. Free memory was 102.7 MB in the beginning and 131.1 MB in the end (delta: -28.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,881 INFO L168 Benchmark]: RCFGBuilder took 1447.15 ms. Allocated memory is still 151.0 MB. Free memory was 131.1 MB in the beginning and 128.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 87.9 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,881 INFO L168 Benchmark]: TraceAbstraction took 86205.97 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 127.6 MB in the beginning and 1.1 GB in the end (delta: -952.7 MB). Peak memory consumption was 245.9 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,881 INFO L168 Benchmark]: Witness Printer took 245.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.3 MB. Max. memory is 8.0 GB. [2020-12-23 09:40:02,884 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.18 ms. Allocated memory is still 151.0 MB. Free memory was 123.4 MB in the beginning and 123.3 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 548.54 ms. Allocated memory is still 151.0 MB. Free memory was 125.2 MB in the beginning and 107.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 89.40 ms. Allocated memory is still 151.0 MB. Free memory was 107.4 MB in the beginning and 102.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 163.11 ms. Allocated memory is still 151.0 MB. Free memory was 102.7 MB in the beginning and 131.1 MB in the end (delta: -28.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1447.15 ms. Allocated memory is still 151.0 MB. Free memory was 131.1 MB in the beginning and 128.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 87.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 86205.97 ms. Allocated memory was 151.0 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 127.6 MB in the beginning and 1.1 GB in the end (delta: -952.7 MB). Peak memory consumption was 245.9 MB. Max. memory is 8.0 GB. * Witness Printer took 245.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.0 MB). Peak memory consumption was 49.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [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] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [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] [L563] 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] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [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] [L582] 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=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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] [L409] COND FALSE !((int )side2 == 0) [L412] 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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-4, cs1_old=-1, cs2=0, cs2_new=-4, cs2_old=-1, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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] [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L447] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] COND TRUE ! side2Failed [L451] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L537] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L604] c1 = check() [L617] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L606] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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] [L582] 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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-5, cs1_old=-4, cs2=0, cs2_new=-1, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-4, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L347] 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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L350] 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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L351] COND TRUE (int )side2 != (int )nomsg [L352] 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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L408] 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=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-5, cs1_old=-4, cs2=0, cs2_new=-5, cs2_old=-1, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L604] c1 = check() [L617] COND TRUE ! arg VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-5, cs2=0, cs2_new=-1, cs2_old=-5, manual_selection_History_0=-5, manual_selection_History_1=-4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 297 locations, 23 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 85.8s, OverallIterations: 47, TraceHistogramMax: 2, AutomataDifference: 59.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22815 SDtfs, 52425 SDslu, 75242 SDs, 0 SdLazy, 13399 SolverSat, 741 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2536 GetRequests, 1697 SyntacticMatches, 21 SemanticMatches, 818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43810 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4102occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 74270 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5993 NumberOfCodeBlocks, 5993 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 5786 ConstructedInterpolants, 0 QuantifiedInterpolants, 2581274 SizeOfPredicates, 50 NumberOfNonLiveVariables, 8042 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 56 InterpolantComputations, 39 PerfectInterpolantSequences, 762/1012 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...