/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.5.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:32:29,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:32:29,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:32:29,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:32:29,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:32:29,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:32:29,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:32:29,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:32:29,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:32:29,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:32:29,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:32:29,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:32:29,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:32:29,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:32:29,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:32:29,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:32:29,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:32:29,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:32:29,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:32:29,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:32:29,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:32:29,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:32:29,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:32:29,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:32:29,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:32:29,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:32:29,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:32:29,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:32:29,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:32:29,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:32:29,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:32:29,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:32:29,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:32:29,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:32:29,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:32:29,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:32:29,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:32:29,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:32:29,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:32:29,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:32:29,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:32:29,441 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:29,467 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:32:29,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:32:29,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:32:29,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:32:29,469 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:32:29,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:32:29,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:32:29,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:32:29,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:32:29,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:32:29,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:32:29,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:32:29,472 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:32:29,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:32:29,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:32:29,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:32:29,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:32:29,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:29,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:32:29,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:32:29,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:32:29,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:32:29,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:32:29,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:32:29,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:32:29,475 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:29,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:32:29,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:32:29,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:32:29,883 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:32:29,884 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:32:29,885 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.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:29,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/81349a00b/f7751278acee4f3fa6ebae1d81c6cd31/FLAG700df22d0 [2021-01-06 19:32:30,596 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:32:30,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:30,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/81349a00b/f7751278acee4f3fa6ebae1d81c6cd31/FLAG700df22d0 [2021-01-06 19:32:30,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/81349a00b/f7751278acee4f3fa6ebae1d81c6cd31 [2021-01-06 19:32:30,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:32:30,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:32:30,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:30,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:32:30,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:32:30,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:30" (1/1) ... [2021-01-06 19:32:30,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78dc06da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:30, skipping insertion in model container [2021-01-06 19:32:30,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:30" (1/1) ... [2021-01-06 19:32:30,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:32:31,013 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:31,349 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.5.ufo.BOUNDED-10.pals.c[14595,14608] [2021-01-06 19:32:31,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:31,365 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:31,489 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.5.ufo.BOUNDED-10.pals.c[14595,14608] [2021-01-06 19:32:31,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:31,537 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:32:31,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:31 WrapperNode [2021-01-06 19:32:31,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:31,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:31,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:32:31,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:32:31,553 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:31" (1/1) ... [2021-01-06 19:32:31,591 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:31" (1/1) ... [2021-01-06 19:32:31,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:31,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:32:31,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:32:31,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:32:31,728 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:31" (1/1) ... [2021-01-06 19:32:31,728 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:31" (1/1) ... [2021-01-06 19:32:31,745 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:31" (1/1) ... [2021-01-06 19:32:31,745 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:31" (1/1) ... [2021-01-06 19:32:31,787 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:31" (1/1) ... [2021-01-06 19:32:31,813 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:31" (1/1) ... [2021-01-06 19:32:31,820 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:31" (1/1) ... [2021-01-06 19:32:31,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:32:31,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:32:31,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:32:31,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:32:31,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:31" (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:31,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:32:31,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:32:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:32:31,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:32:33,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:32:33,278 INFO L299 CfgBuilder]: Removed 121 assume(true) statements. [2021-01-06 19:32:33,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:33 BoogieIcfgContainer [2021-01-06 19:32:33,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:32:33,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:32:33,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:32:33,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:32:33,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:32:30" (1/3) ... [2021-01-06 19:32:33,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aac6de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:33, skipping insertion in model container [2021-01-06 19:32:33,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:31" (2/3) ... [2021-01-06 19:32:33,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aac6de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:33, skipping insertion in model container [2021-01-06 19:32:33,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:33" (3/3) ... [2021-01-06 19:32:33,290 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2021-01-06 19:32:33,298 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:32:33,303 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2021-01-06 19:32:33,324 INFO L253 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-01-06 19:32:33,355 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:32:33,356 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:32:33,356 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:32:33,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:32:33,356 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:32:33,356 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:32:33,356 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:32:33,356 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:32:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2021-01-06 19:32:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:32:33,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:33,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:33,391 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1350186974, now seen corresponding path program 1 times [2021-01-06 19:32:33,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:33,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268847867] [2021-01-06 19:32:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:33,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268847867] [2021-01-06 19:32:33,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:33,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:33,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768311965] [2021-01-06 19:32:33,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:32:33,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:32:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:32:33,640 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 2 states. [2021-01-06 19:32:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:33,695 INFO L93 Difference]: Finished difference Result 570 states and 889 transitions. [2021-01-06 19:32:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:32:33,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2021-01-06 19:32:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:33,713 INFO L225 Difference]: With dead ends: 570 [2021-01-06 19:32:33,713 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 19:32:33,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:32:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 19:32:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-01-06 19:32:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2021-01-06 19:32:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2021-01-06 19:32:33,788 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 33 [2021-01-06 19:32:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:33,788 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2021-01-06 19:32:33,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:32:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2021-01-06 19:32:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 19:32:33,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:33,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:33,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:32:33,791 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash 346492376, now seen corresponding path program 1 times [2021-01-06 19:32:33,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:33,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707146963] [2021-01-06 19:32:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:33,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707146963] [2021-01-06 19:32:33,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:33,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:33,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437934503] [2021-01-06 19:32:33,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:33,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:33,898 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2021-01-06 19:32:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:33,978 INFO L93 Difference]: Finished difference Result 564 states and 820 transitions. [2021-01-06 19:32:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:33,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2021-01-06 19:32:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:33,986 INFO L225 Difference]: With dead ends: 564 [2021-01-06 19:32:33,986 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 19:32:33,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 19:32:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-01-06 19:32:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2021-01-06 19:32:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 411 transitions. [2021-01-06 19:32:34,032 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 411 transitions. Word has length 33 [2021-01-06 19:32:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,032 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 411 transitions. [2021-01-06 19:32:34,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 411 transitions. [2021-01-06 19:32:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 19:32:34,036 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:32:34,036 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash 792768919, now seen corresponding path program 1 times [2021-01-06 19:32:34,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190475565] [2021-01-06 19:32:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:34,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190475565] [2021-01-06 19:32:34,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:34,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491096608] [2021-01-06 19:32:34,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:34,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,273 INFO L87 Difference]: Start difference. First operand 289 states and 411 transitions. Second operand 3 states. [2021-01-06 19:32:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,357 INFO L93 Difference]: Finished difference Result 591 states and 849 transitions. [2021-01-06 19:32:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:34,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 19:32:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,364 INFO L225 Difference]: With dead ends: 591 [2021-01-06 19:32:34,365 INFO L226 Difference]: Without dead ends: 319 [2021-01-06 19:32:34,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-01-06 19:32:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 265. [2021-01-06 19:32:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2021-01-06 19:32:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 375 transitions. [2021-01-06 19:32:34,401 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 375 transitions. Word has length 44 [2021-01-06 19:32:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,401 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 375 transitions. [2021-01-06 19:32:34,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 375 transitions. [2021-01-06 19:32:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 19:32:34,406 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:32:34,407 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1551516849, now seen corresponding path program 1 times [2021-01-06 19:32:34,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120293651] [2021-01-06 19:32:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:34,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120293651] [2021-01-06 19:32:34,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:34,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34960077] [2021-01-06 19:32:34,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:34,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,592 INFO L87 Difference]: Start difference. First operand 265 states and 375 transitions. Second operand 3 states. [2021-01-06 19:32:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,644 INFO L93 Difference]: Finished difference Result 742 states and 1062 transitions. [2021-01-06 19:32:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:34,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 19:32:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,650 INFO L225 Difference]: With dead ends: 742 [2021-01-06 19:32:34,650 INFO L226 Difference]: Without dead ends: 494 [2021-01-06 19:32:34,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-01-06 19:32:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 300. [2021-01-06 19:32:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 19:32:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 427 transitions. [2021-01-06 19:32:34,674 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 427 transitions. Word has length 53 [2021-01-06 19:32:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,676 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 427 transitions. [2021-01-06 19:32:34,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 427 transitions. [2021-01-06 19:32:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:32:34,684 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:32:34,685 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,686 INFO L82 PathProgramCache]: Analyzing trace with hash -357597848, now seen corresponding path program 1 times [2021-01-06 19:32:34,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821684165] [2021-01-06 19:32:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:34,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821684165] [2021-01-06 19:32:34,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:34,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294033135] [2021-01-06 19:32:34,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:34,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:34,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,813 INFO L87 Difference]: Start difference. First operand 300 states and 427 transitions. Second operand 3 states. [2021-01-06 19:32:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,865 INFO L93 Difference]: Finished difference Result 822 states and 1181 transitions. [2021-01-06 19:32:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:34,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-06 19:32:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,870 INFO L225 Difference]: With dead ends: 822 [2021-01-06 19:32:34,870 INFO L226 Difference]: Without dead ends: 539 [2021-01-06 19:32:34,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-01-06 19:32:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 325. [2021-01-06 19:32:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2021-01-06 19:32:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 465 transitions. [2021-01-06 19:32:34,885 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 465 transitions. Word has length 54 [2021-01-06 19:32:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,886 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 465 transitions. [2021-01-06 19:32:34,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 465 transitions. [2021-01-06 19:32:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 19:32:34,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:32:34,888 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash 322460522, now seen corresponding path program 1 times [2021-01-06 19:32:34,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535972249] [2021-01-06 19:32:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:34,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535972249] [2021-01-06 19:32:34,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:34,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798718942] [2021-01-06 19:32:34,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:34,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:34,977 INFO L87 Difference]: Start difference. First operand 325 states and 465 transitions. Second operand 5 states. [2021-01-06 19:32:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:35,284 INFO L93 Difference]: Finished difference Result 1007 states and 1452 transitions. [2021-01-06 19:32:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:35,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2021-01-06 19:32:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:35,289 INFO L225 Difference]: With dead ends: 1007 [2021-01-06 19:32:35,289 INFO L226 Difference]: Without dead ends: 699 [2021-01-06 19:32:35,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:32:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-01-06 19:32:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 419. [2021-01-06 19:32:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2021-01-06 19:32:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 596 transitions. [2021-01-06 19:32:35,311 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 596 transitions. Word has length 54 [2021-01-06 19:32:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:35,312 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 596 transitions. [2021-01-06 19:32:35,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 596 transitions. [2021-01-06 19:32:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-01-06 19:32:35,313 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:35,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:35,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:32:35,313 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2009785193, now seen corresponding path program 1 times [2021-01-06 19:32:35,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:35,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211066058] [2021-01-06 19:32:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:35,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211066058] [2021-01-06 19:32:35,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:35,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:35,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925213165] [2021-01-06 19:32:35,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:35,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:35,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:35,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:35,393 INFO L87 Difference]: Start difference. First operand 419 states and 596 transitions. Second operand 5 states. [2021-01-06 19:32:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:35,652 INFO L93 Difference]: Finished difference Result 1011 states and 1452 transitions. [2021-01-06 19:32:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:35,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2021-01-06 19:32:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:35,657 INFO L225 Difference]: With dead ends: 1011 [2021-01-06 19:32:35,657 INFO L226 Difference]: Without dead ends: 703 [2021-01-06 19:32:35,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:32:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-01-06 19:32:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 427. [2021-01-06 19:32:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2021-01-06 19:32:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 604 transitions. [2021-01-06 19:32:35,681 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 604 transitions. Word has length 55 [2021-01-06 19:32:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:35,681 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 604 transitions. [2021-01-06 19:32:35,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 604 transitions. [2021-01-06 19:32:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-06 19:32:35,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:35,683 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:32:35,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:32:35,683 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -621480091, now seen corresponding path program 1 times [2021-01-06 19:32:35,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:35,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028851077] [2021-01-06 19:32:35,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:35,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028851077] [2021-01-06 19:32:35,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:35,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:35,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123845249] [2021-01-06 19:32:35,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:35,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:35,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:35,773 INFO L87 Difference]: Start difference. First operand 427 states and 604 transitions. Second operand 4 states. [2021-01-06 19:32:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,025 INFO L93 Difference]: Finished difference Result 1011 states and 1444 transitions. [2021-01-06 19:32:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:36,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2021-01-06 19:32:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,030 INFO L225 Difference]: With dead ends: 1011 [2021-01-06 19:32:36,030 INFO L226 Difference]: Without dead ends: 703 [2021-01-06 19:32:36,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-01-06 19:32:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 427. [2021-01-06 19:32:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2021-01-06 19:32:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 600 transitions. [2021-01-06 19:32:36,057 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 600 transitions. Word has length 57 [2021-01-06 19:32:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,057 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 600 transitions. [2021-01-06 19:32:36,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 600 transitions. [2021-01-06 19:32:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 19:32:36,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,059 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:32:36,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:32:36,059 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1688514268, now seen corresponding path program 1 times [2021-01-06 19:32:36,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81969953] [2021-01-06 19:32:36,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81969953] [2021-01-06 19:32:36,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:36,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069055797] [2021-01-06 19:32:36,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:36,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:36,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,131 INFO L87 Difference]: Start difference. First operand 427 states and 600 transitions. Second operand 3 states. [2021-01-06 19:32:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,175 INFO L93 Difference]: Finished difference Result 859 states and 1231 transitions. [2021-01-06 19:32:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:36,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2021-01-06 19:32:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,179 INFO L225 Difference]: With dead ends: 859 [2021-01-06 19:32:36,179 INFO L226 Difference]: Without dead ends: 551 [2021-01-06 19:32:36,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-01-06 19:32:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 422. [2021-01-06 19:32:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2021-01-06 19:32:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 592 transitions. [2021-01-06 19:32:36,204 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 592 transitions. Word has length 58 [2021-01-06 19:32:36,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,204 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 592 transitions. [2021-01-06 19:32:36,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 592 transitions. [2021-01-06 19:32:36,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 19:32:36,205 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,205 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:32:36,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:32:36,206 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -741802892, now seen corresponding path program 1 times [2021-01-06 19:32:36,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094372280] [2021-01-06 19:32:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094372280] [2021-01-06 19:32:36,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:36,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343396025] [2021-01-06 19:32:36,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:36,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,276 INFO L87 Difference]: Start difference. First operand 422 states and 592 transitions. Second operand 3 states. [2021-01-06 19:32:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,360 INFO L93 Difference]: Finished difference Result 858 states and 1230 transitions. [2021-01-06 19:32:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:36,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 19:32:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,364 INFO L225 Difference]: With dead ends: 858 [2021-01-06 19:32:36,364 INFO L226 Difference]: Without dead ends: 555 [2021-01-06 19:32:36,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-01-06 19:32:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 402. [2021-01-06 19:32:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2021-01-06 19:32:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 560 transitions. [2021-01-06 19:32:36,390 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 560 transitions. Word has length 62 [2021-01-06 19:32:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,391 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 560 transitions. [2021-01-06 19:32:36,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2021-01-06 19:32:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:32:36,392 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,392 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:32:36,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:32:36,392 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1449842060, now seen corresponding path program 1 times [2021-01-06 19:32:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997978215] [2021-01-06 19:32:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997978215] [2021-01-06 19:32:36,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:36,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86611639] [2021-01-06 19:32:36,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:36,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,471 INFO L87 Difference]: Start difference. First operand 402 states and 560 transitions. Second operand 3 states. [2021-01-06 19:32:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,545 INFO L93 Difference]: Finished difference Result 826 states and 1174 transitions. [2021-01-06 19:32:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:36,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:32:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,549 INFO L225 Difference]: With dead ends: 826 [2021-01-06 19:32:36,549 INFO L226 Difference]: Without dead ends: 543 [2021-01-06 19:32:36,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-01-06 19:32:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 390. [2021-01-06 19:32:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2021-01-06 19:32:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 542 transitions. [2021-01-06 19:32:36,578 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 542 transitions. Word has length 66 [2021-01-06 19:32:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,578 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 542 transitions. [2021-01-06 19:32:36,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 542 transitions. [2021-01-06 19:32:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:32:36,580 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:36,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:32:36,580 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2013886397, now seen corresponding path program 1 times [2021-01-06 19:32:36,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626078844] [2021-01-06 19:32:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626078844] [2021-01-06 19:32:36,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:36,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575062418] [2021-01-06 19:32:36,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:36,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:36,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:36,662 INFO L87 Difference]: Start difference. First operand 390 states and 542 transitions. Second operand 6 states. [2021-01-06 19:32:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,855 INFO L93 Difference]: Finished difference Result 1436 states and 2033 transitions. [2021-01-06 19:32:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:36,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2021-01-06 19:32:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,861 INFO L225 Difference]: With dead ends: 1436 [2021-01-06 19:32:36,862 INFO L226 Difference]: Without dead ends: 1165 [2021-01-06 19:32:36,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-01-06 19:32:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 411. [2021-01-06 19:32:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2021-01-06 19:32:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 566 transitions. [2021-01-06 19:32:36,898 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 566 transitions. Word has length 67 [2021-01-06 19:32:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,899 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 566 transitions. [2021-01-06 19:32:36,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 566 transitions. [2021-01-06 19:32:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:32:36,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,900 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:32:36,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:32:36,900 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1216909730, now seen corresponding path program 1 times [2021-01-06 19:32:36,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129209314] [2021-01-06 19:32:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:36,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129209314] [2021-01-06 19:32:36,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:36,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201910827] [2021-01-06 19:32:36,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:36,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:36,981 INFO L87 Difference]: Start difference. First operand 411 states and 566 transitions. Second operand 3 states. [2021-01-06 19:32:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,080 INFO L93 Difference]: Finished difference Result 843 states and 1190 transitions. [2021-01-06 19:32:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:37,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 19:32:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,084 INFO L225 Difference]: With dead ends: 843 [2021-01-06 19:32:37,084 INFO L226 Difference]: Without dead ends: 572 [2021-01-06 19:32:37,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-01-06 19:32:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 391. [2021-01-06 19:32:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-06 19:32:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 534 transitions. [2021-01-06 19:32:37,113 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 534 transitions. Word has length 69 [2021-01-06 19:32:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:37,113 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 534 transitions. [2021-01-06 19:32:37,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 534 transitions. [2021-01-06 19:32:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:32:37,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:37,115 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:32:37,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:32:37,115 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:37,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1979952454, now seen corresponding path program 1 times [2021-01-06 19:32:37,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:37,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334102796] [2021-01-06 19:32:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:37,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334102796] [2021-01-06 19:32:37,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:37,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:37,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343684413] [2021-01-06 19:32:37,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:37,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:37,179 INFO L87 Difference]: Start difference. First operand 391 states and 534 transitions. Second operand 3 states. [2021-01-06 19:32:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,267 INFO L93 Difference]: Finished difference Result 811 states and 1134 transitions. [2021-01-06 19:32:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:37,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 19:32:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,271 INFO L225 Difference]: With dead ends: 811 [2021-01-06 19:32:37,271 INFO L226 Difference]: Without dead ends: 560 [2021-01-06 19:32:37,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-01-06 19:32:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 379. [2021-01-06 19:32:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2021-01-06 19:32:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 516 transitions. [2021-01-06 19:32:37,301 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 516 transitions. Word has length 73 [2021-01-06 19:32:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:37,302 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 516 transitions. [2021-01-06 19:32:37,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 516 transitions. [2021-01-06 19:32:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:32:37,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:37,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:37,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:32:37,303 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -797041989, now seen corresponding path program 1 times [2021-01-06 19:32:37,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:37,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232286328] [2021-01-06 19:32:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:37,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232286328] [2021-01-06 19:32:37,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:37,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:37,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394447921] [2021-01-06 19:32:37,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:37,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:37,453 INFO L87 Difference]: Start difference. First operand 379 states and 516 transitions. Second operand 6 states. [2021-01-06 19:32:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,682 INFO L93 Difference]: Finished difference Result 1083 states and 1512 transitions. [2021-01-06 19:32:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:37,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 19:32:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,687 INFO L225 Difference]: With dead ends: 1083 [2021-01-06 19:32:37,687 INFO L226 Difference]: Without dead ends: 844 [2021-01-06 19:32:37,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-01-06 19:32:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 404. [2021-01-06 19:32:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2021-01-06 19:32:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 551 transitions. [2021-01-06 19:32:37,723 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 551 transitions. Word has length 76 [2021-01-06 19:32:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:37,723 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 551 transitions. [2021-01-06 19:32:37,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 551 transitions. [2021-01-06 19:32:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:32:37,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:37,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:37,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:32:37,725 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1479160478, now seen corresponding path program 1 times [2021-01-06 19:32:37,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:37,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56013708] [2021-01-06 19:32:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:37,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56013708] [2021-01-06 19:32:37,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:37,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:32:37,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315505975] [2021-01-06 19:32:37,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:32:37,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:37,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:32:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:37,856 INFO L87 Difference]: Start difference. First operand 404 states and 551 transitions. Second operand 7 states. [2021-01-06 19:32:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:38,429 INFO L93 Difference]: Finished difference Result 1408 states and 1955 transitions. [2021-01-06 19:32:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:38,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2021-01-06 19:32:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:38,437 INFO L225 Difference]: With dead ends: 1408 [2021-01-06 19:32:38,437 INFO L226 Difference]: Without dead ends: 1151 [2021-01-06 19:32:38,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-01-06 19:32:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 432. [2021-01-06 19:32:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2021-01-06 19:32:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 582 transitions. [2021-01-06 19:32:38,491 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 582 transitions. Word has length 76 [2021-01-06 19:32:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:38,491 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 582 transitions. [2021-01-06 19:32:38,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:32:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 582 transitions. [2021-01-06 19:32:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:32:38,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:38,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:38,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:32:38,493 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 532768487, now seen corresponding path program 1 times [2021-01-06 19:32:38,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:38,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059732777] [2021-01-06 19:32:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:38,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059732777] [2021-01-06 19:32:38,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:38,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:38,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320705554] [2021-01-06 19:32:38,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:38,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:38,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:38,596 INFO L87 Difference]: Start difference. First operand 432 states and 582 transitions. Second operand 4 states. [2021-01-06 19:32:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:38,774 INFO L93 Difference]: Finished difference Result 1115 states and 1519 transitions. [2021-01-06 19:32:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:38,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:32:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:38,779 INFO L225 Difference]: With dead ends: 1115 [2021-01-06 19:32:38,779 INFO L226 Difference]: Without dead ends: 852 [2021-01-06 19:32:38,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-01-06 19:32:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 653. [2021-01-06 19:32:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2021-01-06 19:32:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 870 transitions. [2021-01-06 19:32:38,847 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 870 transitions. Word has length 76 [2021-01-06 19:32:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:38,848 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 870 transitions. [2021-01-06 19:32:38,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 870 transitions. [2021-01-06 19:32:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:32:38,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:38,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:38,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:32:38,854 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:38,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1675634663, now seen corresponding path program 1 times [2021-01-06 19:32:38,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:38,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444597047] [2021-01-06 19:32:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:38,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444597047] [2021-01-06 19:32:38,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:38,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:38,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313479003] [2021-01-06 19:32:38,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:38,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:38,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:38,969 INFO L87 Difference]: Start difference. First operand 653 states and 870 transitions. Second operand 3 states. [2021-01-06 19:32:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:39,080 INFO L93 Difference]: Finished difference Result 1138 states and 1550 transitions. [2021-01-06 19:32:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:39,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:32:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:39,084 INFO L225 Difference]: With dead ends: 1138 [2021-01-06 19:32:39,085 INFO L226 Difference]: Without dead ends: 760 [2021-01-06 19:32:39,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-01-06 19:32:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 649. [2021-01-06 19:32:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2021-01-06 19:32:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 863 transitions. [2021-01-06 19:32:39,151 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 863 transitions. Word has length 77 [2021-01-06 19:32:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:39,151 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 863 transitions. [2021-01-06 19:32:39,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 863 transitions. [2021-01-06 19:32:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:32:39,152 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:39,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:39,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:32:39,153 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -43406846, now seen corresponding path program 1 times [2021-01-06 19:32:39,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:39,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756498194] [2021-01-06 19:32:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:39,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756498194] [2021-01-06 19:32:39,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:39,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:39,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829460369] [2021-01-06 19:32:39,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:39,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:39,216 INFO L87 Difference]: Start difference. First operand 649 states and 863 transitions. Second operand 4 states. [2021-01-06 19:32:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:39,405 INFO L93 Difference]: Finished difference Result 1453 states and 1955 transitions. [2021-01-06 19:32:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:39,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:32:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:39,411 INFO L225 Difference]: With dead ends: 1453 [2021-01-06 19:32:39,411 INFO L226 Difference]: Without dead ends: 1065 [2021-01-06 19:32:39,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-01-06 19:32:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 868. [2021-01-06 19:32:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2021-01-06 19:32:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1145 transitions. [2021-01-06 19:32:39,495 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1145 transitions. Word has length 78 [2021-01-06 19:32:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:39,495 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 1145 transitions. [2021-01-06 19:32:39,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1145 transitions. [2021-01-06 19:32:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:32:39,497 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:39,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:39,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:32:39,498 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1923184217, now seen corresponding path program 1 times [2021-01-06 19:32:39,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:39,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068558006] [2021-01-06 19:32:39,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:39,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068558006] [2021-01-06 19:32:39,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:39,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:39,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12430850] [2021-01-06 19:32:39,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:39,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:39,562 INFO L87 Difference]: Start difference. First operand 868 states and 1145 transitions. Second operand 3 states. [2021-01-06 19:32:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:39,777 INFO L93 Difference]: Finished difference Result 2026 states and 2690 transitions. [2021-01-06 19:32:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:39,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:32:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:39,784 INFO L225 Difference]: With dead ends: 2026 [2021-01-06 19:32:39,784 INFO L226 Difference]: Without dead ends: 1417 [2021-01-06 19:32:39,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2021-01-06 19:32:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 870. [2021-01-06 19:32:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2021-01-06 19:32:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1147 transitions. [2021-01-06 19:32:39,869 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1147 transitions. Word has length 78 [2021-01-06 19:32:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:39,869 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 1147 transitions. [2021-01-06 19:32:39,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1147 transitions. [2021-01-06 19:32:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:32:39,871 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:39,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:39,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:32:39,871 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1579042436, now seen corresponding path program 1 times [2021-01-06 19:32:39,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:39,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221471714] [2021-01-06 19:32:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:39,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221471714] [2021-01-06 19:32:39,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:39,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:39,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349135373] [2021-01-06 19:32:39,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:39,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:39,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:39,988 INFO L87 Difference]: Start difference. First operand 870 states and 1147 transitions. Second operand 6 states. [2021-01-06 19:32:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:40,585 INFO L93 Difference]: Finished difference Result 3233 states and 4332 transitions. [2021-01-06 19:32:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:40,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-01-06 19:32:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:40,598 INFO L225 Difference]: With dead ends: 3233 [2021-01-06 19:32:40,598 INFO L226 Difference]: Without dead ends: 2713 [2021-01-06 19:32:40,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2021-01-06 19:32:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 996. [2021-01-06 19:32:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2021-01-06 19:32:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1294 transitions. [2021-01-06 19:32:40,713 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1294 transitions. Word has length 78 [2021-01-06 19:32:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:40,714 INFO L481 AbstractCegarLoop]: Abstraction has 996 states and 1294 transitions. [2021-01-06 19:32:40,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1294 transitions. [2021-01-06 19:32:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:32:40,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:40,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, 1, 1, 1] [2021-01-06 19:32:40,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:32:40,716 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1296090681, now seen corresponding path program 1 times [2021-01-06 19:32:40,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:40,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607045516] [2021-01-06 19:32:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:40,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:32:40,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607045516] [2021-01-06 19:32:40,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:40,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:40,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562432842] [2021-01-06 19:32:40,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:40,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:40,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:40,801 INFO L87 Difference]: Start difference. First operand 996 states and 1294 transitions. Second operand 4 states. [2021-01-06 19:32:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:41,062 INFO L93 Difference]: Finished difference Result 2394 states and 3157 transitions. [2021-01-06 19:32:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:41,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:32:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:41,071 INFO L225 Difference]: With dead ends: 2394 [2021-01-06 19:32:41,071 INFO L226 Difference]: Without dead ends: 1826 [2021-01-06 19:32:41,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2021-01-06 19:32:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1351. [2021-01-06 19:32:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2021-01-06 19:32:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1751 transitions. [2021-01-06 19:32:41,210 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1751 transitions. Word has length 79 [2021-01-06 19:32:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:41,211 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1751 transitions. [2021-01-06 19:32:41,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1751 transitions. [2021-01-06 19:32:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:32:41,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:41,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:41,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:32:41,214 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash -127959653, now seen corresponding path program 1 times [2021-01-06 19:32:41,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:41,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786782134] [2021-01-06 19:32:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:41,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786782134] [2021-01-06 19:32:41,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:41,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:41,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050582357] [2021-01-06 19:32:41,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:41,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:41,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:41,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:41,284 INFO L87 Difference]: Start difference. First operand 1351 states and 1751 transitions. Second operand 4 states. [2021-01-06 19:32:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:41,521 INFO L93 Difference]: Finished difference Result 2691 states and 3515 transitions. [2021-01-06 19:32:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:41,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:32:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:41,530 INFO L225 Difference]: With dead ends: 2691 [2021-01-06 19:32:41,530 INFO L226 Difference]: Without dead ends: 1416 [2021-01-06 19:32:41,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2021-01-06 19:32:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1055. [2021-01-06 19:32:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2021-01-06 19:32:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1382 transitions. [2021-01-06 19:32:41,738 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1382 transitions. Word has length 80 [2021-01-06 19:32:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:41,738 INFO L481 AbstractCegarLoop]: Abstraction has 1055 states and 1382 transitions. [2021-01-06 19:32:41,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1382 transitions. [2021-01-06 19:32:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:32:41,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:41,741 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:32:41,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:32:41,742 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1884673237, now seen corresponding path program 1 times [2021-01-06 19:32:41,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:41,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182228282] [2021-01-06 19:32:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:41,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182228282] [2021-01-06 19:32:41,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:41,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:41,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111588075] [2021-01-06 19:32:41,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:41,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:41,878 INFO L87 Difference]: Start difference. First operand 1055 states and 1382 transitions. Second operand 6 states. [2021-01-06 19:32:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:42,341 INFO L93 Difference]: Finished difference Result 2881 states and 3895 transitions. [2021-01-06 19:32:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:42,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2021-01-06 19:32:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:42,352 INFO L225 Difference]: With dead ends: 2881 [2021-01-06 19:32:42,352 INFO L226 Difference]: Without dead ends: 2073 [2021-01-06 19:32:42,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2021-01-06 19:32:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1055. [2021-01-06 19:32:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2021-01-06 19:32:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1377 transitions. [2021-01-06 19:32:42,508 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1377 transitions. Word has length 81 [2021-01-06 19:32:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:42,508 INFO L481 AbstractCegarLoop]: Abstraction has 1055 states and 1377 transitions. [2021-01-06 19:32:42,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:42,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1377 transitions. [2021-01-06 19:32:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:32:42,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:42,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:32:42,510 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1245633243, now seen corresponding path program 1 times [2021-01-06 19:32:42,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:42,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146386292] [2021-01-06 19:32:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:42,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:32:42,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146386292] [2021-01-06 19:32:42,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:42,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:42,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975737874] [2021-01-06 19:32:42,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:42,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:42,553 INFO L87 Difference]: Start difference. First operand 1055 states and 1377 transitions. Second operand 3 states. [2021-01-06 19:32:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:42,834 INFO L93 Difference]: Finished difference Result 2489 states and 3269 transitions. [2021-01-06 19:32:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:42,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:32:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:42,844 INFO L225 Difference]: With dead ends: 2489 [2021-01-06 19:32:42,844 INFO L226 Difference]: Without dead ends: 1584 [2021-01-06 19:32:42,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2021-01-06 19:32:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1061. [2021-01-06 19:32:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2021-01-06 19:32:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1383 transitions. [2021-01-06 19:32:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1383 transitions. Word has length 82 [2021-01-06 19:32:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:42,977 INFO L481 AbstractCegarLoop]: Abstraction has 1061 states and 1383 transitions. [2021-01-06 19:32:42,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1383 transitions. [2021-01-06 19:32:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:32:42,978 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:42,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:42,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:32:42,979 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1936137551, now seen corresponding path program 1 times [2021-01-06 19:32:42,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:42,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818041957] [2021-01-06 19:32:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:43,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818041957] [2021-01-06 19:32:43,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:43,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:32:43,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844216868] [2021-01-06 19:32:43,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:43,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:43,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:43,129 INFO L87 Difference]: Start difference. First operand 1061 states and 1383 transitions. Second operand 4 states. [2021-01-06 19:32:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:43,384 INFO L93 Difference]: Finished difference Result 2433 states and 3189 transitions. [2021-01-06 19:32:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:32:43,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 19:32:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:43,392 INFO L225 Difference]: With dead ends: 2433 [2021-01-06 19:32:43,392 INFO L226 Difference]: Without dead ends: 1472 [2021-01-06 19:32:43,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-01-06 19:32:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1001. [2021-01-06 19:32:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2021-01-06 19:32:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1301 transitions. [2021-01-06 19:32:43,523 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1301 transitions. Word has length 82 [2021-01-06 19:32:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:43,524 INFO L481 AbstractCegarLoop]: Abstraction has 1001 states and 1301 transitions. [2021-01-06 19:32:43,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1301 transitions. [2021-01-06 19:32:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:32:43,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:43,525 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:32:43,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:32:43,525 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash 916931346, now seen corresponding path program 1 times [2021-01-06 19:32:43,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:43,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755944804] [2021-01-06 19:32:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:43,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755944804] [2021-01-06 19:32:43,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:43,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:43,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162911703] [2021-01-06 19:32:43,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:43,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:43,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:43,689 INFO L87 Difference]: Start difference. First operand 1001 states and 1301 transitions. Second operand 6 states. [2021-01-06 19:32:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:44,230 INFO L93 Difference]: Finished difference Result 3294 states and 4477 transitions. [2021-01-06 19:32:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:32:44,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2021-01-06 19:32:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:44,261 INFO L225 Difference]: With dead ends: 3294 [2021-01-06 19:32:44,261 INFO L226 Difference]: Without dead ends: 2492 [2021-01-06 19:32:44,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:32:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2021-01-06 19:32:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 989. [2021-01-06 19:32:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2021-01-06 19:32:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1289 transitions. [2021-01-06 19:32:44,414 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1289 transitions. Word has length 84 [2021-01-06 19:32:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:44,414 INFO L481 AbstractCegarLoop]: Abstraction has 989 states and 1289 transitions. [2021-01-06 19:32:44,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1289 transitions. [2021-01-06 19:32:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:32:44,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:44,416 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:32:44,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:32:44,416 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1263730727, now seen corresponding path program 1 times [2021-01-06 19:32:44,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:44,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373852746] [2021-01-06 19:32:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:44,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373852746] [2021-01-06 19:32:44,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:44,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:44,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579249682] [2021-01-06 19:32:44,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:44,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:44,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:44,522 INFO L87 Difference]: Start difference. First operand 989 states and 1289 transitions. Second operand 6 states. [2021-01-06 19:32:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:44,960 INFO L93 Difference]: Finished difference Result 1777 states and 2354 transitions. [2021-01-06 19:32:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:32:44,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2021-01-06 19:32:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:44,965 INFO L225 Difference]: With dead ends: 1777 [2021-01-06 19:32:44,965 INFO L226 Difference]: Without dead ends: 1775 [2021-01-06 19:32:44,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:32:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2021-01-06 19:32:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 991. [2021-01-06 19:32:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2021-01-06 19:32:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1291 transitions. [2021-01-06 19:32:45,097 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1291 transitions. Word has length 84 [2021-01-06 19:32:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:45,097 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 1291 transitions. [2021-01-06 19:32:45,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1291 transitions. [2021-01-06 19:32:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:32:45,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:45,099 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:32:45,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:32:45,099 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1741086502, now seen corresponding path program 1 times [2021-01-06 19:32:45,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:45,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660184424] [2021-01-06 19:32:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:45,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660184424] [2021-01-06 19:32:45,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:45,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:32:45,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596908010] [2021-01-06 19:32:45,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:45,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:45,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:45,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:32:45,193 INFO L87 Difference]: Start difference. First operand 991 states and 1291 transitions. Second operand 6 states. [2021-01-06 19:32:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:45,566 INFO L93 Difference]: Finished difference Result 2376 states and 3244 transitions. [2021-01-06 19:32:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:45,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2021-01-06 19:32:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:45,570 INFO L225 Difference]: With dead ends: 2376 [2021-01-06 19:32:45,570 INFO L226 Difference]: Without dead ends: 1572 [2021-01-06 19:32:45,573 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:32:45,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2021-01-06 19:32:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 997. [2021-01-06 19:32:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2021-01-06 19:32:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1297 transitions. [2021-01-06 19:32:45,712 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1297 transitions. Word has length 85 [2021-01-06 19:32:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:45,713 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1297 transitions. [2021-01-06 19:32:45,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1297 transitions. [2021-01-06 19:32:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 19:32:45,717 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:45,717 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] [2021-01-06 19:32:45,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:32:45,718 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash 53692854, now seen corresponding path program 1 times [2021-01-06 19:32:45,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:45,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610597593] [2021-01-06 19:32:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:45,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610597593] [2021-01-06 19:32:45,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588199093] [2021-01-06 19:32:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:46,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:32:46,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:32:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:32:46,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:32:46,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-01-06 19:32:46,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624377482] [2021-01-06 19:32:46,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:32:46,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:32:46,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:32:46,535 INFO L87 Difference]: Start difference. First operand 997 states and 1297 transitions. Second operand 6 states. [2021-01-06 19:32:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:47,107 INFO L93 Difference]: Finished difference Result 2581 states and 3495 transitions. [2021-01-06 19:32:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:32:47,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2021-01-06 19:32:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:47,112 INFO L225 Difference]: With dead ends: 2581 [2021-01-06 19:32:47,112 INFO L226 Difference]: Without dead ends: 1771 [2021-01-06 19:32:47,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:32:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2021-01-06 19:32:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 997. [2021-01-06 19:32:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2021-01-06 19:32:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1296 transitions. [2021-01-06 19:32:47,272 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1296 transitions. Word has length 135 [2021-01-06 19:32:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:47,272 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1296 transitions. [2021-01-06 19:32:47,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:32:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1296 transitions. [2021-01-06 19:32:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 19:32:47,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:47,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:47,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:47,491 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1818112463, now seen corresponding path program 1 times [2021-01-06 19:32:47,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:47,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933831592] [2021-01-06 19:32:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:47,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933831592] [2021-01-06 19:32:47,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476171699] [2021-01-06 19:32:47,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:32:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:48,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:32:48,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:32:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:48,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:32:48,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-01-06 19:32:48,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436336860] [2021-01-06 19:32:48,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:32:48,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:32:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:32:48,356 INFO L87 Difference]: Start difference. First operand 997 states and 1296 transitions. Second operand 13 states. [2021-01-06 19:33:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:03,105 INFO L93 Difference]: Finished difference Result 16639 states and 22191 transitions. [2021-01-06 19:33:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2021-01-06 19:33:03,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2021-01-06 19:33:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:03,148 INFO L225 Difference]: With dead ends: 16639 [2021-01-06 19:33:03,149 INFO L226 Difference]: Without dead ends: 15835 [2021-01-06 19:33:03,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29009 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=8289, Invalid=55467, Unknown=0, NotChecked=0, Total=63756 [2021-01-06 19:33:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15835 states. [2021-01-06 19:33:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15835 to 2706. [2021-01-06 19:33:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2021-01-06 19:33:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3525 transitions. [2021-01-06 19:33:03,804 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3525 transitions. Word has length 139 [2021-01-06 19:33:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:03,804 INFO L481 AbstractCegarLoop]: Abstraction has 2706 states and 3525 transitions. [2021-01-06 19:33:03,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:33:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3525 transitions. [2021-01-06 19:33:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-01-06 19:33:03,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:03,810 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:04,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:04,025 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:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -202174165, now seen corresponding path program 1 times [2021-01-06 19:33:04,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:04,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225662253] [2021-01-06 19:33:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,254 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:04,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225662253] [2021-01-06 19:33:04,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087247923] [2021-01-06 19:33:04,255 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:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:04,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:33:04,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:04,694 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:04,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:33:04,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2021-01-06 19:33:04,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452429596] [2021-01-06 19:33:04,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:04,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:04,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:04,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:33:04,698 INFO L87 Difference]: Start difference. First operand 2706 states and 3525 transitions. Second operand 6 states. [2021-01-06 19:33:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:05,677 INFO L93 Difference]: Finished difference Result 7240 states and 9818 transitions. [2021-01-06 19:33:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:05,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2021-01-06 19:33:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:05,688 INFO L225 Difference]: With dead ends: 7240 [2021-01-06 19:33:05,688 INFO L226 Difference]: Without dead ends: 4761 [2021-01-06 19:33:05,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:33:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2021-01-06 19:33:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 2363. [2021-01-06 19:33:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2021-01-06 19:33:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3084 transitions. [2021-01-06 19:33:06,183 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3084 transitions. Word has length 140 [2021-01-06 19:33:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:06,184 INFO L481 AbstractCegarLoop]: Abstraction has 2363 states and 3084 transitions. [2021-01-06 19:33:06,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3084 transitions. [2021-01-06 19:33:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 19:33:06,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:06,189 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] [2021-01-06 19:33:06,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:06,404 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:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 328556361, now seen corresponding path program 1 times [2021-01-06 19:33:06,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:06,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272873528] [2021-01-06 19:33:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:06,569 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:06,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272873528] [2021-01-06 19:33:06,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:06,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:33:06,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148016911] [2021-01-06 19:33:06,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:33:06,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:33:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:33:06,571 INFO L87 Difference]: Start difference. First operand 2363 states and 3084 transitions. Second operand 7 states. [2021-01-06 19:33:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:08,817 INFO L93 Difference]: Finished difference Result 13973 states and 18760 transitions. [2021-01-06 19:33:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:33:08,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2021-01-06 19:33:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:08,841 INFO L225 Difference]: With dead ends: 13973 [2021-01-06 19:33:08,842 INFO L226 Difference]: Without dead ends: 11877 [2021-01-06 19:33:08,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:33:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2021-01-06 19:33:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 2819. [2021-01-06 19:33:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2021-01-06 19:33:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3614 transitions. [2021-01-06 19:33:09,494 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3614 transitions. Word has length 141 [2021-01-06 19:33:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:09,494 INFO L481 AbstractCegarLoop]: Abstraction has 2819 states and 3614 transitions. [2021-01-06 19:33:09,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:33:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3614 transitions. [2021-01-06 19:33:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:09,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:09,501 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:09,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:33:09,501 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:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 76678734, now seen corresponding path program 1 times [2021-01-06 19:33:09,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:09,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945448889] [2021-01-06 19:33:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:09,684 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:09,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945448889] [2021-01-06 19:33:09,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954085271] [2021-01-06 19:33:09,685 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:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:09,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:33:09,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:10,074 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:10,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:10,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2021-01-06 19:33:10,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129316638] [2021-01-06 19:33:10,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:33:10,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:33:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:33:10,076 INFO L87 Difference]: Start difference. First operand 2819 states and 3614 transitions. Second operand 11 states. [2021-01-06 19:33:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:12,726 INFO L93 Difference]: Finished difference Result 8026 states and 10464 transitions. [2021-01-06 19:33:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-06 19:33:12,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2021-01-06 19:33:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:12,736 INFO L225 Difference]: With dead ends: 8026 [2021-01-06 19:33:12,736 INFO L226 Difference]: Without dead ends: 5271 [2021-01-06 19:33:12,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2021-01-06 19:33:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2021-01-06 19:33:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 2343. [2021-01-06 19:33:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2343 states. [2021-01-06 19:33:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3006 transitions. [2021-01-06 19:33:13,165 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3006 transitions. Word has length 143 [2021-01-06 19:33:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:13,165 INFO L481 AbstractCegarLoop]: Abstraction has 2343 states and 3006 transitions. [2021-01-06 19:33:13,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:33:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3006 transitions. [2021-01-06 19:33:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:13,171 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:13,171 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] [2021-01-06 19:33:13,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:13,385 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:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1720993890, now seen corresponding path program 1 times [2021-01-06 19:33:13,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:13,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833051390] [2021-01-06 19:33:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:13,687 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:13,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833051390] [2021-01-06 19:33:13,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246745438] [2021-01-06 19:33:13,687 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:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-06 19:33:13,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:13,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 19:33:14,338 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:14,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:14,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-01-06 19:33:14,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520380828] [2021-01-06 19:33:14,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:33:14,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:33:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:14,343 INFO L87 Difference]: Start difference. First operand 2343 states and 3006 transitions. Second operand 18 states. [2021-01-06 19:33:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:16,814 INFO L93 Difference]: Finished difference Result 6458 states and 8318 transitions. [2021-01-06 19:33:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 19:33:16,814 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 143 [2021-01-06 19:33:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:16,820 INFO L225 Difference]: With dead ends: 6458 [2021-01-06 19:33:16,820 INFO L226 Difference]: Without dead ends: 4330 [2021-01-06 19:33:16,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2021-01-06 19:33:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-01-06 19:33:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 2601. [2021-01-06 19:33:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2021-01-06 19:33:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 3330 transitions. [2021-01-06 19:33:17,309 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 3330 transitions. Word has length 143 [2021-01-06 19:33:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:17,310 INFO L481 AbstractCegarLoop]: Abstraction has 2601 states and 3330 transitions. [2021-01-06 19:33:17,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:33:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 3330 transitions. [2021-01-06 19:33:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 19:33:17,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:17,316 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] [2021-01-06 19:33:17,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-01-06 19:33:17,531 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:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 442622684, now seen corresponding path program 1 times [2021-01-06 19:33:17,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:17,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453503621] [2021-01-06 19:33:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:17,636 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:17,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453503621] [2021-01-06 19:33:17,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:17,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:17,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964288940] [2021-01-06 19:33:17,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:17,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:17,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:17,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:17,638 INFO L87 Difference]: Start difference. First operand 2601 states and 3330 transitions. Second operand 5 states. [2021-01-06 19:33:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:18,077 INFO L93 Difference]: Finished difference Result 4908 states and 6331 transitions. [2021-01-06 19:33:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:18,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2021-01-06 19:33:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:18,080 INFO L225 Difference]: With dead ends: 4908 [2021-01-06 19:33:18,080 INFO L226 Difference]: Without dead ends: 2461 [2021-01-06 19:33:18,084 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:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2021-01-06 19:33:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2021-01-06 19:33:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2021-01-06 19:33:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3153 transitions. [2021-01-06 19:33:18,441 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3153 transitions. Word has length 143 [2021-01-06 19:33:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:18,441 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 3153 transitions. [2021-01-06 19:33:18,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3153 transitions. [2021-01-06 19:33:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:18,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:18,446 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] [2021-01-06 19:33:18,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:33:18,447 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:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash 296470726, now seen corresponding path program 1 times [2021-01-06 19:33:18,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:18,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400969352] [2021-01-06 19:33:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:18,690 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:18,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400969352] [2021-01-06 19:33:18,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719398447] [2021-01-06 19:33:18,691 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:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:18,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-06 19:33:18,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:19,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 19:33:19,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 19:33:19,374 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:19,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:19,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-01-06 19:33:19,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073679951] [2021-01-06 19:33:19,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 19:33:19,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:19,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 19:33:19,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:19,376 INFO L87 Difference]: Start difference. First operand 2461 states and 3153 transitions. Second operand 18 states. [2021-01-06 19:33:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:22,526 INFO L93 Difference]: Finished difference Result 6722 states and 8630 transitions. [2021-01-06 19:33:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-01-06 19:33:22,527 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 144 [2021-01-06 19:33:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:22,530 INFO L225 Difference]: With dead ends: 6722 [2021-01-06 19:33:22,530 INFO L226 Difference]: Without dead ends: 4476 [2021-01-06 19:33:22,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=401, Invalid=1579, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 19:33:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2021-01-06 19:33:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 2740. [2021-01-06 19:33:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2021-01-06 19:33:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3501 transitions. [2021-01-06 19:33:23,087 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3501 transitions. Word has length 144 [2021-01-06 19:33:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:23,088 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3501 transitions. [2021-01-06 19:33:23,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 19:33:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3501 transitions. [2021-01-06 19:33:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:23,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:23,093 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:23,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:23,308 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:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -742113848, now seen corresponding path program 1 times [2021-01-06 19:33:23,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:23,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681460056] [2021-01-06 19:33:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:23,370 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:23,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681460056] [2021-01-06 19:33:23,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:23,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:23,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350259268] [2021-01-06 19:33:23,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:23,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:23,372 INFO L87 Difference]: Start difference. First operand 2740 states and 3501 transitions. Second operand 4 states. [2021-01-06 19:33:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:23,917 INFO L93 Difference]: Finished difference Result 5111 states and 6573 transitions. [2021-01-06 19:33:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:23,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2021-01-06 19:33:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:23,920 INFO L225 Difference]: With dead ends: 5111 [2021-01-06 19:33:23,920 INFO L226 Difference]: Without dead ends: 2527 [2021-01-06 19:33:23,923 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:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2021-01-06 19:33:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2515. [2021-01-06 19:33:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2021-01-06 19:33:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3201 transitions. [2021-01-06 19:33:24,307 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3201 transitions. Word has length 144 [2021-01-06 19:33:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:24,307 INFO L481 AbstractCegarLoop]: Abstraction has 2515 states and 3201 transitions. [2021-01-06 19:33:24,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3201 transitions. [2021-01-06 19:33:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:24,310 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:24,310 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] [2021-01-06 19:33:24,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:33:24,310 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:24,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -238390573, now seen corresponding path program 1 times [2021-01-06 19:33:24,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:24,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31741875] [2021-01-06 19:33:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:24,515 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:24,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31741875] [2021-01-06 19:33:24,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:24,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 19:33:24,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50544929] [2021-01-06 19:33:24,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:33:24,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:24,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:33:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:33:24,517 INFO L87 Difference]: Start difference. First operand 2515 states and 3201 transitions. Second operand 10 states. [2021-01-06 19:33:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:25,799 INFO L93 Difference]: Finished difference Result 6630 states and 8512 transitions. [2021-01-06 19:33:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:33:25,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2021-01-06 19:33:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:25,805 INFO L225 Difference]: With dead ends: 6630 [2021-01-06 19:33:25,806 INFO L226 Difference]: Without dead ends: 4330 [2021-01-06 19:33:25,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:33:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2021-01-06 19:33:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 2850. [2021-01-06 19:33:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2021-01-06 19:33:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3624 transitions. [2021-01-06 19:33:26,454 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3624 transitions. Word has length 144 [2021-01-06 19:33:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:26,454 INFO L481 AbstractCegarLoop]: Abstraction has 2850 states and 3624 transitions. [2021-01-06 19:33:26,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:33:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3624 transitions. [2021-01-06 19:33:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-01-06 19:33:26,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:26,459 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:26,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:33:26,459 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:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1520562859, now seen corresponding path program 1 times [2021-01-06 19:33:26,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:26,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217059517] [2021-01-06 19:33:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:26,577 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:26,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217059517] [2021-01-06 19:33:26,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:26,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:26,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567746113] [2021-01-06 19:33:26,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:26,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:26,580 INFO L87 Difference]: Start difference. First operand 2850 states and 3624 transitions. Second operand 5 states. [2021-01-06 19:33:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:27,094 INFO L93 Difference]: Finished difference Result 5326 states and 6811 transitions. [2021-01-06 19:33:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:33:27,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2021-01-06 19:33:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:27,097 INFO L225 Difference]: With dead ends: 5326 [2021-01-06 19:33:27,097 INFO L226 Difference]: Without dead ends: 2633 [2021-01-06 19:33:27,099 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:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2021-01-06 19:33:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2633. [2021-01-06 19:33:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2021-01-06 19:33:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3351 transitions. [2021-01-06 19:33:27,466 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3351 transitions. Word has length 144 [2021-01-06 19:33:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:27,466 INFO L481 AbstractCegarLoop]: Abstraction has 2633 states and 3351 transitions. [2021-01-06 19:33:27,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3351 transitions. [2021-01-06 19:33:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 19:33:27,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:27,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, 1] [2021-01-06 19:33:27,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 19:33:27,469 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:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1712108579, now seen corresponding path program 1 times [2021-01-06 19:33:27,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:27,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468343572] [2021-01-06 19:33:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:27,750 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:27,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468343572] [2021-01-06 19:33:27,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267297675] [2021-01-06 19:33:27,751 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:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:27,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:33:27,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:28,293 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:28,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:28,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-01-06 19:33:28,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51155235] [2021-01-06 19:33:28,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 19:33:28,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 19:33:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 19:33:28,295 INFO L87 Difference]: Start difference. First operand 2633 states and 3351 transitions. Second operand 10 states. [2021-01-06 19:33:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:29,821 INFO L93 Difference]: Finished difference Result 7269 states and 9259 transitions. [2021-01-06 19:33:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:33:29,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2021-01-06 19:33:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:29,825 INFO L225 Difference]: With dead ends: 7269 [2021-01-06 19:33:29,825 INFO L226 Difference]: Without dead ends: 4851 [2021-01-06 19:33:29,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:33:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2021-01-06 19:33:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 2644. [2021-01-06 19:33:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2021-01-06 19:33:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3362 transitions. [2021-01-06 19:33:30,255 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3362 transitions. Word has length 145 [2021-01-06 19:33:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:30,256 INFO L481 AbstractCegarLoop]: Abstraction has 2644 states and 3362 transitions. [2021-01-06 19:33:30,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 19:33:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3362 transitions. [2021-01-06 19:33:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 19:33:30,259 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:30,259 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] [2021-01-06 19:33:30,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:30,463 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:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -911347769, now seen corresponding path program 1 times [2021-01-06 19:33:30,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:30,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298975575] [2021-01-06 19:33:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:30,680 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:30,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298975575] [2021-01-06 19:33:30,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135951702] [2021-01-06 19:33:30,681 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:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:30,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:33:30,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:31,137 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:31,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:33:31,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2021-01-06 19:33:31,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670415186] [2021-01-06 19:33:31,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:31,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:33:31,139 INFO L87 Difference]: Start difference. First operand 2644 states and 3362 transitions. Second operand 6 states. [2021-01-06 19:33:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:32,329 INFO L93 Difference]: Finished difference Result 8626 states and 11243 transitions. [2021-01-06 19:33:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:33:32,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2021-01-06 19:33:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:32,335 INFO L225 Difference]: With dead ends: 8626 [2021-01-06 19:33:32,335 INFO L226 Difference]: Without dead ends: 6157 [2021-01-06 19:33:32,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:33:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2021-01-06 19:33:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 2644. [2021-01-06 19:33:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2021-01-06 19:33:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3360 transitions. [2021-01-06 19:33:32,811 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3360 transitions. Word has length 145 [2021-01-06 19:33:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:32,811 INFO L481 AbstractCegarLoop]: Abstraction has 2644 states and 3360 transitions. [2021-01-06 19:33:32,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3360 transitions. [2021-01-06 19:33:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 19:33:32,814 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:32,814 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:33,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-01-06 19:33:33,015 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:33:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -547307946, now seen corresponding path program 1 times [2021-01-06 19:33:33,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:33,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191282893] [2021-01-06 19:33:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:33,164 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:33:33,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191282893] [2021-01-06 19:33:33,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642838612] [2021-01-06 19:33:33,165 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:33:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:33,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:33:33,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:33,555 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:33:33,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:33,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2021-01-06 19:33:33,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247750813] [2021-01-06 19:33:33,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:33:33,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:33:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:33:33,557 INFO L87 Difference]: Start difference. First operand 2644 states and 3360 transitions. Second operand 8 states. [2021-01-06 19:33:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:35,241 INFO L93 Difference]: Finished difference Result 10060 states and 12825 transitions. [2021-01-06 19:33:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 19:33:35,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2021-01-06 19:33:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:35,251 INFO L225 Difference]: With dead ends: 10060 [2021-01-06 19:33:35,251 INFO L226 Difference]: Without dead ends: 7631 [2021-01-06 19:33:35,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-01-06 19:33:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2021-01-06 19:33:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 4003. [2021-01-06 19:33:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4003 states. [2021-01-06 19:33:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4003 states to 4003 states and 5097 transitions. [2021-01-06 19:33:35,953 INFO L78 Accepts]: Start accepts. Automaton has 4003 states and 5097 transitions. Word has length 146 [2021-01-06 19:33:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:35,953 INFO L481 AbstractCegarLoop]: Abstraction has 4003 states and 5097 transitions. [2021-01-06 19:33:35,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:33:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4003 states and 5097 transitions. [2021-01-06 19:33:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-01-06 19:33:35,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:35,958 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:36,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:36,161 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:33:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1585892520, now seen corresponding path program 1 times [2021-01-06 19:33:36,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:36,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402247118] [2021-01-06 19:33:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:36,221 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:33:36,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402247118] [2021-01-06 19:33:36,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:36,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:33:36,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481341567] [2021-01-06 19:33:36,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:36,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:36,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:36,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:36,223 INFO L87 Difference]: Start difference. First operand 4003 states and 5097 transitions. Second operand 4 states. [2021-01-06 19:33:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:36,798 INFO L93 Difference]: Finished difference Result 6987 states and 8976 transitions. [2021-01-06 19:33:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:36,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2021-01-06 19:33:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:36,801 INFO L225 Difference]: With dead ends: 6987 [2021-01-06 19:33:36,801 INFO L226 Difference]: Without dead ends: 3199 [2021-01-06 19:33:36,804 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:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2021-01-06 19:33:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3180. [2021-01-06 19:33:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3180 states. [2021-01-06 19:33:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 3180 states and 4047 transitions. [2021-01-06 19:33:37,333 INFO L78 Accepts]: Start accepts. Automaton has 3180 states and 4047 transitions. Word has length 146 [2021-01-06 19:33:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:37,334 INFO L481 AbstractCegarLoop]: Abstraction has 3180 states and 4047 transitions. [2021-01-06 19:33:37,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3180 states and 4047 transitions. [2021-01-06 19:33:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:33:37,337 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:37,337 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:37,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 19:33:37,337 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:33:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1555711294, now seen corresponding path program 1 times [2021-01-06 19:33:37,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:37,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427720932] [2021-01-06 19:33:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:37,523 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:37,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427720932] [2021-01-06 19:33:37,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315379874] [2021-01-06 19:33:37,524 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:33:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:37,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:33:37,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:38,015 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:33:38,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:38,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2021-01-06 19:33:38,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044099045] [2021-01-06 19:33:38,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 19:33:38,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 19:33:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:33:38,017 INFO L87 Difference]: Start difference. First operand 3180 states and 4047 transitions. Second operand 15 states. [2021-01-06 19:33:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:49,660 INFO L93 Difference]: Finished difference Result 18839 states and 24337 transitions. [2021-01-06 19:33:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2021-01-06 19:33:49,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 148 [2021-01-06 19:33:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:49,683 INFO L225 Difference]: With dead ends: 18839 [2021-01-06 19:33:49,683 INFO L226 Difference]: Without dead ends: 15874 [2021-01-06 19:33:49,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12819 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4607, Invalid=26899, Unknown=0, NotChecked=0, Total=31506 [2021-01-06 19:33:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2021-01-06 19:33:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 3059. [2021-01-06 19:33:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3059 states. [2021-01-06 19:33:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 3838 transitions. [2021-01-06 19:33:50,289 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 3838 transitions. Word has length 148 [2021-01-06 19:33:50,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:50,289 INFO L481 AbstractCegarLoop]: Abstraction has 3059 states and 3838 transitions. [2021-01-06 19:33:50,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 19:33:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 3838 transitions. [2021-01-06 19:33:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-01-06 19:33:50,292 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:50,292 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:50,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:33:50,493 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:33:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1914409723, now seen corresponding path program 1 times [2021-01-06 19:33:50,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:50,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659557029] [2021-01-06 19:33:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:50,657 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:33:50,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659557029] [2021-01-06 19:33:50,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:50,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:50,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118482317] [2021-01-06 19:33:50,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:50,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:50,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:50,659 INFO L87 Difference]: Start difference. First operand 3059 states and 3838 transitions. Second operand 6 states. [2021-01-06 19:33:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:52,586 INFO L93 Difference]: Finished difference Result 10329 states and 13281 transitions. [2021-01-06 19:33:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:33:52,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2021-01-06 19:33:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:52,593 INFO L225 Difference]: With dead ends: 10329 [2021-01-06 19:33:52,593 INFO L226 Difference]: Without dead ends: 7553 [2021-01-06 19:33:52,596 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:33:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2021-01-06 19:33:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 3140. [2021-01-06 19:33:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2021-01-06 19:33:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 3934 transitions. [2021-01-06 19:33:53,157 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 3934 transitions. Word has length 150 [2021-01-06 19:33:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:53,157 INFO L481 AbstractCegarLoop]: Abstraction has 3140 states and 3934 transitions. [2021-01-06 19:33:53,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:33:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 3934 transitions. [2021-01-06 19:33:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:33:53,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:53,161 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, 1] [2021-01-06 19:33:53,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 19:33:53,161 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:33:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2103246866, now seen corresponding path program 1 times [2021-01-06 19:33:53,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:53,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554228802] [2021-01-06 19:33:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:53,382 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:33:53,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554228802] [2021-01-06 19:33:53,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587620399] [2021-01-06 19:33:53,383 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:33:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:53,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:33:53,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:33:53,865 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:33:53,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:33:53,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-01-06 19:33:53,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121646951] [2021-01-06 19:33:53,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:33:53,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:33:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:33:53,867 INFO L87 Difference]: Start difference. First operand 3140 states and 3934 transitions. Second operand 8 states. [2021-01-06 19:33:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:55,876 INFO L93 Difference]: Finished difference Result 9217 states and 11812 transitions. [2021-01-06 19:33:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:33:55,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2021-01-06 19:33:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:55,882 INFO L225 Difference]: With dead ends: 9217 [2021-01-06 19:33:55,882 INFO L226 Difference]: Without dead ends: 6360 [2021-01-06 19:33:55,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:33:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2021-01-06 19:33:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 3140. [2021-01-06 19:33:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2021-01-06 19:33:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 3906 transitions. [2021-01-06 19:33:56,465 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 3906 transitions. Word has length 151 [2021-01-06 19:33:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:56,465 INFO L481 AbstractCegarLoop]: Abstraction has 3140 states and 3906 transitions. [2021-01-06 19:33:56,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:33:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 3906 transitions. [2021-01-06 19:33:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:33:56,468 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:56,468 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:33:56,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-01-06 19:33:56,670 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:33:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 455514027, now seen corresponding path program 1 times [2021-01-06 19:33:56,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:56,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890981797] [2021-01-06 19:33:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:56,764 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:33:56,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890981797] [2021-01-06 19:33:56,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:56,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:33:56,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368372068] [2021-01-06 19:33:56,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:33:56,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:33:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:33:56,766 INFO L87 Difference]: Start difference. First operand 3140 states and 3906 transitions. Second operand 6 states. [2021-01-06 19:33:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:59,493 INFO L93 Difference]: Finished difference Result 14485 states and 18520 transitions. [2021-01-06 19:33:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:33:59,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2021-01-06 19:33:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:59,504 INFO L225 Difference]: With dead ends: 14485 [2021-01-06 19:33:59,504 INFO L226 Difference]: Without dead ends: 11628 [2021-01-06 19:33:59,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:33:59,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11628 states. [2021-01-06 19:34:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11628 to 3609. [2021-01-06 19:34:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2021-01-06 19:34:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4441 transitions. [2021-01-06 19:34:00,269 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4441 transitions. Word has length 151 [2021-01-06 19:34:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:00,269 INFO L481 AbstractCegarLoop]: Abstraction has 3609 states and 4441 transitions. [2021-01-06 19:34:00,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:34:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4441 transitions. [2021-01-06 19:34:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 19:34:00,273 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:00,274 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:00,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 19:34:00,274 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:00,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash 566846588, now seen corresponding path program 1 times [2021-01-06 19:34:00,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:00,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302108426] [2021-01-06 19:34:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:00,361 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:00,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302108426] [2021-01-06 19:34:00,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:00,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:34:00,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739509720] [2021-01-06 19:34:00,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:34:00,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:34:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:00,363 INFO L87 Difference]: Start difference. First operand 3609 states and 4441 transitions. Second operand 4 states. [2021-01-06 19:34:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:01,554 INFO L93 Difference]: Finished difference Result 8739 states and 10893 transitions. [2021-01-06 19:34:01,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:34:01,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2021-01-06 19:34:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:01,559 INFO L225 Difference]: With dead ends: 8739 [2021-01-06 19:34:01,560 INFO L226 Difference]: Without dead ends: 5413 [2021-01-06 19:34:01,563 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:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2021-01-06 19:34:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 4313. [2021-01-06 19:34:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2021-01-06 19:34:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 5298 transitions. [2021-01-06 19:34:02,375 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 5298 transitions. Word has length 152 [2021-01-06 19:34:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:02,375 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 5298 transitions. [2021-01-06 19:34:02,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:34:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 5298 transitions. [2021-01-06 19:34:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 19:34:02,379 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:02,379 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] [2021-01-06 19:34:02,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 19:34:02,379 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:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 322051501, now seen corresponding path program 1 times [2021-01-06 19:34:02,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:02,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989939748] [2021-01-06 19:34:02,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:02,563 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:02,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989939748] [2021-01-06 19:34:02,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725327312] [2021-01-06 19:34:02,564 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:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:02,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:34:02,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:02,974 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:02,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:02,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-01-06 19:34:02,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177511822] [2021-01-06 19:34:02,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:34:02,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:34:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:34:02,976 INFO L87 Difference]: Start difference. First operand 4313 states and 5298 transitions. Second operand 7 states. [2021-01-06 19:34:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:05,423 INFO L93 Difference]: Finished difference Result 15041 states and 19000 transitions. [2021-01-06 19:34:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:34:05,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2021-01-06 19:34:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:05,432 INFO L225 Difference]: With dead ends: 15041 [2021-01-06 19:34:05,432 INFO L226 Difference]: Without dead ends: 11011 [2021-01-06 19:34:05,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 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:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11011 states. [2021-01-06 19:34:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11011 to 6777. [2021-01-06 19:34:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6777 states. [2021-01-06 19:34:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 8351 transitions. [2021-01-06 19:34:06,891 INFO L78 Accepts]: Start accepts. Automaton has 6777 states and 8351 transitions. Word has length 152 [2021-01-06 19:34:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:06,891 INFO L481 AbstractCegarLoop]: Abstraction has 6777 states and 8351 transitions. [2021-01-06 19:34:06,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:34:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6777 states and 8351 transitions. [2021-01-06 19:34:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 19:34:06,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:06,896 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, 1] [2021-01-06 19:34:07,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-01-06 19:34:07,112 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:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1281823144, now seen corresponding path program 1 times [2021-01-06 19:34:07,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:07,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827156322] [2021-01-06 19:34:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:07,342 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:07,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827156322] [2021-01-06 19:34:07,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372538009] [2021-01-06 19:34:07,342 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:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:07,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 20 conjunts are in the unsatisfiable core [2021-01-06 19:34:07,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:07,866 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:07,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:07,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-01-06 19:34:07,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870328933] [2021-01-06 19:34:07,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 19:34:07,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 19:34:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:34:07,868 INFO L87 Difference]: Start difference. First operand 6777 states and 8351 transitions. Second operand 14 states. [2021-01-06 19:34:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:28,895 INFO L93 Difference]: Finished difference Result 35628 states and 44792 transitions. [2021-01-06 19:34:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2021-01-06 19:34:28,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2021-01-06 19:34:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:28,921 INFO L225 Difference]: With dead ends: 35628 [2021-01-06 19:34:28,921 INFO L226 Difference]: Without dead ends: 30280 [2021-01-06 19:34:28,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49827 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=12787, Invalid=92513, Unknown=0, NotChecked=0, Total=105300 [2021-01-06 19:34:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30280 states. [2021-01-06 19:34:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30280 to 10340. [2021-01-06 19:34:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10340 states. [2021-01-06 19:34:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10340 states to 10340 states and 12751 transitions. [2021-01-06 19:34:31,394 INFO L78 Accepts]: Start accepts. Automaton has 10340 states and 12751 transitions. Word has length 152 [2021-01-06 19:34:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:31,394 INFO L481 AbstractCegarLoop]: Abstraction has 10340 states and 12751 transitions. [2021-01-06 19:34:31,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 19:34:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 10340 states and 12751 transitions. [2021-01-06 19:34:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 19:34:31,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:31,400 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, 1] [2021-01-06 19:34:31,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-01-06 19:34:31,602 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:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1008679096, now seen corresponding path program 1 times [2021-01-06 19:34:31,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:31,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052825927] [2021-01-06 19:34:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:31,938 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:31,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052825927] [2021-01-06 19:34:31,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668182361] [2021-01-06 19:34:31,939 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:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:32,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-06 19:34:32,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:32,247 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: variable got div captured [2021-01-06 19:34:32,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:34:32,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-01-06 19:34:32,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373453502] [2021-01-06 19:34:32,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:34:32,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:34:32,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:34:32,249 INFO L87 Difference]: Start difference. First operand 10340 states and 12751 transitions. Second operand 8 states. [2021-01-06 19:34:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:35,750 INFO L93 Difference]: Finished difference Result 19942 states and 24885 transitions. [2021-01-06 19:34:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:34:35,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 153 [2021-01-06 19:34:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:35,760 INFO L225 Difference]: With dead ends: 19942 [2021-01-06 19:34:35,760 INFO L226 Difference]: Without dead ends: 12691 [2021-01-06 19:34:35,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-01-06 19:34:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12691 states. [2021-01-06 19:34:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12691 to 10101. [2021-01-06 19:34:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10101 states. [2021-01-06 19:34:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10101 states to 10101 states and 12437 transitions. [2021-01-06 19:34:37,952 INFO L78 Accepts]: Start accepts. Automaton has 10101 states and 12437 transitions. Word has length 153 [2021-01-06 19:34:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:37,952 INFO L481 AbstractCegarLoop]: Abstraction has 10101 states and 12437 transitions. [2021-01-06 19:34:37,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:34:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10101 states and 12437 transitions. [2021-01-06 19:34:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:34:37,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:37,958 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:34:38,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:34:38,167 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:34:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1373202317, now seen corresponding path program 1 times [2021-01-06 19:34:38,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:38,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790033734] [2021-01-06 19:34:38,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:34:38,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790033734] [2021-01-06 19:34:38,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:38,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:34:38,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938060073] [2021-01-06 19:34:38,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:34:38,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:34:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:38,237 INFO L87 Difference]: Start difference. First operand 10101 states and 12437 transitions. Second operand 4 states. [2021-01-06 19:34:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:41,549 INFO L93 Difference]: Finished difference Result 22915 states and 28322 transitions. [2021-01-06 19:34:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:34:41,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2021-01-06 19:34:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:41,562 INFO L225 Difference]: With dead ends: 22915 [2021-01-06 19:34:41,562 INFO L226 Difference]: Without dead ends: 14567 [2021-01-06 19:34:41,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:34:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14567 states. [2021-01-06 19:34:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14567 to 10089. [2021-01-06 19:34:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10089 states. [2021-01-06 19:34:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10089 states to 10089 states and 12401 transitions. [2021-01-06 19:34:43,762 INFO L78 Accepts]: Start accepts. Automaton has 10089 states and 12401 transitions. Word has length 154 [2021-01-06 19:34:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:43,762 INFO L481 AbstractCegarLoop]: Abstraction has 10089 states and 12401 transitions. [2021-01-06 19:34:43,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:34:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10089 states and 12401 transitions. [2021-01-06 19:34:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:34:43,767 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:43,767 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:34:43,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 19:34:43,767 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:34:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 188289643, now seen corresponding path program 1 times [2021-01-06 19:34:43,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:43,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750378433] [2021-01-06 19:34:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:44,009 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:34:44,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750378433] [2021-01-06 19:34:44,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800474357] [2021-01-06 19:34:44,010 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:34:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:44,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:34:44,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:34:44,535 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:34:44,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:34:44,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2021-01-06 19:34:44,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371547182] [2021-01-06 19:34:44,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 19:34:44,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:44,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 19:34:44,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:34:44,537 INFO L87 Difference]: Start difference. First operand 10089 states and 12401 transitions. Second operand 16 states. [2021-01-06 19:35:01,610 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 19:35:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:13,400 INFO L93 Difference]: Finished difference Result 53232 states and 65985 transitions. [2021-01-06 19:35:13,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2021-01-06 19:35:13,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 154 [2021-01-06 19:35:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:13,441 INFO L225 Difference]: With dead ends: 53232 [2021-01-06 19:35:13,442 INFO L226 Difference]: Without dead ends: 45770 [2021-01-06 19:35:13,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19709 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=6585, Invalid=42035, Unknown=0, NotChecked=0, Total=48620 [2021-01-06 19:35:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45770 states. [2021-01-06 19:35:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45770 to 13195. [2021-01-06 19:35:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13195 states. [2021-01-06 19:35:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13195 states to 13195 states and 16053 transitions. [2021-01-06 19:35:17,033 INFO L78 Accepts]: Start accepts. Automaton has 13195 states and 16053 transitions. Word has length 154 [2021-01-06 19:35:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:17,033 INFO L481 AbstractCegarLoop]: Abstraction has 13195 states and 16053 transitions. [2021-01-06 19:35:17,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 19:35:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13195 states and 16053 transitions. [2021-01-06 19:35:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-01-06 19:35:17,038 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:17,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, 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:35:17,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-01-06 19:35:17,239 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:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash -521124872, now seen corresponding path program 1 times [2021-01-06 19:35:17,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:17,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530777138] [2021-01-06 19:35:17,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:17,297 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:17,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530777138] [2021-01-06 19:35:17,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:17,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:17,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337495064] [2021-01-06 19:35:17,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:17,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:17,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:17,300 INFO L87 Difference]: Start difference. First operand 13195 states and 16053 transitions. Second operand 4 states. [2021-01-06 19:35:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:19,297 INFO L93 Difference]: Finished difference Result 20728 states and 25275 transitions. [2021-01-06 19:35:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:19,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2021-01-06 19:35:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:19,307 INFO L225 Difference]: With dead ends: 20728 [2021-01-06 19:35:19,307 INFO L226 Difference]: Without dead ends: 8326 [2021-01-06 19:35:19,316 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:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8326 states. [2021-01-06 19:35:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8326 to 8298. [2021-01-06 19:35:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8298 states. [2021-01-06 19:35:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8298 states to 8298 states and 10065 transitions. [2021-01-06 19:35:21,304 INFO L78 Accepts]: Start accepts. Automaton has 8298 states and 10065 transitions. Word has length 154 [2021-01-06 19:35:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:21,304 INFO L481 AbstractCegarLoop]: Abstraction has 8298 states and 10065 transitions. [2021-01-06 19:35:21,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8298 states and 10065 transitions. [2021-01-06 19:35:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:35:21,306 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:21,307 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, 1] [2021-01-06 19:35:21,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 19:35:21,307 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:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1861432215, now seen corresponding path program 1 times [2021-01-06 19:35:21,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:21,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250875842] [2021-01-06 19:35:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:21,543 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:21,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250875842] [2021-01-06 19:35:21,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16113999] [2021-01-06 19:35:21,544 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:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:21,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:35:21,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:22,104 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:22,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:35:22,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-01-06 19:35:22,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611590491] [2021-01-06 19:35:22,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:35:22,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:35:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:35:22,107 INFO L87 Difference]: Start difference. First operand 8298 states and 10065 transitions. Second operand 13 states. [2021-01-06 19:35:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:38,217 INFO L93 Difference]: Finished difference Result 40418 states and 50722 transitions. [2021-01-06 19:35:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2021-01-06 19:35:38,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2021-01-06 19:35:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:38,247 INFO L225 Difference]: With dead ends: 40418 [2021-01-06 19:35:38,247 INFO L226 Difference]: Without dead ends: 34302 [2021-01-06 19:35:38,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7811 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2820, Invalid=16640, Unknown=0, NotChecked=0, Total=19460 [2021-01-06 19:35:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34302 states. [2021-01-06 19:35:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34302 to 7901. [2021-01-06 19:35:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7901 states. [2021-01-06 19:35:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7901 states to 7901 states and 9581 transitions. [2021-01-06 19:35:40,433 INFO L78 Accepts]: Start accepts. Automaton has 7901 states and 9581 transitions. Word has length 155 [2021-01-06 19:35:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:40,433 INFO L481 AbstractCegarLoop]: Abstraction has 7901 states and 9581 transitions. [2021-01-06 19:35:40,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:35:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7901 states and 9581 transitions. [2021-01-06 19:35:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:35:40,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:40,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, 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:40,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:35:40,636 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:35:40,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:40,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1867735863, now seen corresponding path program 1 times [2021-01-06 19:35:40,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:40,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232299819] [2021-01-06 19:35:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:40,879 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:40,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232299819] [2021-01-06 19:35:40,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499048137] [2021-01-06 19:35:40,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 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:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:41,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:35:41,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:41,402 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:41,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:35:41,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-01-06 19:35:41,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435632002] [2021-01-06 19:35:41,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:35:41,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:35:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:35:41,404 INFO L87 Difference]: Start difference. First operand 7901 states and 9581 transitions. Second operand 8 states. [2021-01-06 19:35:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:47,453 INFO L93 Difference]: Finished difference Result 23959 states and 29960 transitions. [2021-01-06 19:35:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 19:35:47,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2021-01-06 19:35:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:47,470 INFO L225 Difference]: With dead ends: 23959 [2021-01-06 19:35:47,470 INFO L226 Difference]: Without dead ends: 18355 [2021-01-06 19:35:47,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:35:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18355 states. [2021-01-06 19:35:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18355 to 7225. [2021-01-06 19:35:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2021-01-06 19:35:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 8747 transitions. [2021-01-06 19:35:49,445 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 8747 transitions. Word has length 155 [2021-01-06 19:35:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:49,446 INFO L481 AbstractCegarLoop]: Abstraction has 7225 states and 8747 transitions. [2021-01-06 19:35:49,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:35:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 8747 transitions. [2021-01-06 19:35:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:35:49,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:49,448 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] [2021-01-06 19:35:49,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-01-06 19:35:49,649 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:35:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1268685670, now seen corresponding path program 1 times [2021-01-06 19:35:49,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:49,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500836797] [2021-01-06 19:35:49,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-01-06 19:35:49,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500836797] [2021-01-06 19:35:49,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:49,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:49,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699569942] [2021-01-06 19:35:49,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:49,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:49,709 INFO L87 Difference]: Start difference. First operand 7225 states and 8747 transitions. Second operand 4 states. [2021-01-06 19:35:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:51,585 INFO L93 Difference]: Finished difference Result 12823 states and 15575 transitions. [2021-01-06 19:35:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:51,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 19:35:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:51,591 INFO L225 Difference]: With dead ends: 12823 [2021-01-06 19:35:51,591 INFO L226 Difference]: Without dead ends: 5998 [2021-01-06 19:35:51,595 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:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2021-01-06 19:35:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 5998. [2021-01-06 19:35:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5998 states. [2021-01-06 19:35:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 7250 transitions. [2021-01-06 19:35:53,210 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 7250 transitions. Word has length 155 [2021-01-06 19:35:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:53,210 INFO L481 AbstractCegarLoop]: Abstraction has 5998 states and 7250 transitions. [2021-01-06 19:35:53,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 7250 transitions. [2021-01-06 19:35:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 19:35:53,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:53,212 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] [2021-01-06 19:35:53,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 19:35:53,213 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:35:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1411621101, now seen corresponding path program 1 times [2021-01-06 19:35:53,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:53,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415017975] [2021-01-06 19:35:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,461 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:35:53,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415017975] [2021-01-06 19:35:53,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698652567] [2021-01-06 19:35:53,461 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:35:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:35:53,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:54,163 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:35:54,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:35:54,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2021-01-06 19:35:54,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612940017] [2021-01-06 19:35:54,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:35:54,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:54,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:35:54,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:35:54,165 INFO L87 Difference]: Start difference. First operand 5998 states and 7250 transitions. Second operand 9 states. [2021-01-06 19:35:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:56,927 INFO L93 Difference]: Finished difference Result 11236 states and 13697 transitions. [2021-01-06 19:35:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 19:35:56,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2021-01-06 19:35:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:56,935 INFO L225 Difference]: With dead ends: 11236 [2021-01-06 19:35:56,935 INFO L226 Difference]: Without dead ends: 6659 [2021-01-06 19:35:56,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2021-01-06 19:35:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2021-01-06 19:35:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5545. [2021-01-06 19:35:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2021-01-06 19:35:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 6702 transitions. [2021-01-06 19:35:58,408 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 6702 transitions. Word has length 157 [2021-01-06 19:35:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:58,408 INFO L481 AbstractCegarLoop]: Abstraction has 5545 states and 6702 transitions. [2021-01-06 19:35:58,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:35:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 6702 transitions. [2021-01-06 19:35:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 19:35:58,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:58,410 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:35:58,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-01-06 19:35:58,614 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:35:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1072880605, now seen corresponding path program 1 times [2021-01-06 19:35:58,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:58,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217722567] [2021-01-06 19:35:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:58,800 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:35:58,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217722567] [2021-01-06 19:35:58,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778357716] [2021-01-06 19:35:58,801 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:35:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:59,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-06 19:35:59,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:35:59,283 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:35:59,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:35:59,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2021-01-06 19:35:59,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501597872] [2021-01-06 19:35:59,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:35:59,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:35:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:35:59,285 INFO L87 Difference]: Start difference. First operand 5545 states and 6702 transitions. Second operand 6 states. [2021-01-06 19:36:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:02,751 INFO L93 Difference]: Finished difference Result 15764 states and 19476 transitions. [2021-01-06 19:36:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 19:36:02,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2021-01-06 19:36:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:02,761 INFO L225 Difference]: With dead ends: 15764 [2021-01-06 19:36:02,761 INFO L226 Difference]: Without dead ends: 11111 [2021-01-06 19:36:02,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:36:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2021-01-06 19:36:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 5542. [2021-01-06 19:36:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2021-01-06 19:36:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 6683 transitions. [2021-01-06 19:36:04,215 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 6683 transitions. Word has length 157 [2021-01-06 19:36:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:04,215 INFO L481 AbstractCegarLoop]: Abstraction has 5542 states and 6683 transitions. [2021-01-06 19:36:04,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:36:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 6683 transitions. [2021-01-06 19:36:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 19:36:04,217 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:04,217 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, 1] [2021-01-06 19:36:04,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-01-06 19:36:04,419 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:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:04,420 INFO L82 PathProgramCache]: Analyzing trace with hash -633030939, now seen corresponding path program 1 times [2021-01-06 19:36:04,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:04,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569001150] [2021-01-06 19:36:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:04,606 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:04,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569001150] [2021-01-06 19:36:04,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:04,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:36:04,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836472122] [2021-01-06 19:36:04,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:36:04,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:36:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:36:04,609 INFO L87 Difference]: Start difference. First operand 5542 states and 6683 transitions. Second operand 7 states. [2021-01-06 19:36:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:07,566 INFO L93 Difference]: Finished difference Result 12412 states and 15301 transitions. [2021-01-06 19:36:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:36:07,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2021-01-06 19:36:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:07,574 INFO L225 Difference]: With dead ends: 12412 [2021-01-06 19:36:07,575 INFO L226 Difference]: Without dead ends: 8373 [2021-01-06 19:36:07,577 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:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2021-01-06 19:36:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 5538. [2021-01-06 19:36:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5538 states. [2021-01-06 19:36:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 6671 transitions. [2021-01-06 19:36:09,028 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 6671 transitions. Word has length 158 [2021-01-06 19:36:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:09,029 INFO L481 AbstractCegarLoop]: Abstraction has 5538 states and 6671 transitions. [2021-01-06 19:36:09,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:36:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 6671 transitions. [2021-01-06 19:36:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 19:36:09,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:09,032 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:09,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 19:36:09,032 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:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -188877085, now seen corresponding path program 1 times [2021-01-06 19:36:09,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:09,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710676910] [2021-01-06 19:36:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:09,307 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:09,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710676910] [2021-01-06 19:36:09,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021032598] [2021-01-06 19:36:09,307 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:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:09,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 19:36:09,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:10,128 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:10,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:36:10,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2021-01-06 19:36:10,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196717314] [2021-01-06 19:36:10,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 19:36:10,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 19:36:10,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:36:10,129 INFO L87 Difference]: Start difference. First operand 5538 states and 6671 transitions. Second operand 20 states. [2021-01-06 19:36:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:22,390 INFO L93 Difference]: Finished difference Result 13837 states and 16915 transitions. [2021-01-06 19:36:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-01-06 19:36:22,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 158 [2021-01-06 19:36:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:22,398 INFO L225 Difference]: With dead ends: 13837 [2021-01-06 19:36:22,398 INFO L226 Difference]: Without dead ends: 9393 [2021-01-06 19:36:22,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7284 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2964, Invalid=16218, Unknown=0, NotChecked=0, Total=19182 [2021-01-06 19:36:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states. [2021-01-06 19:36:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 5360. [2021-01-06 19:36:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5360 states. [2021-01-06 19:36:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 6462 transitions. [2021-01-06 19:36:24,007 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 6462 transitions. Word has length 158 [2021-01-06 19:36:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:24,007 INFO L481 AbstractCegarLoop]: Abstraction has 5360 states and 6462 transitions. [2021-01-06 19:36:24,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 19:36:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 6462 transitions. [2021-01-06 19:36:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 19:36:24,009 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:24,009 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, 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:36:24,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2021-01-06 19:36:24,210 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:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2114719648, now seen corresponding path program 1 times [2021-01-06 19:36:24,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:24,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977788256] [2021-01-06 19:36:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 40 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:24,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977788256] [2021-01-06 19:36:24,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334171769] [2021-01-06 19:36:24,423 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:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:24,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-06 19:36:24,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:36:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:25,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:36:25,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-01-06 19:36:25,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492710898] [2021-01-06 19:36:25,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:36:25,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:25,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:36:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:36:25,079 INFO L87 Difference]: Start difference. First operand 5360 states and 6462 transitions. Second operand 13 states.