/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.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:32:57,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:32:57,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:32:57,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:32:57,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:32:57,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:32:57,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:32:57,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:32:57,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:32:57,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:32:57,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:32:57,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:32:57,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:32:57,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:32:57,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:32:57,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:32:57,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:32:57,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:32:57,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:32:57,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:32:57,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:32:57,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:32:57,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:32:57,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:32:57,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:32:57,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:32:57,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:32:57,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:32:57,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:32:57,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:32:57,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:32:57,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:32:57,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:32:57,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:32:57,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:32:57,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:32:57,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:32:57,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:32:57,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:32:57,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:32:57,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:32:57,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:32:57,215 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:32:57,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:32:57,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:32:57,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:32:57,220 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:32:57,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:32:57,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:32:57,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:32:57,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:32:57,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:32:57,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:32:57,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:32:57,223 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:32:57,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:32:57,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:32:57,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:32:57,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:32:57,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:57,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:32:57,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:32:57,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:32:57,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:32:57,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:32:57,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:32:57,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:32:57,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:32:57,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:32:57,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:32:57,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:32:57,689 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:32:57,689 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:32:57,690 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.ufo.UNBOUNDED.pals.c [2021-01-06 19:32:57,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c8542d5e7/370d0882be45484381cabe087b8224fa/FLAGcbb6508b2 [2021-01-06 19:32:58,527 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:32:58,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2021-01-06 19:32:58,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c8542d5e7/370d0882be45484381cabe087b8224fa/FLAGcbb6508b2 [2021-01-06 19:32:58,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c8542d5e7/370d0882be45484381cabe087b8224fa [2021-01-06 19:32:58,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:32:58,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:32:58,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:58,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:32:58,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:32:58,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:58" (1/1) ... [2021-01-06 19:32:58,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cee9cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:58, skipping insertion in model container [2021-01-06 19:32:58,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:58" (1/1) ... [2021-01-06 19:32:58,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:32:58,910 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,] [2021-01-06 19:32:59,189 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.ufo.UNBOUNDED.pals.c[14680,14693] [2021-01-06 19:32:59,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:59,216 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,] [2021-01-06 19:32:59,407 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.ufo.UNBOUNDED.pals.c[14680,14693] [2021-01-06 19:32:59,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:59,443 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:32:59,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59 WrapperNode [2021-01-06 19:32:59,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:59,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:59,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:32:59,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:32:59,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:59,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:32:59,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:32:59,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:32:59,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... [2021-01-06 19:32:59,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:32:59,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:32:59,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:32:59,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:32:59,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:32:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:32:59,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:32:59,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:33:01,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:33:01,386 INFO L299 CfgBuilder]: Removed 123 assume(true) statements. [2021-01-06 19:33:01,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:33:01 BoogieIcfgContainer [2021-01-06 19:33:01,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:33:01,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:33:01,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:33:01,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:33:01,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:32:58" (1/3) ... [2021-01-06 19:33:01,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f982b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:33:01, skipping insertion in model container [2021-01-06 19:33:01,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:59" (2/3) ... [2021-01-06 19:33:01,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f982b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:33:01, skipping insertion in model container [2021-01-06 19:33:01,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:33:01" (3/3) ... [2021-01-06 19:33:01,400 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.ufo.UNBOUNDED.pals.c [2021-01-06 19:33:01,408 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:33:01,415 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2021-01-06 19:33:01,437 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-01-06 19:33:01,473 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:33:01,474 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:33:01,474 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:33:01,474 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:33:01,474 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:33:01,474 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:33:01,474 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:33:01,475 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:33:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2021-01-06 19:33:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:33:01,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:01,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:01,515 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash 349506240, now seen corresponding path program 1 times [2021-01-06 19:33:01,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:01,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536631021] [2021-01-06 19:33:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:01,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536631021] [2021-01-06 19:33:01,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:01,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:33:01,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086459179] [2021-01-06 19:33:01,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:33:01,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:01,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:33:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:33:01,916 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 2 states. [2021-01-06 19:33:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:02,006 INFO L93 Difference]: Finished difference Result 572 states and 896 transitions. [2021-01-06 19:33:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:33:02,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:33:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:02,051 INFO L225 Difference]: With dead ends: 572 [2021-01-06 19:33:02,051 INFO L226 Difference]: Without dead ends: 292 [2021-01-06 19:33:02,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:33:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-01-06 19:33:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-01-06 19:33:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2021-01-06 19:33:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 428 transitions. [2021-01-06 19:33:02,130 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 428 transitions. Word has length 33 [2021-01-06 19:33:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:02,131 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 428 transitions. [2021-01-06 19:33:02,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:33:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 428 transitions. [2021-01-06 19:33:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:33:02,133 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:02,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:02,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:33:02,134 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1047215368, now seen corresponding path program 1 times [2021-01-06 19:33:02,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:02,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278809163] [2021-01-06 19:33:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:02,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278809163] [2021-01-06 19:33:02,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:02,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:02,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198475065] [2021-01-06 19:33:02,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:02,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:02,236 INFO L87 Difference]: Start difference. First operand 292 states and 428 transitions. Second operand 4 states. [2021-01-06 19:33:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:02,308 INFO L93 Difference]: Finished difference Result 570 states and 830 transitions. [2021-01-06 19:33:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:02,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2021-01-06 19:33:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:02,312 INFO L225 Difference]: With dead ends: 570 [2021-01-06 19:33:02,312 INFO L226 Difference]: Without dead ends: 292 [2021-01-06 19:33:02,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-01-06 19:33:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-01-06 19:33:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2021-01-06 19:33:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2021-01-06 19:33:02,342 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 33 [2021-01-06 19:33:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:02,342 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2021-01-06 19:33:02,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:02,342 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2021-01-06 19:33:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 19:33:02,344 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:02,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:02,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:33:02,346 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -600938825, now seen corresponding path program 1 times [2021-01-06 19:33:02,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:02,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123887756] [2021-01-06 19:33:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:02,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123887756] [2021-01-06 19:33:02,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:02,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:02,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600712558] [2021-01-06 19:33:02,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:02,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:02,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:02,613 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 3 states. [2021-01-06 19:33:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:02,666 INFO L93 Difference]: Finished difference Result 600 states and 864 transitions. [2021-01-06 19:33:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:02,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 19:33:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:02,670 INFO L225 Difference]: With dead ends: 600 [2021-01-06 19:33:02,670 INFO L226 Difference]: Without dead ends: 325 [2021-01-06 19:33:02,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-01-06 19:33:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 268. [2021-01-06 19:33:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2021-01-06 19:33:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2021-01-06 19:33:02,687 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 44 [2021-01-06 19:33:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:02,688 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2021-01-06 19:33:02,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2021-01-06 19:33:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 19:33:02,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:02,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:02,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:33:02,691 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1585020226, now seen corresponding path program 1 times [2021-01-06 19:33:02,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:02,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139223059] [2021-01-06 19:33:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:02,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139223059] [2021-01-06 19:33:02,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:02,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:02,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976782284] [2021-01-06 19:33:02,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:02,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:02,854 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand 3 states. [2021-01-06 19:33:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:02,892 INFO L93 Difference]: Finished difference Result 747 states and 1071 transitions. [2021-01-06 19:33:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:02,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 19:33:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:02,897 INFO L225 Difference]: With dead ends: 747 [2021-01-06 19:33:02,897 INFO L226 Difference]: Without dead ends: 496 [2021-01-06 19:33:02,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-01-06 19:33:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 303. [2021-01-06 19:33:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2021-01-06 19:33:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 432 transitions. [2021-01-06 19:33:02,917 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 432 transitions. Word has length 53 [2021-01-06 19:33:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:02,917 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 432 transitions. [2021-01-06 19:33:02,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 432 transitions. [2021-01-06 19:33:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:33:02,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:02,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:02,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:33:02,920 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1396202520, now seen corresponding path program 1 times [2021-01-06 19:33:02,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:02,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517400808] [2021-01-06 19:33:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:03,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517400808] [2021-01-06 19:33:03,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:03,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:03,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945570563] [2021-01-06 19:33:03,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:03,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:03,057 INFO L87 Difference]: Start difference. First operand 303 states and 432 transitions. Second operand 3 states. [2021-01-06 19:33:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:03,100 INFO L93 Difference]: Finished difference Result 831 states and 1196 transitions. [2021-01-06 19:33:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:03,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-06 19:33:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:03,105 INFO L225 Difference]: With dead ends: 831 [2021-01-06 19:33:03,106 INFO L226 Difference]: Without dead ends: 545 [2021-01-06 19:33:03,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-01-06 19:33:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 328. [2021-01-06 19:33:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2021-01-06 19:33:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 470 transitions. [2021-01-06 19:33:03,126 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 470 transitions. Word has length 54 [2021-01-06 19:33:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:03,127 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 470 transitions. [2021-01-06 19:33:03,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 470 transitions. [2021-01-06 19:33:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:33:03,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:03,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:03,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:33:03,130 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash -716144150, now seen corresponding path program 1 times [2021-01-06 19:33:03,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:03,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230664840] [2021-01-06 19:33:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:03,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230664840] [2021-01-06 19:33:03,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:03,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:03,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827238283] [2021-01-06 19:33:03,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:03,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:03,258 INFO L87 Difference]: Start difference. First operand 328 states and 470 transitions. Second operand 5 states. [2021-01-06 19:33:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:03,488 INFO L93 Difference]: Finished difference Result 1020 states and 1473 transitions. [2021-01-06 19:33:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:03,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2021-01-06 19:33:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:03,493 INFO L225 Difference]: With dead ends: 1020 [2021-01-06 19:33:03,494 INFO L226 Difference]: Without dead ends: 709 [2021-01-06 19:33:03,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:33:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-01-06 19:33:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 426. [2021-01-06 19:33:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2021-01-06 19:33:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2021-01-06 19:33:03,517 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 54 [2021-01-06 19:33:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:03,517 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2021-01-06 19:33:03,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2021-01-06 19:33:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 19:33:03,519 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:03,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:03,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:33:03,519 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash 153208358, now seen corresponding path program 1 times [2021-01-06 19:33:03,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:03,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356375630] [2021-01-06 19:33:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:03,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356375630] [2021-01-06 19:33:03,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:03,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:03,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675857712] [2021-01-06 19:33:03,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:03,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:03,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:03,603 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand 5 states. [2021-01-06 19:33:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:03,922 INFO L93 Difference]: Finished difference Result 1024 states and 1473 transitions. [2021-01-06 19:33:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:03,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2021-01-06 19:33:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:03,932 INFO L225 Difference]: With dead ends: 1024 [2021-01-06 19:33:03,935 INFO L226 Difference]: Without dead ends: 713 [2021-01-06 19:33:03,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:33:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-01-06 19:33:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2021-01-06 19:33:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-06 19:33:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2021-01-06 19:33:03,983 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 55 [2021-01-06 19:33:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:03,983 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2021-01-06 19:33:03,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2021-01-06 19:33:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 19:33:03,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:03,984 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] [2021-01-06 19:33:03,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:33:03,985 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash -748848364, now seen corresponding path program 1 times [2021-01-06 19:33:03,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:03,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897610848] [2021-01-06 19:33:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:04,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897610848] [2021-01-06 19:33:04,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:04,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:04,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637414307] [2021-01-06 19:33:04,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:04,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:04,076 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 4 states. [2021-01-06 19:33:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:04,328 INFO L93 Difference]: Finished difference Result 1024 states and 1465 transitions. [2021-01-06 19:33:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:04,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 19:33:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:04,332 INFO L225 Difference]: With dead ends: 1024 [2021-01-06 19:33:04,333 INFO L226 Difference]: Without dead ends: 713 [2021-01-06 19:33:04,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-01-06 19:33:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 434. [2021-01-06 19:33:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-01-06 19:33:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 611 transitions. [2021-01-06 19:33:04,359 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 611 transitions. Word has length 57 [2021-01-06 19:33:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:04,360 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 611 transitions. [2021-01-06 19:33:04,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 611 transitions. [2021-01-06 19:33:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 19:33:04,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:04,361 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] [2021-01-06 19:33:04,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:33:04,361 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2035065116, now seen corresponding path program 1 times [2021-01-06 19:33:04,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:04,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822001624] [2021-01-06 19:33:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:04,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822001624] [2021-01-06 19:33:04,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:04,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:04,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390413217] [2021-01-06 19:33:04,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:04,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,476 INFO L87 Difference]: Start difference. First operand 434 states and 611 transitions. Second operand 3 states. [2021-01-06 19:33:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:04,521 INFO L93 Difference]: Finished difference Result 872 states and 1252 transitions. [2021-01-06 19:33:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:04,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 19:33:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:04,525 INFO L225 Difference]: With dead ends: 872 [2021-01-06 19:33:04,525 INFO L226 Difference]: Without dead ends: 561 [2021-01-06 19:33:04,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-01-06 19:33:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 429. [2021-01-06 19:33:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2021-01-06 19:33:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 603 transitions. [2021-01-06 19:33:04,551 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 603 transitions. Word has length 58 [2021-01-06 19:33:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:04,552 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 603 transitions. [2021-01-06 19:33:04,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 603 transitions. [2021-01-06 19:33:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 19:33:04,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:04,553 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] [2021-01-06 19:33:04,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:33:04,553 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1833641356, now seen corresponding path program 1 times [2021-01-06 19:33:04,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:04,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976805637] [2021-01-06 19:33:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:04,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976805637] [2021-01-06 19:33:04,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:04,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:04,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654180168] [2021-01-06 19:33:04,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:04,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,685 INFO L87 Difference]: Start difference. First operand 429 states and 603 transitions. Second operand 3 states. [2021-01-06 19:33:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:04,768 INFO L93 Difference]: Finished difference Result 871 states and 1251 transitions. [2021-01-06 19:33:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:04,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 19:33:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:04,772 INFO L225 Difference]: With dead ends: 871 [2021-01-06 19:33:04,772 INFO L226 Difference]: Without dead ends: 565 [2021-01-06 19:33:04,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-01-06 19:33:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 409. [2021-01-06 19:33:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2021-01-06 19:33:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 571 transitions. [2021-01-06 19:33:04,800 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 571 transitions. Word has length 62 [2021-01-06 19:33:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:04,800 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 571 transitions. [2021-01-06 19:33:04,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 571 transitions. [2021-01-06 19:33:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:33:04,801 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:04,801 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] [2021-01-06 19:33:04,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:33:04,802 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -532758708, now seen corresponding path program 1 times [2021-01-06 19:33:04,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:04,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147594220] [2021-01-06 19:33:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:04,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147594220] [2021-01-06 19:33:04,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:04,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:04,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519980547] [2021-01-06 19:33:04,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:04,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:04,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:04,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,870 INFO L87 Difference]: Start difference. First operand 409 states and 571 transitions. Second operand 3 states. [2021-01-06 19:33:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:04,934 INFO L93 Difference]: Finished difference Result 839 states and 1195 transitions. [2021-01-06 19:33:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:04,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:33:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:04,938 INFO L225 Difference]: With dead ends: 839 [2021-01-06 19:33:04,938 INFO L226 Difference]: Without dead ends: 553 [2021-01-06 19:33:04,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2021-01-06 19:33:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 397. [2021-01-06 19:33:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2021-01-06 19:33:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2021-01-06 19:33:04,965 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 66 [2021-01-06 19:33:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:04,966 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2021-01-06 19:33:04,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2021-01-06 19:33:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:33:04,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:04,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:04,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:33:04,967 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 949999250, now seen corresponding path program 1 times [2021-01-06 19:33:04,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:04,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357149368] [2021-01-06 19:33:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:05,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357149368] [2021-01-06 19:33:05,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:05,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:05,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208864868] [2021-01-06 19:33:05,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:05,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:05,050 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 6 states. [2021-01-06 19:33:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:05,235 INFO L93 Difference]: Finished difference Result 1453 states and 2062 transitions. [2021-01-06 19:33:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:05,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2021-01-06 19:33:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:05,242 INFO L225 Difference]: With dead ends: 1453 [2021-01-06 19:33:05,242 INFO L226 Difference]: Without dead ends: 1179 [2021-01-06 19:33:05,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2021-01-06 19:33:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 418. [2021-01-06 19:33:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2021-01-06 19:33:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 577 transitions. [2021-01-06 19:33:05,285 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 577 transitions. Word has length 67 [2021-01-06 19:33:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:05,285 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 577 transitions. [2021-01-06 19:33:05,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 577 transitions. [2021-01-06 19:33:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:33:05,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:05,286 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] [2021-01-06 19:33:05,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:33:05,287 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1947699729, now seen corresponding path program 1 times [2021-01-06 19:33:05,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:05,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010566914] [2021-01-06 19:33:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:05,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010566914] [2021-01-06 19:33:05,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:05,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:05,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648025424] [2021-01-06 19:33:05,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:05,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:05,377 INFO L87 Difference]: Start difference. First operand 418 states and 577 transitions. Second operand 3 states. [2021-01-06 19:33:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:05,473 INFO L93 Difference]: Finished difference Result 856 states and 1211 transitions. [2021-01-06 19:33:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:05,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 19:33:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:05,477 INFO L225 Difference]: With dead ends: 856 [2021-01-06 19:33:05,477 INFO L226 Difference]: Without dead ends: 582 [2021-01-06 19:33:05,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-01-06 19:33:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 398. [2021-01-06 19:33:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2021-01-06 19:33:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 545 transitions. [2021-01-06 19:33:05,508 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 545 transitions. Word has length 69 [2021-01-06 19:33:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:05,508 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 545 transitions. [2021-01-06 19:33:05,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 545 transitions. [2021-01-06 19:33:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:33:05,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:05,510 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] [2021-01-06 19:33:05,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:33:05,510 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -344815767, now seen corresponding path program 1 times [2021-01-06 19:33:05,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:05,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896020554] [2021-01-06 19:33:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:05,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896020554] [2021-01-06 19:33:05,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:05,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:05,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474859274] [2021-01-06 19:33:05,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:05,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:05,571 INFO L87 Difference]: Start difference. First operand 398 states and 545 transitions. Second operand 3 states. [2021-01-06 19:33:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:05,646 INFO L93 Difference]: Finished difference Result 824 states and 1155 transitions. [2021-01-06 19:33:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:05,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 19:33:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:05,650 INFO L225 Difference]: With dead ends: 824 [2021-01-06 19:33:05,650 INFO L226 Difference]: Without dead ends: 570 [2021-01-06 19:33:05,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-01-06 19:33:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 386. [2021-01-06 19:33:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2021-01-06 19:33:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 527 transitions. [2021-01-06 19:33:05,683 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 527 transitions. Word has length 73 [2021-01-06 19:33:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:05,683 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 527 transitions. [2021-01-06 19:33:05,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 527 transitions. [2021-01-06 19:33:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:33:05,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:05,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:05,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:33:05,685 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1959055909, now seen corresponding path program 1 times [2021-01-06 19:33:05,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:05,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584171174] [2021-01-06 19:33:05,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:05,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584171174] [2021-01-06 19:33:05,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:05,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:05,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30891021] [2021-01-06 19:33:05,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:05,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:05,859 INFO L87 Difference]: Start difference. First operand 386 states and 527 transitions. Second operand 6 states. [2021-01-06 19:33:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:06,076 INFO L93 Difference]: Finished difference Result 1097 states and 1536 transitions. [2021-01-06 19:33:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:06,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 19:33:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:06,081 INFO L225 Difference]: With dead ends: 1097 [2021-01-06 19:33:06,081 INFO L226 Difference]: Without dead ends: 855 [2021-01-06 19:33:06,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-01-06 19:33:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 411. [2021-01-06 19:33:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2021-01-06 19:33:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 562 transitions. [2021-01-06 19:33:06,121 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 562 transitions. Word has length 76 [2021-01-06 19:33:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:06,122 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 562 transitions. [2021-01-06 19:33:06,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 562 transitions. [2021-01-06 19:33:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:33:06,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:06,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:06,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:33:06,123 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash 317146558, now seen corresponding path program 1 times [2021-01-06 19:33:06,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:06,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479819804] [2021-01-06 19:33:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:06,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479819804] [2021-01-06 19:33:06,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:06,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:33:06,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494590804] [2021-01-06 19:33:06,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:33:06,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:06,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:33:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:33:06,250 INFO L87 Difference]: Start difference. First operand 411 states and 562 transitions. Second operand 7 states. [2021-01-06 19:33:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:06,649 INFO L93 Difference]: Finished difference Result 1425 states and 1984 transitions. [2021-01-06 19:33:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:33:06,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2021-01-06 19:33:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:06,656 INFO L225 Difference]: With dead ends: 1425 [2021-01-06 19:33:06,656 INFO L226 Difference]: Without dead ends: 1165 [2021-01-06 19:33:06,657 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 [2021-01-06 19:33:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-01-06 19:33:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 439. [2021-01-06 19:33:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2021-01-06 19:33:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 593 transitions. [2021-01-06 19:33:06,715 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 593 transitions. Word has length 76 [2021-01-06 19:33:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:06,715 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 593 transitions. [2021-01-06 19:33:06,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:33:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 593 transitions. [2021-01-06 19:33:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:33:06,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:06,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:06,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:33:06,717 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash 917353494, now seen corresponding path program 1 times [2021-01-06 19:33:06,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:06,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902824553] [2021-01-06 19:33:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:06,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902824553] [2021-01-06 19:33:06,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:06,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:06,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391773346] [2021-01-06 19:33:06,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:06,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:06,780 INFO L87 Difference]: Start difference. First operand 439 states and 593 transitions. Second operand 4 states. [2021-01-06 19:33:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:06,975 INFO L93 Difference]: Finished difference Result 1127 states and 1539 transitions. [2021-01-06 19:33:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:06,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:33:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:06,981 INFO L225 Difference]: With dead ends: 1127 [2021-01-06 19:33:06,981 INFO L226 Difference]: Without dead ends: 861 [2021-01-06 19:33:06,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-01-06 19:33:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 660. [2021-01-06 19:33:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2021-01-06 19:33:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 881 transitions. [2021-01-06 19:33:07,085 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 881 transitions. Word has length 76 [2021-01-06 19:33:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:07,086 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 881 transitions. [2021-01-06 19:33:07,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 881 transitions. [2021-01-06 19:33:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:33:07,090 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:07,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:07,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:33:07,092 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash 956639496, now seen corresponding path program 1 times [2021-01-06 19:33:07,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:07,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941135740] [2021-01-06 19:33:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:07,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941135740] [2021-01-06 19:33:07,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:07,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:07,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389703557] [2021-01-06 19:33:07,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:07,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:07,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:07,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:07,223 INFO L87 Difference]: Start difference. First operand 660 states and 881 transitions. Second operand 3 states. [2021-01-06 19:33:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:07,353 INFO L93 Difference]: Finished difference Result 1151 states and 1571 transitions. [2021-01-06 19:33:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:07,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:33:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:07,358 INFO L225 Difference]: With dead ends: 1151 [2021-01-06 19:33:07,359 INFO L226 Difference]: Without dead ends: 770 [2021-01-06 19:33:07,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-01-06 19:33:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 656. [2021-01-06 19:33:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2021-01-06 19:33:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 874 transitions. [2021-01-06 19:33:07,441 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 874 transitions. Word has length 77 [2021-01-06 19:33:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:07,441 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 874 transitions. [2021-01-06 19:33:07,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 874 transitions. [2021-01-06 19:33:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:33:07,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:07,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:07,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:33:07,443 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:07,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:07,444 INFO L82 PathProgramCache]: Analyzing trace with hash 341178161, now seen corresponding path program 1 times [2021-01-06 19:33:07,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:07,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655330380] [2021-01-06 19:33:07,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:07,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655330380] [2021-01-06 19:33:07,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:07,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:07,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333652154] [2021-01-06 19:33:07,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:07,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:07,555 INFO L87 Difference]: Start difference. First operand 656 states and 874 transitions. Second operand 4 states. [2021-01-06 19:33:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:07,751 INFO L93 Difference]: Finished difference Result 1465 states and 1975 transitions. [2021-01-06 19:33:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:07,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:33:07,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:07,757 INFO L225 Difference]: With dead ends: 1465 [2021-01-06 19:33:07,757 INFO L226 Difference]: Without dead ends: 1074 [2021-01-06 19:33:07,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2021-01-06 19:33:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 875. [2021-01-06 19:33:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2021-01-06 19:33:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1156 transitions. [2021-01-06 19:33:07,865 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1156 transitions. Word has length 78 [2021-01-06 19:33:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:07,865 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 1156 transitions. [2021-01-06 19:33:07,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1156 transitions. [2021-01-06 19:33:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:33:07,867 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:07,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:33:07,867 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1360037685, now seen corresponding path program 1 times [2021-01-06 19:33:07,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:07,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039075882] [2021-01-06 19:33:07,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:08,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039075882] [2021-01-06 19:33:08,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:08,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:08,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198409819] [2021-01-06 19:33:08,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:08,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:08,060 INFO L87 Difference]: Start difference. First operand 875 states and 1156 transitions. Second operand 6 states. [2021-01-06 19:33:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:08,654 INFO L93 Difference]: Finished difference Result 3252 states and 4369 transitions. [2021-01-06 19:33:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:33:08,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-01-06 19:33:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:08,668 INFO L225 Difference]: With dead ends: 3252 [2021-01-06 19:33:08,668 INFO L226 Difference]: Without dead ends: 2730 [2021-01-06 19:33:08,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:33:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2021-01-06 19:33:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 1001. [2021-01-06 19:33:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2021-01-06 19:33:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1303 transitions. [2021-01-06 19:33:08,803 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1303 transitions. Word has length 78 [2021-01-06 19:33:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:08,804 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1303 transitions. [2021-01-06 19:33:08,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1303 transitions. [2021-01-06 19:33:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:33:08,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:08,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:08,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:33:08,806 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash -504696615, now seen corresponding path program 1 times [2021-01-06 19:33:08,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:08,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041605650] [2021-01-06 19:33:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:08,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041605650] [2021-01-06 19:33:08,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:08,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:08,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869030724] [2021-01-06 19:33:08,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:08,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:08,869 INFO L87 Difference]: Start difference. First operand 1001 states and 1303 transitions. Second operand 4 states. [2021-01-06 19:33:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:09,110 INFO L93 Difference]: Finished difference Result 2405 states and 3178 transitions. [2021-01-06 19:33:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:09,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:33:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:09,119 INFO L225 Difference]: With dead ends: 2405 [2021-01-06 19:33:09,119 INFO L226 Difference]: Without dead ends: 1835 [2021-01-06 19:33:09,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2021-01-06 19:33:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1356. [2021-01-06 19:33:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2021-01-06 19:33:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1760 transitions. [2021-01-06 19:33:09,282 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1760 transitions. Word has length 79 [2021-01-06 19:33:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:09,282 INFO L481 AbstractCegarLoop]: Abstraction has 1356 states and 1760 transitions. [2021-01-06 19:33:09,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1760 transitions. [2021-01-06 19:33:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:33:09,284 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:09,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:09,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:33:09,285 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -676572605, now seen corresponding path program 1 times [2021-01-06 19:33:09,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:09,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74141912] [2021-01-06 19:33:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:09,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74141912] [2021-01-06 19:33:09,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:09,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:09,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472702303] [2021-01-06 19:33:09,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:09,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:09,325 INFO L87 Difference]: Start difference. First operand 1356 states and 1760 transitions. Second operand 3 states. [2021-01-06 19:33:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:09,609 INFO L93 Difference]: Finished difference Result 3202 states and 4179 transitions. [2021-01-06 19:33:09,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:09,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:33:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:09,619 INFO L225 Difference]: With dead ends: 3202 [2021-01-06 19:33:09,619 INFO L226 Difference]: Without dead ends: 2224 [2021-01-06 19:33:09,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2021-01-06 19:33:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1358. [2021-01-06 19:33:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2021-01-06 19:33:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1762 transitions. [2021-01-06 19:33:09,787 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1762 transitions. Word has length 80 [2021-01-06 19:33:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:09,787 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1762 transitions. [2021-01-06 19:33:09,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1762 transitions. [2021-01-06 19:33:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:33:09,789 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:09,790 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] [2021-01-06 19:33:09,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:33:09,790 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash 614216993, now seen corresponding path program 1 times [2021-01-06 19:33:09,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:09,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871575113] [2021-01-06 19:33:09,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:09,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871575113] [2021-01-06 19:33:09,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:09,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:09,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234154021] [2021-01-06 19:33:09,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:09,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:09,890 INFO L87 Difference]: Start difference. First operand 1358 states and 1762 transitions. Second operand 6 states. [2021-01-06 19:33:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:10,214 INFO L93 Difference]: Finished difference Result 2145 states and 2828 transitions. [2021-01-06 19:33:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:33:10,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2021-01-06 19:33:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:10,225 INFO L225 Difference]: With dead ends: 2145 [2021-01-06 19:33:10,225 INFO L226 Difference]: Without dead ends: 2143 [2021-01-06 19:33:10,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:33:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-01-06 19:33:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1360. [2021-01-06 19:33:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2021-01-06 19:33:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1764 transitions. [2021-01-06 19:33:10,435 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1764 transitions. Word has length 81 [2021-01-06 19:33:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:10,435 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1764 transitions. [2021-01-06 19:33:10,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1764 transitions. [2021-01-06 19:33:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:33:10,437 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:10,438 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] [2021-01-06 19:33:10,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:33:10,438 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1500088230, now seen corresponding path program 1 times [2021-01-06 19:33:10,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:10,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286194752] [2021-01-06 19:33:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:10,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286194752] [2021-01-06 19:33:10,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:10,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:10,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707796271] [2021-01-06 19:33:10,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:10,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:10,561 INFO L87 Difference]: Start difference. First operand 1360 states and 1764 transitions. Second operand 6 states. [2021-01-06 19:33:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:11,044 INFO L93 Difference]: Finished difference Result 3228 states and 4330 transitions. [2021-01-06 19:33:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:11,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2021-01-06 19:33:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:11,056 INFO L225 Difference]: With dead ends: 3228 [2021-01-06 19:33:11,056 INFO L226 Difference]: Without dead ends: 2410 [2021-01-06 19:33:11,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-01-06 19:33:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 1360. [2021-01-06 19:33:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2021-01-06 19:33:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1752 transitions. [2021-01-06 19:33:11,222 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1752 transitions. Word has length 81 [2021-01-06 19:33:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:11,222 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1752 transitions. [2021-01-06 19:33:11,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1752 transitions. [2021-01-06 19:33:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:33:11,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:11,225 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] [2021-01-06 19:33:11,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:33:11,225 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:11,226 INFO L82 PathProgramCache]: Analyzing trace with hash -659983772, now seen corresponding path program 1 times [2021-01-06 19:33:11,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:11,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237797375] [2021-01-06 19:33:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:11,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237797375] [2021-01-06 19:33:11,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:11,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:11,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675117086] [2021-01-06 19:33:11,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:11,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:11,296 INFO L87 Difference]: Start difference. First operand 1360 states and 1752 transitions. Second operand 4 states. [2021-01-06 19:33:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:11,557 INFO L93 Difference]: Finished difference Result 2706 states and 3519 transitions. [2021-01-06 19:33:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:11,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 19:33:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:11,565 INFO L225 Difference]: With dead ends: 2706 [2021-01-06 19:33:11,565 INFO L226 Difference]: Without dead ends: 1422 [2021-01-06 19:33:11,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2021-01-06 19:33:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1060. [2021-01-06 19:33:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2021-01-06 19:33:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1384 transitions. [2021-01-06 19:33:11,738 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1384 transitions. Word has length 81 [2021-01-06 19:33:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:11,738 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1384 transitions. [2021-01-06 19:33:11,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1384 transitions. [2021-01-06 19:33:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:33:11,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:11,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:11,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:33:11,740 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -63459148, now seen corresponding path program 1 times [2021-01-06 19:33:11,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:11,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197429902] [2021-01-06 19:33:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:11,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197429902] [2021-01-06 19:33:11,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:11,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:11,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320162522] [2021-01-06 19:33:11,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:33:11,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:33:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:11,784 INFO L87 Difference]: Start difference. First operand 1060 states and 1384 transitions. Second operand 3 states. [2021-01-06 19:33:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:12,082 INFO L93 Difference]: Finished difference Result 2504 states and 3290 transitions. [2021-01-06 19:33:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:33:12,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:33:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:12,089 INFO L225 Difference]: With dead ends: 2504 [2021-01-06 19:33:12,090 INFO L226 Difference]: Without dead ends: 1594 [2021-01-06 19:33:12,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:33:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2021-01-06 19:33:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1066. [2021-01-06 19:33:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2021-01-06 19:33:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1390 transitions. [2021-01-06 19:33:12,272 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1390 transitions. Word has length 82 [2021-01-06 19:33:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:12,272 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1390 transitions. [2021-01-06 19:33:12,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:33:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1390 transitions. [2021-01-06 19:33:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:33:12,273 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:12,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:33:12,274 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -753963456, now seen corresponding path program 1 times [2021-01-06 19:33:12,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:12,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717483388] [2021-01-06 19:33:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:12,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717483388] [2021-01-06 19:33:12,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:12,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:12,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809560186] [2021-01-06 19:33:12,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:12,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:12,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:12,350 INFO L87 Difference]: Start difference. First operand 1066 states and 1390 transitions. Second operand 4 states. [2021-01-06 19:33:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:12,602 INFO L93 Difference]: Finished difference Result 2448 states and 3210 transitions. [2021-01-06 19:33:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:12,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 19:33:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:12,607 INFO L225 Difference]: With dead ends: 2448 [2021-01-06 19:33:12,607 INFO L226 Difference]: Without dead ends: 1482 [2021-01-06 19:33:12,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2021-01-06 19:33:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1006. [2021-01-06 19:33:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2021-01-06 19:33:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1308 transitions. [2021-01-06 19:33:12,743 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1308 transitions. Word has length 82 [2021-01-06 19:33:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:12,743 INFO L481 AbstractCegarLoop]: Abstraction has 1006 states and 1308 transitions. [2021-01-06 19:33:12,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1308 transitions. [2021-01-06 19:33:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:33:12,745 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:12,745 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] [2021-01-06 19:33:12,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:33:12,745 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash -883855950, now seen corresponding path program 1 times [2021-01-06 19:33:12,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:12,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885636159] [2021-01-06 19:33:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:12,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885636159] [2021-01-06 19:33:12,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:12,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:12,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787897006] [2021-01-06 19:33:12,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:12,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:12,925 INFO L87 Difference]: Start difference. First operand 1006 states and 1308 transitions. Second operand 6 states. [2021-01-06 19:33:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:13,533 INFO L93 Difference]: Finished difference Result 3321 states and 4518 transitions. [2021-01-06 19:33:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:13,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2021-01-06 19:33:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:13,539 INFO L225 Difference]: With dead ends: 3321 [2021-01-06 19:33:13,539 INFO L226 Difference]: Without dead ends: 2514 [2021-01-06 19:33:13,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2021-01-06 19:33:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 994. [2021-01-06 19:33:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2021-01-06 19:33:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1296 transitions. [2021-01-06 19:33:13,710 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1296 transitions. Word has length 84 [2021-01-06 19:33:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:13,710 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1296 transitions. [2021-01-06 19:33:13,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1296 transitions. [2021-01-06 19:33:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:33:13,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:13,712 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] [2021-01-06 19:33:13,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:33:13,712 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1751255189, now seen corresponding path program 1 times [2021-01-06 19:33:13,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:13,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832879302] [2021-01-06 19:33:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:13,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832879302] [2021-01-06 19:33:13,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:13,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:13,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091869836] [2021-01-06 19:33:13,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:13,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:13,796 INFO L87 Difference]: Start difference. First operand 994 states and 1296 transitions. Second operand 6 states. [2021-01-06 19:33:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:14,129 INFO L93 Difference]: Finished difference Result 2388 states and 3264 transitions. [2021-01-06 19:33:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:33:14,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2021-01-06 19:33:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:14,135 INFO L225 Difference]: With dead ends: 2388 [2021-01-06 19:33:14,135 INFO L226 Difference]: Without dead ends: 1581 [2021-01-06 19:33:14,137 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 [2021-01-06 19:33:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2021-01-06 19:33:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1000. [2021-01-06 19:33:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2021-01-06 19:33:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1302 transitions. [2021-01-06 19:33:14,295 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1302 transitions. Word has length 85 [2021-01-06 19:33:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:14,295 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1302 transitions. [2021-01-06 19:33:14,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1302 transitions. [2021-01-06 19:33:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-01-06 19:33:14,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:14,299 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] [2021-01-06 19:33:14,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:33:14,300 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2138552324, now seen corresponding path program 1 times [2021-01-06 19:33:14,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:14,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147342588] [2021-01-06 19:33:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:14,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147342588] [2021-01-06 19:33:14,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019179040] [2021-01-06 19:33:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:14,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:33:14,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:33:15,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:33:15,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-01-06 19:33:15,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028210356] [2021-01-06 19:33:15,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:15,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:33:15,036 INFO L87 Difference]: Start difference. First operand 1000 states and 1302 transitions. Second operand 6 states. [2021-01-06 19:33:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:15,700 INFO L93 Difference]: Finished difference Result 2593 states and 3515 transitions. [2021-01-06 19:33:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:33:15,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2021-01-06 19:33:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:15,705 INFO L225 Difference]: With dead ends: 2593 [2021-01-06 19:33:15,705 INFO L226 Difference]: Without dead ends: 1780 [2021-01-06 19:33:15,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:33:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2021-01-06 19:33:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1000. [2021-01-06 19:33:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2021-01-06 19:33:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1301 transitions. [2021-01-06 19:33:15,957 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1301 transitions. Word has length 134 [2021-01-06 19:33:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:15,958 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 1301 transitions. [2021-01-06 19:33:15,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1301 transitions. [2021-01-06 19:33:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:33:15,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:15,962 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] [2021-01-06 19:33:16,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:16,176 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -687074335, now seen corresponding path program 1 times [2021-01-06 19:33:16,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:16,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086949126] [2021-01-06 19:33:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:16,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086949126] [2021-01-06 19:33:16,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695010827] [2021-01-06 19:33:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:16,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:33:16,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:16,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:16,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-01-06 19:33:16,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766478937] [2021-01-06 19:33:16,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:33:16,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:33:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:33:16,836 INFO L87 Difference]: Start difference. First operand 1000 states and 1301 transitions. Second operand 13 states. [2021-01-06 19:33:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:30,681 INFO L93 Difference]: Finished difference Result 16786 states and 22436 transitions. [2021-01-06 19:33:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2021-01-06 19:33:30,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2021-01-06 19:33:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:30,727 INFO L225 Difference]: With dead ends: 16786 [2021-01-06 19:33:30,727 INFO L226 Difference]: Without dead ends: 15979 [2021-01-06 19:33:30,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28995 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2021-01-06 19:33:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15979 states. [2021-01-06 19:33:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15979 to 2718. [2021-01-06 19:33:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2021-01-06 19:33:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3545 transitions. [2021-01-06 19:33:31,445 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3545 transitions. Word has length 138 [2021-01-06 19:33:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:31,445 INFO L481 AbstractCegarLoop]: Abstraction has 2718 states and 3545 transitions. [2021-01-06 19:33:31,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:33:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3545 transitions. [2021-01-06 19:33:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 19:33:31,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:31,453 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] [2021-01-06 19:33:31,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:31,667 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1319221063, now seen corresponding path program 1 times [2021-01-06 19:33:31,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:31,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520660667] [2021-01-06 19:33:31,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:31,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520660667] [2021-01-06 19:33:31,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718298100] [2021-01-06 19:33:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:32,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:33:32,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:33:32,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:33:32,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2021-01-06 19:33:32,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819036762] [2021-01-06 19:33:32,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:32,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:32,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:33:32,307 INFO L87 Difference]: Start difference. First operand 2718 states and 3545 transitions. Second operand 6 states. [2021-01-06 19:33:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:33,549 INFO L93 Difference]: Finished difference Result 7282 states and 9888 transitions. [2021-01-06 19:33:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:33,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2021-01-06 19:33:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:33,559 INFO L225 Difference]: With dead ends: 7282 [2021-01-06 19:33:33,560 INFO L226 Difference]: Without dead ends: 4791 [2021-01-06 19:33:33,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:33:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4791 states. [2021-01-06 19:33:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4791 to 2375. [2021-01-06 19:33:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2021-01-06 19:33:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3104 transitions. [2021-01-06 19:33:34,047 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3104 transitions. Word has length 139 [2021-01-06 19:33:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:34,047 INFO L481 AbstractCegarLoop]: Abstraction has 2375 states and 3104 transitions. [2021-01-06 19:33:34,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3104 transitions. [2021-01-06 19:33:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 19:33:34,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:34,055 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] [2021-01-06 19:33:34,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:34,271 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -954398025, now seen corresponding path program 1 times [2021-01-06 19:33:34,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:34,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998639057] [2021-01-06 19:33:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-01-06 19:33:34,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998639057] [2021-01-06 19:33:34,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:34,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:33:34,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920822773] [2021-01-06 19:33:34,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:33:34,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:34,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:33:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:33:34,453 INFO L87 Difference]: Start difference. First operand 2375 states and 3104 transitions. Second operand 7 states. [2021-01-06 19:33:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:37,057 INFO L93 Difference]: Finished difference Result 14087 states and 18950 transitions. [2021-01-06 19:33:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:33:37,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2021-01-06 19:33:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:37,077 INFO L225 Difference]: With dead ends: 14087 [2021-01-06 19:33:37,077 INFO L226 Difference]: Without dead ends: 11979 [2021-01-06 19:33:37,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:33:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11979 states. [2021-01-06 19:33:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11979 to 2831. [2021-01-06 19:33:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2021-01-06 19:33:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3634 transitions. [2021-01-06 19:33:37,751 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3634 transitions. Word has length 140 [2021-01-06 19:33:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:37,752 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 3634 transitions. [2021-01-06 19:33:37,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:33:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3634 transitions. [2021-01-06 19:33:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 19:33:37,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:37,759 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] [2021-01-06 19:33:37,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:33:37,759 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -186871780, now seen corresponding path program 1 times [2021-01-06 19:33:37,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:37,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364307118] [2021-01-06 19:33:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:37,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364307118] [2021-01-06 19:33:37,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448199003] [2021-01-06 19:33:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:38,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:33:38,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 19:33:38,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:38,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2021-01-06 19:33:38,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558466840] [2021-01-06 19:33:38,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:33:38,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:33:38,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:38,262 INFO L87 Difference]: Start difference. First operand 2831 states and 3634 transitions. Second operand 11 states. [2021-01-06 19:33:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:40,547 INFO L93 Difference]: Finished difference Result 8074 states and 10544 transitions. [2021-01-06 19:33:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-06 19:33:40,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2021-01-06 19:33:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:40,560 INFO L225 Difference]: With dead ends: 8074 [2021-01-06 19:33:40,561 INFO L226 Difference]: Without dead ends: 5307 [2021-01-06 19:33:40,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2021-01-06 19:33:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2021-01-06 19:33:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 2352. [2021-01-06 19:33:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2021-01-06 19:33:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3021 transitions. [2021-01-06 19:33:41,184 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3021 transitions. Word has length 142 [2021-01-06 19:33:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:41,184 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 3021 transitions. [2021-01-06 19:33:41,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:33:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3021 transitions. [2021-01-06 19:33:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 19:33:41,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:41,191 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:41,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:41,406 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1061111299, now seen corresponding path program 1 times [2021-01-06 19:33:41,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:41,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649014989] [2021-01-06 19:33:41,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:41,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649014989] [2021-01-06 19:33:41,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537126683] [2021-01-06 19:33:41,642 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 [2021-01-06 19:33:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:41,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 19:33:41,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:41,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:33:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:42,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:42,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-01-06 19:33:42,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228987671] [2021-01-06 19:33:42,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:33:42,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:33:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:42,168 INFO L87 Difference]: Start difference. First operand 2352 states and 3021 transitions. Second operand 18 states. [2021-01-06 19:33:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:44,498 INFO L93 Difference]: Finished difference Result 6478 states and 8354 transitions. [2021-01-06 19:33:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 19:33:44,501 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2021-01-06 19:33:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:44,509 INFO L225 Difference]: With dead ends: 6478 [2021-01-06 19:33:44,509 INFO L226 Difference]: Without dead ends: 4341 [2021-01-06 19:33:44,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 19:33:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2021-01-06 19:33:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 2609. [2021-01-06 19:33:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2021-01-06 19:33:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3344 transitions. [2021-01-06 19:33:44,944 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3344 transitions. Word has length 142 [2021-01-06 19:33:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:44,945 INFO L481 AbstractCegarLoop]: Abstraction has 2609 states and 3344 transitions. [2021-01-06 19:33:44,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:33:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3344 transitions. [2021-01-06 19:33:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-01-06 19:33:44,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:44,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:45,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 19:33:45,165 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2099695873, now seen corresponding path program 1 times [2021-01-06 19:33:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:45,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820063142] [2021-01-06 19:33:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 19:33:45,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820063142] [2021-01-06 19:33:45,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:45,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:45,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493658014] [2021-01-06 19:33:45,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:45,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:45,281 INFO L87 Difference]: Start difference. First operand 2609 states and 3344 transitions. Second operand 5 states. [2021-01-06 19:33:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:45,833 INFO L93 Difference]: Finished difference Result 4924 states and 6359 transitions. [2021-01-06 19:33:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:45,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2021-01-06 19:33:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:45,838 INFO L225 Difference]: With dead ends: 4924 [2021-01-06 19:33:45,838 INFO L226 Difference]: Without dead ends: 2469 [2021-01-06 19:33:45,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2021-01-06 19:33:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2469. [2021-01-06 19:33:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2021-01-06 19:33:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3167 transitions. [2021-01-06 19:33:46,235 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3167 transitions. Word has length 142 [2021-01-06 19:33:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:46,235 INFO L481 AbstractCegarLoop]: Abstraction has 2469 states and 3167 transitions. [2021-01-06 19:33:46,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3167 transitions. [2021-01-06 19:33:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:46,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:46,242 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] [2021-01-06 19:33:46,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:33:46,242 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:46,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash 716339399, now seen corresponding path program 1 times [2021-01-06 19:33:46,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:46,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025187509] [2021-01-06 19:33:46,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:46,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025187509] [2021-01-06 19:33:46,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627446769] [2021-01-06 19:33:46,484 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 [2021-01-06 19:33:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:46,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-06 19:33:46,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:46,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:33:46,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:33:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:47,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:47,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-01-06 19:33:47,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458044987] [2021-01-06 19:33:47,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:33:47,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:47,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:33:47,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:47,094 INFO L87 Difference]: Start difference. First operand 2469 states and 3167 transitions. Second operand 18 states. [2021-01-06 19:33:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:49,971 INFO L93 Difference]: Finished difference Result 6760 states and 8694 transitions. [2021-01-06 19:33:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 19:33:49,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 143 [2021-01-06 19:33:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:49,979 INFO L225 Difference]: With dead ends: 6760 [2021-01-06 19:33:49,979 INFO L226 Difference]: Without dead ends: 4506 [2021-01-06 19:33:49,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=401, Invalid=1579, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 19:33:49,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2021-01-06 19:33:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 2751. [2021-01-06 19:33:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2751 states. [2021-01-06 19:33:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3520 transitions. [2021-01-06 19:33:50,893 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3520 transitions. Word has length 143 [2021-01-06 19:33:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:50,894 INFO L481 AbstractCegarLoop]: Abstraction has 2751 states and 3520 transitions. [2021-01-06 19:33:50,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:33:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3520 transitions. [2021-01-06 19:33:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:50,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:50,900 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] [2021-01-06 19:33:51,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:51,115 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1256825979, now seen corresponding path program 1 times [2021-01-06 19:33:51,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:51,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322451070] [2021-01-06 19:33:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 19:33:51,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322451070] [2021-01-06 19:33:51,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:51,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:51,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392333450] [2021-01-06 19:33:51,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:51,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:51,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:51,190 INFO L87 Difference]: Start difference. First operand 2751 states and 3520 transitions. Second operand 4 states. [2021-01-06 19:33:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:51,809 INFO L93 Difference]: Finished difference Result 5134 states and 6612 transitions. [2021-01-06 19:33:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:51,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2021-01-06 19:33:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:51,812 INFO L225 Difference]: With dead ends: 5134 [2021-01-06 19:33:51,812 INFO L226 Difference]: Without dead ends: 2539 [2021-01-06 19:33:51,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2021-01-06 19:33:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2527. [2021-01-06 19:33:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2021-01-06 19:33:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3221 transitions. [2021-01-06 19:33:52,185 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3221 transitions. Word has length 143 [2021-01-06 19:33:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:52,186 INFO L481 AbstractCegarLoop]: Abstraction has 2527 states and 3221 transitions. [2021-01-06 19:33:52,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3221 transitions. [2021-01-06 19:33:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:52,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:52,190 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] [2021-01-06 19:33:52,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:33:52,191 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]=== [2021-01-06 19:33:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2112638184, now seen corresponding path program 1 times [2021-01-06 19:33:52,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:52,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981413023] [2021-01-06 19:33:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:52,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981413023] [2021-01-06 19:33:52,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:52,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:33:52,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156734460] [2021-01-06 19:33:52,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:33:52,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:33:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:33:52,389 INFO L87 Difference]: Start difference. First operand 2527 states and 3221 transitions. Second operand 10 states. [2021-01-06 19:33:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:53,792 INFO L93 Difference]: Finished difference Result 6648 states and 8546 transitions. [2021-01-06 19:33:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:33:53,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2021-01-06 19:33:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:53,797 INFO L225 Difference]: With dead ends: 6648 [2021-01-06 19:33:53,797 INFO L226 Difference]: Without dead ends: 4336 [2021-01-06 19:33:53,799 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 [2021-01-06 19:33:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2021-01-06 19:33:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 2861. [2021-01-06 19:33:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2861 states. [2021-01-06 19:33:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3643 transitions. [2021-01-06 19:33:54,459 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3643 transitions. Word has length 143 [2021-01-06 19:33:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:54,460 INFO L481 AbstractCegarLoop]: Abstraction has 2861 states and 3643 transitions. [2021-01-06 19:33:54,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:33:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3643 transitions. [2021-01-06 19:33:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:54,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:54,465 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] [2021-01-06 19:33:54,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:33:54,465 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]=== [2021-01-06 19:33:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash 270162470, now seen corresponding path program 1 times [2021-01-06 19:33:54,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:54,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189409485] [2021-01-06 19:33:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-01-06 19:33:54,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189409485] [2021-01-06 19:33:54,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:54,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:54,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938132326] [2021-01-06 19:33:54,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:54,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:54,580 INFO L87 Difference]: Start difference. First operand 2861 states and 3643 transitions. Second operand 5 states. [2021-01-06 19:33:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:55,095 INFO L93 Difference]: Finished difference Result 5348 states and 6849 transitions. [2021-01-06 19:33:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:55,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2021-01-06 19:33:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:55,098 INFO L225 Difference]: With dead ends: 5348 [2021-01-06 19:33:55,098 INFO L226 Difference]: Without dead ends: 2644 [2021-01-06 19:33:55,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2021-01-06 19:33:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2021-01-06 19:33:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2021-01-06 19:33:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3370 transitions. [2021-01-06 19:33:55,465 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3370 transitions. Word has length 143 [2021-01-06 19:33:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:55,465 INFO L481 AbstractCegarLoop]: Abstraction has 2644 states and 3370 transitions. [2021-01-06 19:33:55,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3370 transitions. [2021-01-06 19:33:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:55,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:55,469 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] [2021-01-06 19:33:55,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 19:33:55,470 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]=== [2021-01-06 19:33:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash -954015038, now seen corresponding path program 1 times [2021-01-06 19:33:55,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:55,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285573266] [2021-01-06 19:33:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:55,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285573266] [2021-01-06 19:33:55,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959292158] [2021-01-06 19:33:55,740 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 [2021-01-06 19:33:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:55,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:33:55,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:55,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 19:33:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:56,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:56,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-01-06 19:33:56,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143671945] [2021-01-06 19:33:56,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:33:56,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:33:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:33:56,200 INFO L87 Difference]: Start difference. First operand 2644 states and 3370 transitions. Second operand 10 states. [2021-01-06 19:33:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:57,595 INFO L93 Difference]: Finished difference Result 7302 states and 9316 transitions. [2021-01-06 19:33:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:33:57,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2021-01-06 19:33:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:57,600 INFO L225 Difference]: With dead ends: 7302 [2021-01-06 19:33:57,600 INFO L226 Difference]: Without dead ends: 4873 [2021-01-06 19:33:57,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2021-01-06 19:33:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 2655. [2021-01-06 19:33:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2021-01-06 19:33:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3381 transitions. [2021-01-06 19:33:58,034 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3381 transitions. Word has length 144 [2021-01-06 19:33:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:58,034 INFO L481 AbstractCegarLoop]: Abstraction has 2655 states and 3381 transitions. [2021-01-06 19:33:58,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:33:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3381 transitions. [2021-01-06 19:33:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:58,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:58,038 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] [2021-01-06 19:33:58,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:58,240 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]=== [2021-01-06 19:33:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash 537259920, now seen corresponding path program 1 times [2021-01-06 19:33:58,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:58,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215118061] [2021-01-06 19:33:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:58,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215118061] [2021-01-06 19:33:58,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425137427] [2021-01-06 19:33:58,434 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 [2021-01-06 19:33:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:58,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:33:58,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:33:58,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:33:58,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2021-01-06 19:33:58,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772259919] [2021-01-06 19:33:58,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:58,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:33:58,778 INFO L87 Difference]: Start difference. First operand 2655 states and 3381 transitions. Second operand 6 states. [2021-01-06 19:34:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:00,012 INFO L93 Difference]: Finished difference Result 8673 states and 11324 transitions. [2021-01-06 19:34:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:34:00,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2021-01-06 19:34:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:00,019 INFO L225 Difference]: With dead ends: 8673 [2021-01-06 19:34:00,019 INFO L226 Difference]: Without dead ends: 6193 [2021-01-06 19:34:00,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:34:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6193 states. [2021-01-06 19:34:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6193 to 2655. [2021-01-06 19:34:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2021-01-06 19:34:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3379 transitions. [2021-01-06 19:34:00,472 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3379 transitions. Word has length 144 [2021-01-06 19:34:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:00,472 INFO L481 AbstractCegarLoop]: Abstraction has 2655 states and 3379 transitions. [2021-01-06 19:34:00,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:34:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3379 transitions. [2021-01-06 19:34:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 19:34:00,475 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:00,475 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] [2021-01-06 19:34:00,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-01-06 19:34:00,677 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]=== [2021-01-06 19:34:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1592761434, now seen corresponding path program 1 times [2021-01-06 19:34:00,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:00,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341783751] [2021-01-06 19:34:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:00,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341783751] [2021-01-06 19:34:00,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369464185] [2021-01-06 19:34:00,834 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 [2021-01-06 19:34:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:01,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:34:01,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:01,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:01,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2021-01-06 19:34:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580722930] [2021-01-06 19:34:01,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:34:01,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:34:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:34:01,244 INFO L87 Difference]: Start difference. First operand 2655 states and 3379 transitions. Second operand 8 states. [2021-01-06 19:34:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:02,786 INFO L93 Difference]: Finished difference Result 10109 states and 12910 transitions. [2021-01-06 19:34:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 19:34:02,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2021-01-06 19:34:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:02,798 INFO L225 Difference]: With dead ends: 10109 [2021-01-06 19:34:02,798 INFO L226 Difference]: Without dead ends: 7669 [2021-01-06 19:34:02,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-01-06 19:34:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7669 states. [2021-01-06 19:34:03,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7669 to 4019. [2021-01-06 19:34:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4019 states. [2021-01-06 19:34:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5125 transitions. [2021-01-06 19:34:03,549 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5125 transitions. Word has length 145 [2021-01-06 19:34:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:03,549 INFO L481 AbstractCegarLoop]: Abstraction has 4019 states and 5125 transitions. [2021-01-06 19:34:03,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:34:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5125 transitions. [2021-01-06 19:34:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 19:34:03,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:03,555 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] [2021-01-06 19:34:03,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:03,763 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]=== [2021-01-06 19:34:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash 729040484, now seen corresponding path program 1 times [2021-01-06 19:34:03,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:03,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109490300] [2021-01-06 19:34:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:34:03,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109490300] [2021-01-06 19:34:03,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:34:03,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491611174] [2021-01-06 19:34:03,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:34:03,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:34:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:03,853 INFO L87 Difference]: Start difference. First operand 4019 states and 5125 transitions. Second operand 4 states. [2021-01-06 19:34:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:04,479 INFO L93 Difference]: Finished difference Result 7017 states and 9028 transitions. [2021-01-06 19:34:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:34:04,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2021-01-06 19:34:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:04,484 INFO L225 Difference]: With dead ends: 7017 [2021-01-06 19:34:04,484 INFO L226 Difference]: Without dead ends: 3213 [2021-01-06 19:34:04,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-01-06 19:34:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3194. [2021-01-06 19:34:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2021-01-06 19:34:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4071 transitions. [2021-01-06 19:34:05,032 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4071 transitions. Word has length 145 [2021-01-06 19:34:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:05,033 INFO L481 AbstractCegarLoop]: Abstraction has 3194 states and 4071 transitions. [2021-01-06 19:34:05,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:34:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4071 transitions. [2021-01-06 19:34:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:34:05,036 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:05,036 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] [2021-01-06 19:34:05,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 19:34:05,036 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]=== [2021-01-06 19:34:05,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:05,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1178275366, now seen corresponding path program 1 times [2021-01-06 19:34:05,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:05,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289388775] [2021-01-06 19:34:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:05,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289388775] [2021-01-06 19:34:05,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269913372] [2021-01-06 19:34:05,224 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 [2021-01-06 19:34:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:05,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:34:05,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:05,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:05,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2021-01-06 19:34:05,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312799907] [2021-01-06 19:34:05,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 19:34:05,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:05,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 19:34:05,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:34:05,604 INFO L87 Difference]: Start difference. First operand 3194 states and 4071 transitions. Second operand 15 states. [2021-01-06 19:34:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:16,437 INFO L93 Difference]: Finished difference Result 18919 states and 24493 transitions. [2021-01-06 19:34:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2021-01-06 19:34:16,438 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2021-01-06 19:34:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:16,456 INFO L225 Difference]: With dead ends: 18919 [2021-01-06 19:34:16,456 INFO L226 Difference]: Without dead ends: 15940 [2021-01-06 19:34:16,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12818 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4607, Invalid=26899, Unknown=0, NotChecked=0, Total=31506 [2021-01-06 19:34:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2021-01-06 19:34:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 3073. [2021-01-06 19:34:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2021-01-06 19:34:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3862 transitions. [2021-01-06 19:34:17,178 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3862 transitions. Word has length 147 [2021-01-06 19:34:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:17,179 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3862 transitions. [2021-01-06 19:34:17,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 19:34:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3862 transitions. [2021-01-06 19:34:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:34:17,182 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:17,182 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] [2021-01-06 19:34:17,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:17,383 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]=== [2021-01-06 19:34:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash -572580853, now seen corresponding path program 1 times [2021-01-06 19:34:17,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:17,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045854990] [2021-01-06 19:34:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:34:17,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045854990] [2021-01-06 19:34:17,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:17,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:34:17,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167434672] [2021-01-06 19:34:17,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:34:17,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:17,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:34:17,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:34:17,561 INFO L87 Difference]: Start difference. First operand 3073 states and 3862 transitions. Second operand 6 states. [2021-01-06 19:34:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:19,813 INFO L93 Difference]: Finished difference Result 10397 states and 13397 transitions. [2021-01-06 19:34:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:34:19,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2021-01-06 19:34:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:19,821 INFO L225 Difference]: With dead ends: 10397 [2021-01-06 19:34:19,821 INFO L226 Difference]: Without dead ends: 7607 [2021-01-06 19:34:19,824 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 [2021-01-06 19:34:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7607 states. [2021-01-06 19:34:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7607 to 3154. [2021-01-06 19:34:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3154 states. [2021-01-06 19:34:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 3958 transitions. [2021-01-06 19:34:20,432 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 3958 transitions. Word has length 149 [2021-01-06 19:34:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:20,432 INFO L481 AbstractCegarLoop]: Abstraction has 3154 states and 3958 transitions. [2021-01-06 19:34:20,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:34:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 3958 transitions. [2021-01-06 19:34:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 19:34:20,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:20,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:34:20,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 19:34:20,436 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]=== [2021-01-06 19:34:20,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1890543379, now seen corresponding path program 1 times [2021-01-06 19:34:20,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:20,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002282222] [2021-01-06 19:34:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:20,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002282222] [2021-01-06 19:34:20,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795700584] [2021-01-06 19:34:20,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:20,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:34:20,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:21,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:21,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-01-06 19:34:21,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692686385] [2021-01-06 19:34:21,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:34:21,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:21,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:34:21,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:34:21,029 INFO L87 Difference]: Start difference. First operand 3154 states and 3958 transitions. Second operand 8 states. [2021-01-06 19:34:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:22,956 INFO L93 Difference]: Finished difference Result 9271 states and 11906 transitions. [2021-01-06 19:34:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:34:22,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2021-01-06 19:34:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:22,963 INFO L225 Difference]: With dead ends: 9271 [2021-01-06 19:34:22,964 INFO L226 Difference]: Without dead ends: 6400 [2021-01-06 19:34:22,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:34:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6400 states. [2021-01-06 19:34:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6400 to 3154. [2021-01-06 19:34:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3154 states. [2021-01-06 19:34:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 3930 transitions. [2021-01-06 19:34:23,623 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 3930 transitions. Word has length 150 [2021-01-06 19:34:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:23,624 INFO L481 AbstractCegarLoop]: Abstraction has 3154 states and 3930 transitions. [2021-01-06 19:34:23,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:34:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 3930 transitions. [2021-01-06 19:34:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 19:34:23,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:23,627 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, 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] [2021-01-06 19:34:23,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-01-06 19:34:23,829 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1119716085, now seen corresponding path program 1 times [2021-01-06 19:34:23,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:23,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435871852] [2021-01-06 19:34:23,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-01-06 19:34:23,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435871852] [2021-01-06 19:34:23,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:23,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:34:23,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400519009] [2021-01-06 19:34:23,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:34:23,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:34:23,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:34:23,946 INFO L87 Difference]: Start difference. First operand 3154 states and 3930 transitions. Second operand 6 states. [2021-01-06 19:34:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:27,003 INFO L93 Difference]: Finished difference Result 14589 states and 18698 transitions. [2021-01-06 19:34:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:34:27,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2021-01-06 19:34:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:27,014 INFO L225 Difference]: With dead ends: 14589 [2021-01-06 19:34:27,014 INFO L226 Difference]: Without dead ends: 11718 [2021-01-06 19:34:27,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:34:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11718 states. [2021-01-06 19:34:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11718 to 3623. [2021-01-06 19:34:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2021-01-06 19:34:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4465 transitions. [2021-01-06 19:34:27,760 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4465 transitions. Word has length 150 [2021-01-06 19:34:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:27,760 INFO L481 AbstractCegarLoop]: Abstraction has 3623 states and 4465 transitions. [2021-01-06 19:34:27,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:34:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4465 transitions. [2021-01-06 19:34:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:34:27,763 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:27,764 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] [2021-01-06 19:34:27,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 19:34:27,764 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1081689347, now seen corresponding path program 1 times [2021-01-06 19:34:27,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:27,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498348620] [2021-01-06 19:34:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:34:27,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498348620] [2021-01-06 19:34:27,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:27,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:34:27,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100515986] [2021-01-06 19:34:27,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:34:27,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:34:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:27,853 INFO L87 Difference]: Start difference. First operand 3623 states and 4465 transitions. Second operand 4 states. [2021-01-06 19:34:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:29,068 INFO L93 Difference]: Finished difference Result 8779 states and 10961 transitions. [2021-01-06 19:34:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:34:29,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 19:34:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:29,074 INFO L225 Difference]: With dead ends: 8779 [2021-01-06 19:34:29,075 INFO L226 Difference]: Without dead ends: 5439 [2021-01-06 19:34:29,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:34:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2021-01-06 19:34:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 4327. [2021-01-06 19:34:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2021-01-06 19:34:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5322 transitions. [2021-01-06 19:34:29,913 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5322 transitions. Word has length 151 [2021-01-06 19:34:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:29,914 INFO L481 AbstractCegarLoop]: Abstraction has 4327 states and 5322 transitions. [2021-01-06 19:34:29,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:34:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5322 transitions. [2021-01-06 19:34:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:34:29,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:29,918 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:34:29,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 19:34:29,918 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash -562521166, now seen corresponding path program 1 times [2021-01-06 19:34:29,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:29,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194859795] [2021-01-06 19:34:29,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:30,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194859795] [2021-01-06 19:34:30,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225292744] [2021-01-06 19:34:30,057 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:30,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:34:30,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:30,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:30,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-01-06 19:34:30,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652964507] [2021-01-06 19:34:30,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:34:30,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:34:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:34:30,482 INFO L87 Difference]: Start difference. First operand 4327 states and 5322 transitions. Second operand 7 states. [2021-01-06 19:34:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:32,981 INFO L93 Difference]: Finished difference Result 15123 states and 19140 transitions. [2021-01-06 19:34:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:34:32,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2021-01-06 19:34:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:33,001 INFO L225 Difference]: With dead ends: 15123 [2021-01-06 19:34:33,002 INFO L226 Difference]: Without dead ends: 11079 [2021-01-06 19:34:33,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:34:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11079 states. [2021-01-06 19:34:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11079 to 6803. [2021-01-06 19:34:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6803 states. [2021-01-06 19:34:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6803 states to 6803 states and 8395 transitions. [2021-01-06 19:34:34,461 INFO L78 Accepts]: Start accepts. Automaton has 6803 states and 8395 transitions. Word has length 151 [2021-01-06 19:34:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:34,461 INFO L481 AbstractCegarLoop]: Abstraction has 6803 states and 8395 transitions. [2021-01-06 19:34:34,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:34:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6803 states and 8395 transitions. [2021-01-06 19:34:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:34:34,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:34,465 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, 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] [2021-01-06 19:34:34,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-01-06 19:34:34,673 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash 397250477, now seen corresponding path program 1 times [2021-01-06 19:34:34,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:34,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702359969] [2021-01-06 19:34:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 26 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:34,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702359969] [2021-01-06 19:34:34,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039477937] [2021-01-06 19:34:34,872 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:35,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-06 19:34:35,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 35 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:35,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:35,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-01-06 19:34:35,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794233671] [2021-01-06 19:34:35,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 19:34:35,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 19:34:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:34:35,302 INFO L87 Difference]: Start difference. First operand 6803 states and 8395 transitions. Second operand 14 states. [2021-01-06 19:34:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:55,101 INFO L93 Difference]: Finished difference Result 35819 states and 45119 transitions. [2021-01-06 19:34:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2021-01-06 19:34:55,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 151 [2021-01-06 19:34:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:55,135 INFO L225 Difference]: With dead ends: 35819 [2021-01-06 19:34:55,136 INFO L226 Difference]: Without dead ends: 30457 [2021-01-06 19:34:55,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49817 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12787, Invalid=92513, Unknown=0, NotChecked=0, Total=105300 [2021-01-06 19:34:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30457 states. [2021-01-06 19:34:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30457 to 10379. [2021-01-06 19:34:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10379 states. [2021-01-06 19:34:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 12818 transitions. [2021-01-06 19:34:57,790 INFO L78 Accepts]: Start accepts. Automaton has 10379 states and 12818 transitions. Word has length 151 [2021-01-06 19:34:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:57,791 INFO L481 AbstractCegarLoop]: Abstraction has 10379 states and 12818 transitions. [2021-01-06 19:34:57,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 19:34:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 12818 transitions. [2021-01-06 19:34:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 19:34:57,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:57,797 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, 1] [2021-01-06 19:34:57,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-01-06 19:34:57,999 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:57,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1443672678, now seen corresponding path program 1 times [2021-01-06 19:34:58,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:58,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640280290] [2021-01-06 19:34:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:58,279 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 21 [2021-01-06 19:34:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:58,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640280290] [2021-01-06 19:34:58,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964310051] [2021-01-06 19:34:58,338 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:58,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:34:58,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:58,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:34:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:58,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:58,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-01-06 19:34:58,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895882831] [2021-01-06 19:34:58,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:34:58,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:34:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:34:58,936 INFO L87 Difference]: Start difference. First operand 10379 states and 12818 transitions. Second operand 11 states. [2021-01-06 19:35:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:02,715 INFO L93 Difference]: Finished difference Result 20022 states and 25023 transitions. [2021-01-06 19:35:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:35:02,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2021-01-06 19:35:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:02,736 INFO L225 Difference]: With dead ends: 20022 [2021-01-06 19:35:02,737 INFO L226 Difference]: Without dead ends: 12749 [2021-01-06 19:35:02,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:35:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2021-01-06 19:35:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 10140. [2021-01-06 19:35:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10140 states. [2021-01-06 19:35:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10140 states to 10140 states and 12504 transitions. [2021-01-06 19:35:05,549 INFO L78 Accepts]: Start accepts. Automaton has 10140 states and 12504 transitions. Word has length 152 [2021-01-06 19:35:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:05,550 INFO L481 AbstractCegarLoop]: Abstraction has 10140 states and 12504 transitions. [2021-01-06 19:35:05,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:35:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 10140 states and 12504 transitions. [2021-01-06 19:35:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 19:35:05,562 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:05,562 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, 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] [2021-01-06 19:35:05,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:05,774 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1461701721, now seen corresponding path program 1 times [2021-01-06 19:35:05,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:05,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227445835] [2021-01-06 19:35:05,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-06 19:35:05,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227445835] [2021-01-06 19:35:05,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:05,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:05,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214392846] [2021-01-06 19:35:05,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:05,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:05,839 INFO L87 Difference]: Start difference. First operand 10140 states and 12504 transitions. Second operand 4 states. [2021-01-06 19:35:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:07,747 INFO L93 Difference]: Finished difference Result 16181 states and 19958 transitions. [2021-01-06 19:35:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:07,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 19:35:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:07,754 INFO L225 Difference]: With dead ends: 16181 [2021-01-06 19:35:07,755 INFO L226 Difference]: Without dead ends: 6640 [2021-01-06 19:35:07,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2021-01-06 19:35:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6620. [2021-01-06 19:35:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2021-01-06 19:35:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8094 transitions. [2021-01-06 19:35:09,281 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8094 transitions. Word has length 153 [2021-01-06 19:35:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:09,282 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8094 transitions. [2021-01-06 19:35:09,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8094 transitions. [2021-01-06 19:35:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:35:09,285 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:09,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:09,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 19:35:09,286 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:09,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:09,286 INFO L82 PathProgramCache]: Analyzing trace with hash -348202584, now seen corresponding path program 1 times [2021-01-06 19:35:09,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:09,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830367599] [2021-01-06 19:35:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:09,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830367599] [2021-01-06 19:35:09,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483019066] [2021-01-06 19:35:09,520 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:09,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:35:09,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:10,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:35:10,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-01-06 19:35:10,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467739724] [2021-01-06 19:35:10,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:35:10,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:10,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:35:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:35:10,086 INFO L87 Difference]: Start difference. First operand 6620 states and 8094 transitions. Second operand 13 states. [2021-01-06 19:35:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:25,746 INFO L93 Difference]: Finished difference Result 39008 states and 49329 transitions. [2021-01-06 19:35:25,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2021-01-06 19:35:25,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2021-01-06 19:35:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:25,785 INFO L225 Difference]: With dead ends: 39008 [2021-01-06 19:35:25,786 INFO L226 Difference]: Without dead ends: 33973 [2021-01-06 19:35:25,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7816 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2820, Invalid=16640, Unknown=0, NotChecked=0, Total=19460 [2021-01-06 19:35:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33973 states. [2021-01-06 19:35:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33973 to 7990. [2021-01-06 19:35:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2021-01-06 19:35:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 9776 transitions. [2021-01-06 19:35:28,241 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 9776 transitions. Word has length 154 [2021-01-06 19:35:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:28,242 INFO L481 AbstractCegarLoop]: Abstraction has 7990 states and 9776 transitions. [2021-01-06 19:35:28,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:35:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 9776 transitions. [2021-01-06 19:35:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:35:28,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:28,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:28,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-01-06 19:35:28,445 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1265114848, now seen corresponding path program 1 times [2021-01-06 19:35:28,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:28,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377559006] [2021-01-06 19:35:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:28,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377559006] [2021-01-06 19:35:28,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732990820] [2021-01-06 19:35:28,723 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:28,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:35:28,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:29,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:35:29,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2021-01-06 19:35:29,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349688813] [2021-01-06 19:35:29,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 19:35:29,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 19:35:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:35:29,178 INFO L87 Difference]: Start difference. First operand 7990 states and 9776 transitions. Second operand 16 states. [2021-01-06 19:35:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:56,315 INFO L93 Difference]: Finished difference Result 33265 states and 41653 transitions. [2021-01-06 19:35:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2021-01-06 19:35:56,316 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2021-01-06 19:35:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:56,349 INFO L225 Difference]: With dead ends: 33265 [2021-01-06 19:35:56,350 INFO L226 Difference]: Without dead ends: 27154 [2021-01-06 19:35:56,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19727 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=6585, Invalid=42035, Unknown=0, NotChecked=0, Total=48620 [2021-01-06 19:35:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27154 states. [2021-01-06 19:35:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27154 to 7954. [2021-01-06 19:35:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7954 states. [2021-01-06 19:35:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 9686 transitions. [2021-01-06 19:35:58,976 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 9686 transitions. Word has length 154 [2021-01-06 19:35:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:58,976 INFO L481 AbstractCegarLoop]: Abstraction has 7954 states and 9686 transitions. [2021-01-06 19:35:58,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 19:35:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 9686 transitions. [2021-01-06 19:35:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:35:58,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:58,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:59,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:59,193 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1007469032, now seen corresponding path program 1 times [2021-01-06 19:35:59,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:59,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164304732] [2021-01-06 19:35:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:59,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164304732] [2021-01-06 19:35:59,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638117834] [2021-01-06 19:35:59,484 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:59,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:35:59,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:59,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:35:59,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-01-06 19:35:59,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520046172] [2021-01-06 19:35:59,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:35:59,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:35:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:35:59,988 INFO L87 Difference]: Start difference. First operand 7954 states and 9686 transitions. Second operand 8 states. [2021-01-06 19:36:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:07,119 INFO L93 Difference]: Finished difference Result 24144 states and 30333 transitions. [2021-01-06 19:36:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:36:07,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2021-01-06 19:36:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:07,138 INFO L225 Difference]: With dead ends: 24144 [2021-01-06 19:36:07,138 INFO L226 Difference]: Without dead ends: 18506 [2021-01-06 19:36:07,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:36:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18506 states. [2021-01-06 19:36:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18506 to 7278. [2021-01-06 19:36:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7278 states. [2021-01-06 19:36:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 8852 transitions. [2021-01-06 19:36:09,326 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 8852 transitions. Word has length 155 [2021-01-06 19:36:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:09,327 INFO L481 AbstractCegarLoop]: Abstraction has 7278 states and 8852 transitions. [2021-01-06 19:36:09,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:36:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 8852 transitions. [2021-01-06 19:36:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:36:09,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:09,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:09,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-01-06 19:36:09,545 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash -359733026, now seen corresponding path program 1 times [2021-01-06 19:36:09,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:09,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069286394] [2021-01-06 19:36:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-01-06 19:36:09,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069286394] [2021-01-06 19:36:09,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:09,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:09,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045123040] [2021-01-06 19:36:09,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:09,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:09,607 INFO L87 Difference]: Start difference. First operand 7278 states and 8852 transitions. Second operand 4 states. [2021-01-06 19:36:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:11,712 INFO L93 Difference]: Finished difference Result 12907 states and 15741 transitions. [2021-01-06 19:36:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:11,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 19:36:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:11,721 INFO L225 Difference]: With dead ends: 12907 [2021-01-06 19:36:11,721 INFO L226 Difference]: Without dead ends: 6040 [2021-01-06 19:36:11,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2021-01-06 19:36:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 6040. [2021-01-06 19:36:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2021-01-06 19:36:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 7332 transitions. [2021-01-06 19:36:13,630 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 7332 transitions. Word has length 155 [2021-01-06 19:36:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:13,631 INFO L481 AbstractCegarLoop]: Abstraction has 6040 states and 7332 transitions. [2021-01-06 19:36:13,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 7332 transitions. [2021-01-06 19:36:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-06 19:36:13,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:13,633 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, 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] [2021-01-06 19:36:13,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 19:36:13,634 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash 977958557, now seen corresponding path program 1 times [2021-01-06 19:36:13,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:13,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23784514] [2021-01-06 19:36:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:13,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23784514] [2021-01-06 19:36:13,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155483702] [2021-01-06 19:36:13,860 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:14,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:36:14,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:14,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:36:14,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2021-01-06 19:36:14,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241037944] [2021-01-06 19:36:14,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:36:14,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:36:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:36:14,460 INFO L87 Difference]: Start difference. First operand 6040 states and 7332 transitions. Second operand 9 states. [2021-01-06 19:36:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:17,879 INFO L93 Difference]: Finished difference Result 12041 states and 14694 transitions. [2021-01-06 19:36:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:36:17,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2021-01-06 19:36:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:17,890 INFO L225 Difference]: With dead ends: 12041 [2021-01-06 19:36:17,890 INFO L226 Difference]: Without dead ends: 6684 [2021-01-06 19:36:17,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:36:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6684 states. [2021-01-06 19:36:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6684 to 5582. [2021-01-06 19:36:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2021-01-06 19:36:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 6769 transitions. [2021-01-06 19:36:19,679 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 6769 transitions. Word has length 156 [2021-01-06 19:36:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:19,679 INFO L481 AbstractCegarLoop]: Abstraction has 5582 states and 6769 transitions. [2021-01-06 19:36:19,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:36:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 6769 transitions. [2021-01-06 19:36:19,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 19:36:19,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:19,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:19,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-01-06 19:36:19,883 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 777084987, now seen corresponding path program 1 times [2021-01-06 19:36:19,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:19,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686313649] [2021-01-06 19:36:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:36:20,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686313649] [2021-01-06 19:36:20,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:20,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:36:20,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771746699] [2021-01-06 19:36:20,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:36:20,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:20,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:36:20,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:36:20,144 INFO L87 Difference]: Start difference. First operand 5582 states and 6769 transitions. Second operand 7 states. [2021-01-06 19:36:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:23,303 INFO L93 Difference]: Finished difference Result 12515 states and 15513 transitions. [2021-01-06 19:36:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:36:23,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2021-01-06 19:36:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:23,312 INFO L225 Difference]: With dead ends: 12515 [2021-01-06 19:36:23,313 INFO L226 Difference]: Without dead ends: 8448 [2021-01-06 19:36:23,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:36:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8448 states. [2021-01-06 19:36:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8448 to 5578. [2021-01-06 19:36:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5578 states. [2021-01-06 19:36:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 6757 transitions. [2021-01-06 19:36:25,081 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 6757 transitions. Word has length 157 [2021-01-06 19:36:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:25,081 INFO L481 AbstractCegarLoop]: Abstraction has 5578 states and 6757 transitions. [2021-01-06 19:36:25,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:36:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 6757 transitions. [2021-01-06 19:36:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 19:36:25,084 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:25,084 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, 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] [2021-01-06 19:36:25,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 19:36:25,084 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 263815105, now seen corresponding path program 1 times [2021-01-06 19:36:25,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:25,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545779822] [2021-01-06 19:36:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:25,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545779822] [2021-01-06 19:36:25,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885202981] [2021-01-06 19:36:25,287 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:25,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:36:25,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:36:25,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:36:25,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-01-06 19:36:25,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439316583] [2021-01-06 19:36:25,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:36:25,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:36:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:36:25,756 INFO L87 Difference]: Start difference. First operand 5578 states and 6757 transitions. Second operand 6 states. [2021-01-06 19:36:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:30,094 INFO L93 Difference]: Finished difference Result 15882 states and 19686 transitions. [2021-01-06 19:36:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:36:30,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2021-01-06 19:36:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:30,120 INFO L225 Difference]: With dead ends: 15882 [2021-01-06 19:36:30,120 INFO L226 Difference]: Without dead ends: 11200 [2021-01-06 19:36:30,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:36:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11200 states. [2021-01-06 19:36:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11200 to 5575. [2021-01-06 19:36:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2021-01-06 19:36:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 6738 transitions. [2021-01-06 19:36:31,989 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 6738 transitions. Word has length 157 [2021-01-06 19:36:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:31,989 INFO L481 AbstractCegarLoop]: Abstraction has 5575 states and 6738 transitions. [2021-01-06 19:36:31,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:36:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 6738 transitions. [2021-01-06 19:36:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 19:36:31,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:31,992 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, 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] [2021-01-06 19:36:32,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-01-06 19:36:32,196 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:32,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1573864336, now seen corresponding path program 1 times [2021-01-06 19:36:32,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:32,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927889894] [2021-01-06 19:36:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 19:36:32,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927889894] [2021-01-06 19:36:32,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448248065] [2021-01-06 19:36:32,429 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:32,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 19:36:32,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:33,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:36:33,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 18 [2021-01-06 19:36:33,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118392782] [2021-01-06 19:36:33,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:36:33,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:36:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:36:33,258 INFO L87 Difference]: Start difference. First operand 5575 states and 6738 transitions. Second operand 18 states. [2021-01-06 19:36:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:39,026 INFO L93 Difference]: Finished difference Result 16266 states and 20045 transitions. [2021-01-06 19:36:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-01-06 19:36:39,028 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2021-01-06 19:36:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:39,041 INFO L225 Difference]: With dead ends: 16266 [2021-01-06 19:36:39,041 INFO L226 Difference]: Without dead ends: 12188 [2021-01-06 19:36:39,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=2339, Unknown=0, NotChecked=0, Total=2862 [2021-01-06 19:36:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12188 states. [2021-01-06 19:36:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12188 to 7230. [2021-01-06 19:36:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2021-01-06 19:36:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 8716 transitions. [2021-01-06 19:36:41,246 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 8716 transitions. Word has length 158 [2021-01-06 19:36:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,247 INFO L481 AbstractCegarLoop]: Abstraction has 7230 states and 8716 transitions. [2021-01-06 19:36:41,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:36:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 8716 transitions. [2021-01-06 19:36:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 19:36:41,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,252 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, 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] [2021-01-06 19:36:41,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2021-01-06 19:36:41,468 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1989518144, now seen corresponding path program 1 times [2021-01-06 19:36:41,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759285857] [2021-01-06 19:36:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,818 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 14 [2021-01-06 19:36:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759285857] [2021-01-06 19:36:41,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785564748] [2021-01-06 19:36:41,887 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 19:36:42,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:42,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:36:42,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 17 [2021-01-06 19:36:42,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709639339] [2021-01-06 19:36:42,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:36:42,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:36:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:36:42,611 INFO L87 Difference]: Start difference. First operand 7230 states and 8716 transitions. Second operand 11 states. [2021-01-06 19:36:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:46,168 INFO L93 Difference]: Finished difference Result 14316 states and 17431 transitions. [2021-01-06 19:36:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 19:36:46,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2021-01-06 19:36:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:46,179 INFO L225 Difference]: With dead ends: 14316 [2021-01-06 19:36:46,179 INFO L226 Difference]: Without dead ends: 8896 [2021-01-06 19:36:46,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2021-01-06 19:36:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2021-01-06 19:36:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 7233. [2021-01-06 19:36:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7233 states. [2021-01-06 19:36:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 8714 transitions. [2021-01-06 19:36:48,350 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 8714 transitions. Word has length 161 [2021-01-06 19:36:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:48,351 INFO L481 AbstractCegarLoop]: Abstraction has 7233 states and 8714 transitions. [2021-01-06 19:36:48,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:36:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 8714 transitions. [2021-01-06 19:36:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 19:36:48,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:48,353 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, 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] [2021-01-06 19:36:48,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:48,554 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 602732734, now seen corresponding path program 1 times [2021-01-06 19:36:48,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:48,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525913044] [2021-01-06 19:36:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:48,801 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 14 [2021-01-06 19:36:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:48,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525913044] [2021-01-06 19:36:48,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323560846] [2021-01-06 19:36:48,880 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:36:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:49,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:36:49,100 INFO L286 TraceCheckSpWp]: Computing forward predicates...