/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-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:19:11,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:19:11,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:19:11,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:19:11,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:19:11,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:19:11,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:19:11,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:19:11,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:19:11,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:19:11,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:19:11,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:19:11,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:19:11,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:19:11,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:19:11,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:19:11,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:19:11,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:19:11,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:19:11,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:19:11,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:19:11,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:19:11,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:19:11,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:19:11,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:19:11,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:19:11,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:19:11,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:19:11,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:19:11,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:19:11,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:19:11,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:19:11,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:19:11,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:19:11,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:19:11,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:19:11,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:19:11,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:19:11,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:19:11,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:19:11,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:19:11,554 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 21:19:11,605 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:19:11,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:19:11,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:19:11,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:19:11,610 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:19:11,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:19:11,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:19:11,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:19:11,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:19:11,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:19:11,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:19:11,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:19:11,613 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:19:11,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:19:11,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:19:11,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:19:11,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:19:11,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:19:11,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:19:11,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:19:11,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:19:11,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:19:11,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:19:11,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:19:11,616 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:19:11,616 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 21:19:12,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:19:12,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:19:12,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:19:12,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:19:12,084 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:19:12,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:19:12,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dcd0fda80/dc0ab7f611a9436b949254708191f7a9/FLAGe2ab74224 [2021-01-06 21:19:12,838 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:19:12,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:19:12,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dcd0fda80/dc0ab7f611a9436b949254708191f7a9/FLAGe2ab74224 [2021-01-06 21:19:13,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/dcd0fda80/dc0ab7f611a9436b949254708191f7a9 [2021-01-06 21:19:13,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:19:13,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:19:13,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:13,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:19:13,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:19:13,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2940b3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13, skipping insertion in model container [2021-01-06 21:19:13,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:19:13,281 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1945~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2094~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:19:13,647 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-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7516,7529] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:13,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:13,753 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__r121~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r131~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r211~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r231~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r311~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r321~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r122~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r132~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r212~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r232~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r312~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__r322~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_1945~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_2094~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:19:13,814 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-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7516,7529] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] [2021-01-06 21:19:13,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:19:13,870 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:19:13,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13 WrapperNode [2021-01-06 21:19:13,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:19:13,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:13,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:19:13,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:19:13,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:19:13,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:19:13,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:19:13,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:19:13,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:13,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:14,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:14,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (1/1) ... [2021-01-06 21:19:14,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:19:14,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:19:14,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:19:14,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:19:14,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (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 21:19:14,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:19:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:19:14,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:19:14,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:19:15,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:19:15,145 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:19:15,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:15 BoogieIcfgContainer [2021-01-06 21:19:15,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:19:15,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:19:15,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:19:15,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:19:15,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:19:13" (1/3) ... [2021-01-06 21:19:15,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba9fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:15, skipping insertion in model container [2021-01-06 21:19:15,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:19:13" (2/3) ... [2021-01-06 21:19:15,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eba9fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:19:15, skipping insertion in model container [2021-01-06 21:19:15,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:19:15" (3/3) ... [2021-01-06 21:19:15,158 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:19:15,168 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:19:15,175 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:19:15,198 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:19:15,230 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:19:15,230 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:19:15,230 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:19:15,230 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:19:15,231 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:19:15,231 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:19:15,231 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:19:15,231 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:19:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2021-01-06 21:19:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 21:19:15,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:15,267 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 21:19:15,268 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1975649421, now seen corresponding path program 1 times [2021-01-06 21:19:15,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:15,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010651361] [2021-01-06 21:19:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:15,755 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 21:19:15,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010651361] [2021-01-06 21:19:15,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:15,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:15,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146650510] [2021-01-06 21:19:15,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:15,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:15,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:15,788 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 3 states. [2021-01-06 21:19:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:16,017 INFO L93 Difference]: Finished difference Result 341 states and 571 transitions. [2021-01-06 21:19:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:16,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 21:19:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:16,043 INFO L225 Difference]: With dead ends: 341 [2021-01-06 21:19:16,044 INFO L226 Difference]: Without dead ends: 237 [2021-01-06 21:19:16,048 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 21:19:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-06 21:19:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2021-01-06 21:19:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 21:19:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2021-01-06 21:19:16,152 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 62 [2021-01-06 21:19:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:16,152 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2021-01-06 21:19:16,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2021-01-06 21:19:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 21:19:16,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:16,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:16,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:19:16,157 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1826541876, now seen corresponding path program 1 times [2021-01-06 21:19:16,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:16,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993196937] [2021-01-06 21:19:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:16,369 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 21:19:16,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993196937] [2021-01-06 21:19:16,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:16,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:16,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084249837] [2021-01-06 21:19:16,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:16,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:16,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:16,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:16,376 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand 3 states. [2021-01-06 21:19:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:16,432 INFO L93 Difference]: Finished difference Result 572 states and 917 transitions. [2021-01-06 21:19:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:16,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 21:19:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:16,436 INFO L225 Difference]: With dead ends: 572 [2021-01-06 21:19:16,436 INFO L226 Difference]: Without dead ends: 395 [2021-01-06 21:19:16,438 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 21:19:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-01-06 21:19:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2021-01-06 21:19:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2021-01-06 21:19:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2021-01-06 21:19:16,478 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 64 [2021-01-06 21:19:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:16,479 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2021-01-06 21:19:16,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2021-01-06 21:19:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 21:19:16,483 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:16,483 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 21:19:16,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:19:16,483 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1385775307, now seen corresponding path program 1 times [2021-01-06 21:19:16,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:16,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871527330] [2021-01-06 21:19:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:16,649 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 21:19:16,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871527330] [2021-01-06 21:19:16,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:16,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:16,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814421928] [2021-01-06 21:19:16,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:16,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:16,653 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 3 states. [2021-01-06 21:19:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:16,750 INFO L93 Difference]: Finished difference Result 1027 states and 1654 transitions. [2021-01-06 21:19:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:16,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 21:19:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:16,758 INFO L225 Difference]: With dead ends: 1027 [2021-01-06 21:19:16,759 INFO L226 Difference]: Without dead ends: 693 [2021-01-06 21:19:16,767 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 21:19:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-01-06 21:19:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2021-01-06 21:19:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-01-06 21:19:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1096 transitions. [2021-01-06 21:19:16,863 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1096 transitions. Word has length 66 [2021-01-06 21:19:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:16,869 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 1096 transitions. [2021-01-06 21:19:16,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1096 transitions. [2021-01-06 21:19:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 21:19:16,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:16,880 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] [2021-01-06 21:19:16,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:19:16,881 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash -190660810, now seen corresponding path program 1 times [2021-01-06 21:19:16,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:16,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217409222] [2021-01-06 21:19:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:17,145 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 21:19:17,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217409222] [2021-01-06 21:19:17,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:17,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:19:17,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540196894] [2021-01-06 21:19:17,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:19:17,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:19:17,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:19:17,149 INFO L87 Difference]: Start difference. First operand 687 states and 1096 transitions. Second operand 5 states. [2021-01-06 21:19:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:17,429 INFO L93 Difference]: Finished difference Result 2979 states and 4854 transitions. [2021-01-06 21:19:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 21:19:17,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2021-01-06 21:19:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:17,446 INFO L225 Difference]: With dead ends: 2979 [2021-01-06 21:19:17,447 INFO L226 Difference]: Without dead ends: 2349 [2021-01-06 21:19:17,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:19:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-01-06 21:19:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1239. [2021-01-06 21:19:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2021-01-06 21:19:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1991 transitions. [2021-01-06 21:19:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1991 transitions. Word has length 68 [2021-01-06 21:19:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:17,546 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1991 transitions. [2021-01-06 21:19:17,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:19:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1991 transitions. [2021-01-06 21:19:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 21:19:17,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:17,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:19:17,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:19:17,549 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1678021987, now seen corresponding path program 1 times [2021-01-06 21:19:17,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:17,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232108517] [2021-01-06 21:19:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:17,672 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 21:19:17,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232108517] [2021-01-06 21:19:17,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:17,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:17,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552898255] [2021-01-06 21:19:17,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:17,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:17,675 INFO L87 Difference]: Start difference. First operand 1239 states and 1991 transitions. Second operand 4 states. [2021-01-06 21:19:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:17,872 INFO L93 Difference]: Finished difference Result 3619 states and 5887 transitions. [2021-01-06 21:19:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:17,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 21:19:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:17,886 INFO L225 Difference]: With dead ends: 3619 [2021-01-06 21:19:17,887 INFO L226 Difference]: Without dead ends: 2437 [2021-01-06 21:19:17,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:19:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-01-06 21:19:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1829. [2021-01-06 21:19:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2021-01-06 21:19:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2952 transitions. [2021-01-06 21:19:18,021 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2952 transitions. Word has length 69 [2021-01-06 21:19:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:18,021 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 2952 transitions. [2021-01-06 21:19:18,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2952 transitions. [2021-01-06 21:19:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 21:19:18,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:18,024 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] [2021-01-06 21:19:18,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:19:18,024 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -537020195, now seen corresponding path program 1 times [2021-01-06 21:19:18,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:18,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638963511] [2021-01-06 21:19:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:18,145 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 21:19:18,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638963511] [2021-01-06 21:19:18,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:18,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:18,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427851504] [2021-01-06 21:19:18,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:18,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:18,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:18,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:18,150 INFO L87 Difference]: Start difference. First operand 1829 states and 2952 transitions. Second operand 4 states. [2021-01-06 21:19:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:18,454 INFO L93 Difference]: Finished difference Result 5465 states and 8877 transitions. [2021-01-06 21:19:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:18,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 21:19:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:18,476 INFO L225 Difference]: With dead ends: 5465 [2021-01-06 21:19:18,476 INFO L226 Difference]: Without dead ends: 3693 [2021-01-06 21:19:18,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:19:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2021-01-06 21:19:18,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 2673. [2021-01-06 21:19:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2021-01-06 21:19:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4312 transitions. [2021-01-06 21:19:18,709 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4312 transitions. Word has length 70 [2021-01-06 21:19:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:18,710 INFO L481 AbstractCegarLoop]: Abstraction has 2673 states and 4312 transitions. [2021-01-06 21:19:18,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4312 transitions. [2021-01-06 21:19:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 21:19:18,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:18,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:18,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:19:18,713 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:18,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 478855012, now seen corresponding path program 1 times [2021-01-06 21:19:18,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:18,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735183773] [2021-01-06 21:19:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:18,802 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 21:19:18,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735183773] [2021-01-06 21:19:18,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:18,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:18,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340012110] [2021-01-06 21:19:18,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:18,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:18,817 INFO L87 Difference]: Start difference. First operand 2673 states and 4312 transitions. Second operand 4 states. [2021-01-06 21:19:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:19,250 INFO L93 Difference]: Finished difference Result 7713 states and 12507 transitions. [2021-01-06 21:19:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:19,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 21:19:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:19,281 INFO L225 Difference]: With dead ends: 7713 [2021-01-06 21:19:19,281 INFO L226 Difference]: Without dead ends: 5097 [2021-01-06 21:19:19,289 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 21:19:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2021-01-06 21:19:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 3869. [2021-01-06 21:19:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3869 states. [2021-01-06 21:19:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 6234 transitions. [2021-01-06 21:19:19,674 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 6234 transitions. Word has length 71 [2021-01-06 21:19:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:19,674 INFO L481 AbstractCegarLoop]: Abstraction has 3869 states and 6234 transitions. [2021-01-06 21:19:19,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 6234 transitions. [2021-01-06 21:19:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:19:19,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:19,678 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] [2021-01-06 21:19:19,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:19:19,678 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash -32382329, now seen corresponding path program 1 times [2021-01-06 21:19:19,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:19,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847415227] [2021-01-06 21:19:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:19,745 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 21:19:19,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847415227] [2021-01-06 21:19:19,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:19,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:19,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146986670] [2021-01-06 21:19:19,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:19,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:19,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:19,748 INFO L87 Difference]: Start difference. First operand 3869 states and 6234 transitions. Second operand 3 states. [2021-01-06 21:19:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:20,153 INFO L93 Difference]: Finished difference Result 8646 states and 14040 transitions. [2021-01-06 21:19:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:20,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:19:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:20,184 INFO L225 Difference]: With dead ends: 8646 [2021-01-06 21:19:20,185 INFO L226 Difference]: Without dead ends: 5881 [2021-01-06 21:19:20,192 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 21:19:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2021-01-06 21:19:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5879. [2021-01-06 21:19:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5879 states. [2021-01-06 21:19:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 9478 transitions. [2021-01-06 21:19:20,609 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 9478 transitions. Word has length 72 [2021-01-06 21:19:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:20,609 INFO L481 AbstractCegarLoop]: Abstraction has 5879 states and 9478 transitions. [2021-01-06 21:19:20,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 9478 transitions. [2021-01-06 21:19:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:19:20,611 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:20,611 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] [2021-01-06 21:19:20,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:19:20,611 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1419254461, now seen corresponding path program 1 times [2021-01-06 21:19:20,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:20,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394334115] [2021-01-06 21:19:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:19:20,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394334115] [2021-01-06 21:19:20,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:20,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:20,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388637013] [2021-01-06 21:19:20,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:20,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:20,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:20,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:20,689 INFO L87 Difference]: Start difference. First operand 5879 states and 9478 transitions. Second operand 3 states. [2021-01-06 21:19:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:21,322 INFO L93 Difference]: Finished difference Result 12993 states and 20995 transitions. [2021-01-06 21:19:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:21,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:19:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:21,376 INFO L225 Difference]: With dead ends: 12993 [2021-01-06 21:19:21,377 INFO L226 Difference]: Without dead ends: 8823 [2021-01-06 21:19:21,386 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 21:19:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2021-01-06 21:19:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8821. [2021-01-06 21:19:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2021-01-06 21:19:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 14158 transitions. [2021-01-06 21:19:22,009 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 14158 transitions. Word has length 72 [2021-01-06 21:19:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:22,009 INFO L481 AbstractCegarLoop]: Abstraction has 8821 states and 14158 transitions. [2021-01-06 21:19:22,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 14158 transitions. [2021-01-06 21:19:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 21:19:22,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:22,011 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] [2021-01-06 21:19:22,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:19:22,012 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash 569279253, now seen corresponding path program 1 times [2021-01-06 21:19:22,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:22,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309328745] [2021-01-06 21:19:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:22,119 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 21:19:22,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309328745] [2021-01-06 21:19:22,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:22,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:22,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703532367] [2021-01-06 21:19:22,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:22,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:22,122 INFO L87 Difference]: Start difference. First operand 8821 states and 14158 transitions. Second operand 3 states. [2021-01-06 21:19:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:22,825 INFO L93 Difference]: Finished difference Result 19170 states and 30844 transitions. [2021-01-06 21:19:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:22,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 21:19:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:22,859 INFO L225 Difference]: With dead ends: 19170 [2021-01-06 21:19:22,859 INFO L226 Difference]: Without dead ends: 12906 [2021-01-06 21:19:22,872 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 21:19:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2021-01-06 21:19:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2021-01-06 21:19:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12904 states. [2021-01-06 21:19:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20605 transitions. [2021-01-06 21:19:23,760 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20605 transitions. Word has length 72 [2021-01-06 21:19:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:23,761 INFO L481 AbstractCegarLoop]: Abstraction has 12904 states and 20605 transitions. [2021-01-06 21:19:23,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20605 transitions. [2021-01-06 21:19:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 21:19:23,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:23,762 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 21:19:23,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:19:23,763 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -899144939, now seen corresponding path program 1 times [2021-01-06 21:19:23,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:23,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863961990] [2021-01-06 21:19:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:23,886 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 21:19:23,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863961990] [2021-01-06 21:19:23,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:23,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:19:23,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783442970] [2021-01-06 21:19:23,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:19:23,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:19:23,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:19:23,890 INFO L87 Difference]: Start difference. First operand 12904 states and 20605 transitions. Second operand 4 states. [2021-01-06 21:19:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:25,346 INFO L93 Difference]: Finished difference Result 37941 states and 60544 transitions. [2021-01-06 21:19:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:25,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 21:19:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:25,421 INFO L225 Difference]: With dead ends: 37941 [2021-01-06 21:19:25,422 INFO L226 Difference]: Without dead ends: 25046 [2021-01-06 21:19:25,444 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 21:19:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25046 states. [2021-01-06 21:19:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25046 to 25044. [2021-01-06 21:19:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25044 states. [2021-01-06 21:19:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25044 states to 25044 states and 39727 transitions. [2021-01-06 21:19:26,948 INFO L78 Accepts]: Start accepts. Automaton has 25044 states and 39727 transitions. Word has length 73 [2021-01-06 21:19:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:26,949 INFO L481 AbstractCegarLoop]: Abstraction has 25044 states and 39727 transitions. [2021-01-06 21:19:26,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:19:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 25044 states and 39727 transitions. [2021-01-06 21:19:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:19:26,950 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:26,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:26,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:19:26,951 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:26,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:26,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1735035679, now seen corresponding path program 1 times [2021-01-06 21:19:26,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:26,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405071177] [2021-01-06 21:19:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:26,992 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 21:19:26,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405071177] [2021-01-06 21:19:26,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:26,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:26,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595535265] [2021-01-06 21:19:26,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:26,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:26,995 INFO L87 Difference]: Start difference. First operand 25044 states and 39727 transitions. Second operand 3 states. [2021-01-06 21:19:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:29,159 INFO L93 Difference]: Finished difference Result 75094 states and 119119 transitions. [2021-01-06 21:19:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:29,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:19:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:29,379 INFO L225 Difference]: With dead ends: 75094 [2021-01-06 21:19:29,380 INFO L226 Difference]: Without dead ends: 50078 [2021-01-06 21:19:29,426 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 21:19:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50078 states. [2021-01-06 21:19:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50078 to 25046. [2021-01-06 21:19:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25046 states. [2021-01-06 21:19:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25046 states to 25046 states and 39729 transitions. [2021-01-06 21:19:31,652 INFO L78 Accepts]: Start accepts. Automaton has 25046 states and 39729 transitions. Word has length 74 [2021-01-06 21:19:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:31,652 INFO L481 AbstractCegarLoop]: Abstraction has 25046 states and 39729 transitions. [2021-01-06 21:19:31,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25046 states and 39729 transitions. [2021-01-06 21:19:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:19:31,653 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:31,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:31,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:19:31,654 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:31,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1282212699, now seen corresponding path program 1 times [2021-01-06 21:19:31,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:31,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371748077] [2021-01-06 21:19:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:31,702 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 21:19:31,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371748077] [2021-01-06 21:19:31,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:31,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:31,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152660722] [2021-01-06 21:19:31,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:31,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:31,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:31,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:31,704 INFO L87 Difference]: Start difference. First operand 25046 states and 39729 transitions. Second operand 3 states. [2021-01-06 21:19:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:33,883 INFO L93 Difference]: Finished difference Result 60529 states and 96542 transitions. [2021-01-06 21:19:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:33,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:19:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:33,967 INFO L225 Difference]: With dead ends: 60529 [2021-01-06 21:19:33,967 INFO L226 Difference]: Without dead ends: 35612 [2021-01-06 21:19:34,005 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 21:19:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35612 states. [2021-01-06 21:19:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35612 to 34336. [2021-01-06 21:19:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34336 states. [2021-01-06 21:19:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34336 states to 34336 states and 54396 transitions. [2021-01-06 21:19:36,113 INFO L78 Accepts]: Start accepts. Automaton has 34336 states and 54396 transitions. Word has length 74 [2021-01-06 21:19:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:36,113 INFO L481 AbstractCegarLoop]: Abstraction has 34336 states and 54396 transitions. [2021-01-06 21:19:36,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34336 states and 54396 transitions. [2021-01-06 21:19:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:19:36,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:36,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, 1, 1] [2021-01-06 21:19:36,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:19:36,115 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1471377814, now seen corresponding path program 1 times [2021-01-06 21:19:36,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:36,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712366436] [2021-01-06 21:19:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:36,203 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 21:19:36,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712366436] [2021-01-06 21:19:36,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:36,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:19:36,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141695513] [2021-01-06 21:19:36,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:19:36,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:36,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:19:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:19:36,206 INFO L87 Difference]: Start difference. First operand 34336 states and 54396 transitions. Second operand 3 states. [2021-01-06 21:19:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:40,523 INFO L93 Difference]: Finished difference Result 100709 states and 159458 transitions. [2021-01-06 21:19:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:19:40,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 21:19:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:40,644 INFO L225 Difference]: With dead ends: 100709 [2021-01-06 21:19:40,644 INFO L226 Difference]: Without dead ends: 66546 [2021-01-06 21:19:40,682 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 21:19:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66546 states. [2021-01-06 21:19:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66546 to 66544. [2021-01-06 21:19:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66544 states. [2021-01-06 21:19:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66544 states to 66544 states and 104661 transitions. [2021-01-06 21:19:45,009 INFO L78 Accepts]: Start accepts. Automaton has 66544 states and 104661 transitions. Word has length 75 [2021-01-06 21:19:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:19:45,010 INFO L481 AbstractCegarLoop]: Abstraction has 66544 states and 104661 transitions. [2021-01-06 21:19:45,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:19:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 66544 states and 104661 transitions. [2021-01-06 21:19:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:19:45,011 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:19:45,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:19:45,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:19:45,011 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:19:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:19:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash 20351833, now seen corresponding path program 1 times [2021-01-06 21:19:45,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:19:45,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509043218] [2021-01-06 21:19:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:19:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:19:45,142 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 21:19:45,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509043218] [2021-01-06 21:19:45,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:19:45,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:19:45,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385502447] [2021-01-06 21:19:45,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:19:45,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:19:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:19:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:19:45,144 INFO L87 Difference]: Start difference. First operand 66544 states and 104661 transitions. Second operand 5 states. [2021-01-06 21:19:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:19:52,233 INFO L93 Difference]: Finished difference Result 187298 states and 294406 transitions. [2021-01-06 21:19:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:19:52,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 21:19:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:19:52,534 INFO L225 Difference]: With dead ends: 187298 [2021-01-06 21:19:52,534 INFO L226 Difference]: Without dead ends: 120768 [2021-01-06 21:19:52,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:19:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120768 states. [2021-01-06 21:20:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120768 to 120766. [2021-01-06 21:20:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120766 states. [2021-01-06 21:20:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120766 states to 120766 states and 188351 transitions. [2021-01-06 21:20:00,452 INFO L78 Accepts]: Start accepts. Automaton has 120766 states and 188351 transitions. Word has length 75 [2021-01-06 21:20:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:00,452 INFO L481 AbstractCegarLoop]: Abstraction has 120766 states and 188351 transitions. [2021-01-06 21:20:00,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:20:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 120766 states and 188351 transitions. [2021-01-06 21:20:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:20:00,454 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:00,454 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:20:00,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:20:00,454 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:00,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:00,455 INFO L82 PathProgramCache]: Analyzing trace with hash -259692172, now seen corresponding path program 1 times [2021-01-06 21:20:00,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:00,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658310293] [2021-01-06 21:20:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:00,809 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 21:20:00,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658310293] [2021-01-06 21:20:00,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:00,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:20:00,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046501743] [2021-01-06 21:20:00,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 21:20:00,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 21:20:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 21:20:00,814 INFO L87 Difference]: Start difference. First operand 120766 states and 188351 transitions. Second operand 4 states. [2021-01-06 21:20:15,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:20:15,648 INFO L93 Difference]: Finished difference Result 354543 states and 552356 transitions. [2021-01-06 21:20:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 21:20:15,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 21:20:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:20:16,322 INFO L225 Difference]: With dead ends: 354543 [2021-01-06 21:20:16,322 INFO L226 Difference]: Without dead ends: 233833 [2021-01-06 21:20:16,460 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 21:20:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233833 states. [2021-01-06 21:20:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233833 to 233831. [2021-01-06 21:20:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233831 states. [2021-01-06 21:20:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233831 states to 233831 states and 361969 transitions. [2021-01-06 21:20:32,353 INFO L78 Accepts]: Start accepts. Automaton has 233831 states and 361969 transitions. Word has length 75 [2021-01-06 21:20:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:20:32,353 INFO L481 AbstractCegarLoop]: Abstraction has 233831 states and 361969 transitions. [2021-01-06 21:20:32,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 21:20:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 233831 states and 361969 transitions. [2021-01-06 21:20:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:20:32,356 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:20:32,357 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 21:20:32,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:20:32,357 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:20:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:20:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -805359648, now seen corresponding path program 1 times [2021-01-06 21:20:32,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:20:32,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920513891] [2021-01-06 21:20:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:20:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:20:32,397 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 21:20:32,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920513891] [2021-01-06 21:20:32,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:20:32,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:20:32,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609121017] [2021-01-06 21:20:32,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:20:32,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:20:32,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:20:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:20:32,400 INFO L87 Difference]: Start difference. First operand 233831 states and 361969 transitions. Second operand 3 states. [2021-01-06 21:21:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:21:02,224 INFO L93 Difference]: Finished difference Result 701341 states and 1085674 transitions. [2021-01-06 21:21:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:21:02,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 21:21:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:21:03,337 INFO L225 Difference]: With dead ends: 701341 [2021-01-06 21:21:03,337 INFO L226 Difference]: Without dead ends: 467601 [2021-01-06 21:21:03,913 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 21:21:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467601 states. [2021-01-06 21:21:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467601 to 233841. [2021-01-06 21:21:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233841 states. [2021-01-06 21:21:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233841 states to 233841 states and 361979 transitions. [2021-01-06 21:21:23,294 INFO L78 Accepts]: Start accepts. Automaton has 233841 states and 361979 transitions. Word has length 76 [2021-01-06 21:21:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:21:23,294 INFO L481 AbstractCegarLoop]: Abstraction has 233841 states and 361979 transitions. [2021-01-06 21:21:23,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:21:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 233841 states and 361979 transitions. [2021-01-06 21:21:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:21:23,297 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:21:23,297 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 21:21:23,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:21:23,298 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:21:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:21:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2070133608, now seen corresponding path program 1 times [2021-01-06 21:21:23,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:21:23,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495778621] [2021-01-06 21:21:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:21:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:21:23,342 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 21:21:23,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495778621] [2021-01-06 21:21:23,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:21:23,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:21:23,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902889702] [2021-01-06 21:21:23,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:21:23,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:21:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:21:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:21:23,344 INFO L87 Difference]: Start difference. First operand 233841 states and 361979 transitions. Second operand 3 states.