/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_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:16:01,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:16:01,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:16:01,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:16:01,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:16:01,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:16:01,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:16:01,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:16:01,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:16:01,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:16:01,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:16:01,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:16:01,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:16:01,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:16:01,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:16:01,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:16:02,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:16:02,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:16:02,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:16:02,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:16:02,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:16:02,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:16:02,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:16:02,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:16:02,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:16:02,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:16:02,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:16:02,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:16:02,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:16:02,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:16:02,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:16:02,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:16:02,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:16:02,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:16:02,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:16:02,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:16:02,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:16:02,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:16:02,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:16:02,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:16:02,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:16:02,048 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:16:02,105 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:16:02,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:16:02,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:16:02,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:16:02,112 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:16:02,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:16:02,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:16:02,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:16:02,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:16:02,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:16:02,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:16:02,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:16:02,116 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:16:02,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:16:02,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:16:02,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:16:02,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:16:02,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:16:02,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:16:02,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:16:02,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:16:02,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:16:02,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:16:02,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:16:02,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:16:02,120 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:16:02,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:16:02,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:16:02,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:16:02,601 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:16:02,602 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:16:02,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:16:02,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44ed7df0d/f57552d81cb2411c9ee878da922e1884/FLAGcdec0556a [2021-01-06 21:16:03,471 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:16:03,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:16:03,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44ed7df0d/f57552d81cb2411c9ee878da922e1884/FLAGcdec0556a [2021-01-06 21:16:03,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/44ed7df0d/f57552d81cb2411c9ee878da922e1884 [2021-01-06 21:16:03,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:16:03,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:16:03,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:16:03,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:16:03,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:16:03,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:16:03" (1/1) ... [2021-01-06 21:16:03,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12809b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:03, skipping insertion in model container [2021-01-06 21:16:03,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:16:03" (1/1) ... [2021-01-06 21:16:03,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:16:03,881 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60836~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~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[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61007~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:16:04,211 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_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8236,8249] 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[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_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_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_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_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_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_0~0,] [2021-01-06 21:16:04,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:16:04,287 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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_60836~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~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[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~node8__m8~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_61007~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:16:04,391 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_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[8236,8249] 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[~st8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p8_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node8____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_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_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_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_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_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_0~0,] [2021-01-06 21:16:04,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:16:04,495 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:16:04,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04 WrapperNode [2021-01-06 21:16:04,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:16:04,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:16:04,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:16:04,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:16:04,509 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:16:04" (1/1) ... [2021-01-06 21:16:04,525 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:16:04" (1/1) ... [2021-01-06 21:16:04,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:16:04,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:16:04,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:16:04,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:16:04,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (1/1) ... [2021-01-06 21:16:04,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:16:04,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:16:04,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:16:04,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:16:04,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (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:16:04,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:16:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:16:04,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:16:04,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:16:05,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:16:05,856 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:16:05,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:16:05 BoogieIcfgContainer [2021-01-06 21:16:05,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:16:05,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:16:05,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:16:05,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:16:05,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:16:03" (1/3) ... [2021-01-06 21:16:05,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23caf24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:16:05, skipping insertion in model container [2021-01-06 21:16:05,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:16:04" (2/3) ... [2021-01-06 21:16:05,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23caf24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:16:05, skipping insertion in model container [2021-01-06 21:16:05,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:16:05" (3/3) ... [2021-01-06 21:16:05,869 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:16:05,877 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:16:05,883 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:16:05,904 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:16:05,934 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:16:05,934 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:16:05,934 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:16:05,935 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:16:05,935 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:16:05,935 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:16:05,935 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:16:05,935 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:16:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2021-01-06 21:16:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 21:16:05,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:05,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:05,972 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 521817496, now seen corresponding path program 1 times [2021-01-06 21:16:05,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:05,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849338923] [2021-01-06 21:16:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:16:06,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849338923] [2021-01-06 21:16:06,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:06,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:06,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038722670] [2021-01-06 21:16:06,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:06,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:06,583 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2021-01-06 21:16:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:06,685 INFO L93 Difference]: Finished difference Result 341 states and 560 transitions. [2021-01-06 21:16:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:06,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2021-01-06 21:16:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:06,705 INFO L225 Difference]: With dead ends: 341 [2021-01-06 21:16:06,705 INFO L226 Difference]: Without dead ends: 240 [2021-01-06 21:16:06,710 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:16:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-01-06 21:16:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2021-01-06 21:16:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2021-01-06 21:16:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 341 transitions. [2021-01-06 21:16:06,811 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 341 transitions. Word has length 102 [2021-01-06 21:16:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:06,812 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 341 transitions. [2021-01-06 21:16:06,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:06,813 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 341 transitions. [2021-01-06 21:16:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 21:16:06,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:06,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:06,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:16:06,828 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1097817700, now seen corresponding path program 1 times [2021-01-06 21:16:06,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:06,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630646499] [2021-01-06 21:16:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:07,181 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:16:07,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630646499] [2021-01-06 21:16:07,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:07,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:07,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191688117] [2021-01-06 21:16:07,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:07,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:07,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:07,188 INFO L87 Difference]: Start difference. First operand 238 states and 341 transitions. Second operand 3 states. [2021-01-06 21:16:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:07,302 INFO L93 Difference]: Finished difference Result 570 states and 869 transitions. [2021-01-06 21:16:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:07,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2021-01-06 21:16:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:07,311 INFO L225 Difference]: With dead ends: 570 [2021-01-06 21:16:07,311 INFO L226 Difference]: Without dead ends: 396 [2021-01-06 21:16:07,318 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:16:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-01-06 21:16:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2021-01-06 21:16:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2021-01-06 21:16:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 589 transitions. [2021-01-06 21:16:07,396 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 589 transitions. Word has length 103 [2021-01-06 21:16:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:07,397 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 589 transitions. [2021-01-06 21:16:07,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 589 transitions. [2021-01-06 21:16:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 21:16:07,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:07,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:07,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:16:07,401 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash 186284590, now seen corresponding path program 1 times [2021-01-06 21:16:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:07,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977276569] [2021-01-06 21:16:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:07,624 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:16:07,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977276569] [2021-01-06 21:16:07,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:07,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:07,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025483294] [2021-01-06 21:16:07,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:07,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:07,627 INFO L87 Difference]: Start difference. First operand 394 states and 589 transitions. Second operand 3 states. [2021-01-06 21:16:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:07,685 INFO L93 Difference]: Finished difference Result 1022 states and 1587 transitions. [2021-01-06 21:16:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:07,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-06 21:16:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:07,691 INFO L225 Difference]: With dead ends: 1022 [2021-01-06 21:16:07,692 INFO L226 Difference]: Without dead ends: 692 [2021-01-06 21:16:07,694 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:16:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-01-06 21:16:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2021-01-06 21:16:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2021-01-06 21:16:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1057 transitions. [2021-01-06 21:16:07,748 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1057 transitions. Word has length 104 [2021-01-06 21:16:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:07,749 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 1057 transitions. [2021-01-06 21:16:07,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1057 transitions. [2021-01-06 21:16:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 21:16:07,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:07,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:07,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:16:07,752 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1107025040, now seen corresponding path program 1 times [2021-01-06 21:16:07,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:07,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883423013] [2021-01-06 21:16:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:07,868 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:16:07,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883423013] [2021-01-06 21:16:07,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:07,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:07,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947566363] [2021-01-06 21:16:07,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:07,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:07,871 INFO L87 Difference]: Start difference. First operand 690 states and 1057 transitions. Second operand 3 states. [2021-01-06 21:16:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:07,969 INFO L93 Difference]: Finished difference Result 1878 states and 2939 transitions. [2021-01-06 21:16:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:07,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 21:16:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:07,984 INFO L225 Difference]: With dead ends: 1878 [2021-01-06 21:16:07,984 INFO L226 Difference]: Without dead ends: 1252 [2021-01-06 21:16:07,987 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:16:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2021-01-06 21:16:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2021-01-06 21:16:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2021-01-06 21:16:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1937 transitions. [2021-01-06 21:16:08,077 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1937 transitions. Word has length 105 [2021-01-06 21:16:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:08,078 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1937 transitions. [2021-01-06 21:16:08,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1937 transitions. [2021-01-06 21:16:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-06 21:16:08,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:08,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:16:08,084 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1750887068, now seen corresponding path program 1 times [2021-01-06 21:16:08,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:08,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217191981] [2021-01-06 21:16:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:08,197 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:16:08,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217191981] [2021-01-06 21:16:08,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:08,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:08,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969430035] [2021-01-06 21:16:08,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:08,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:08,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:08,200 INFO L87 Difference]: Start difference. First operand 1250 states and 1937 transitions. Second operand 3 states. [2021-01-06 21:16:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:08,334 INFO L93 Difference]: Finished difference Result 3494 states and 5475 transitions. [2021-01-06 21:16:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:08,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-06 21:16:08,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:08,348 INFO L225 Difference]: With dead ends: 3494 [2021-01-06 21:16:08,348 INFO L226 Difference]: Without dead ends: 2308 [2021-01-06 21:16:08,351 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:16:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2021-01-06 21:16:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2306. [2021-01-06 21:16:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2021-01-06 21:16:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3585 transitions. [2021-01-06 21:16:08,511 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3585 transitions. Word has length 106 [2021-01-06 21:16:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:08,512 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 3585 transitions. [2021-01-06 21:16:08,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3585 transitions. [2021-01-06 21:16:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 21:16:08,515 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:08,515 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:16:08,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash -67978193, now seen corresponding path program 1 times [2021-01-06 21:16:08,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:08,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191085956] [2021-01-06 21:16:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:08,639 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:16:08,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191085956] [2021-01-06 21:16:08,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:08,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:08,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22298832] [2021-01-06 21:16:08,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:08,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:08,645 INFO L87 Difference]: Start difference. First operand 2306 states and 3585 transitions. Second operand 3 states. [2021-01-06 21:16:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:08,939 INFO L93 Difference]: Finished difference Result 6534 states and 10211 transitions. [2021-01-06 21:16:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:08,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 21:16:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:08,962 INFO L225 Difference]: With dead ends: 6534 [2021-01-06 21:16:08,962 INFO L226 Difference]: Without dead ends: 4292 [2021-01-06 21:16:08,969 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:16:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2021-01-06 21:16:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 4290. [2021-01-06 21:16:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4290 states. [2021-01-06 21:16:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 6657 transitions. [2021-01-06 21:16:09,250 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 6657 transitions. Word has length 107 [2021-01-06 21:16:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:09,251 INFO L481 AbstractCegarLoop]: Abstraction has 4290 states and 6657 transitions. [2021-01-06 21:16:09,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 6657 transitions. [2021-01-06 21:16:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-01-06 21:16:09,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:09,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:09,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:16:09,254 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 827456551, now seen corresponding path program 1 times [2021-01-06 21:16:09,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:09,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509607748] [2021-01-06 21:16:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:09,395 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:16:09,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509607748] [2021-01-06 21:16:09,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:09,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:16:09,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927152528] [2021-01-06 21:16:09,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:16:09,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:16:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:16:09,400 INFO L87 Difference]: Start difference. First operand 4290 states and 6657 transitions. Second operand 3 states. [2021-01-06 21:16:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:09,835 INFO L93 Difference]: Finished difference Result 12230 states and 19011 transitions. [2021-01-06 21:16:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:16:09,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2021-01-06 21:16:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:09,882 INFO L225 Difference]: With dead ends: 12230 [2021-01-06 21:16:09,882 INFO L226 Difference]: Without dead ends: 8004 [2021-01-06 21:16:09,891 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:16:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8004 states. [2021-01-06 21:16:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8004 to 8002. [2021-01-06 21:16:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8002 states. [2021-01-06 21:16:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12353 transitions. [2021-01-06 21:16:10,409 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12353 transitions. Word has length 108 [2021-01-06 21:16:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:10,410 INFO L481 AbstractCegarLoop]: Abstraction has 8002 states and 12353 transitions. [2021-01-06 21:16:10,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:16:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12353 transitions. [2021-01-06 21:16:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:10,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:10,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:10,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:16:10,413 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1506711706, now seen corresponding path program 1 times [2021-01-06 21:16:10,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:10,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616494635] [2021-01-06 21:16:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:10,578 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:16:10,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616494635] [2021-01-06 21:16:10,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:10,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:10,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867387540] [2021-01-06 21:16:10,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:10,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:10,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:10,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:10,581 INFO L87 Difference]: Start difference. First operand 8002 states and 12353 transitions. Second operand 5 states. [2021-01-06 21:16:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:11,371 INFO L93 Difference]: Finished difference Result 15940 states and 24642 transitions. [2021-01-06 21:16:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:11,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 21:16:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:11,440 INFO L225 Difference]: With dead ends: 15940 [2021-01-06 21:16:11,440 INFO L226 Difference]: Without dead ends: 8002 [2021-01-06 21:16:11,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2021-01-06 21:16:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 8002. [2021-01-06 21:16:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8002 states. [2021-01-06 21:16:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12289 transitions. [2021-01-06 21:16:12,061 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12289 transitions. Word has length 109 [2021-01-06 21:16:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:12,062 INFO L481 AbstractCegarLoop]: Abstraction has 8002 states and 12289 transitions. [2021-01-06 21:16:12,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:12,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12289 transitions. [2021-01-06 21:16:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:12,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:12,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:12,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:16:12,065 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -232843701, now seen corresponding path program 1 times [2021-01-06 21:16:12,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:12,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498429893] [2021-01-06 21:16:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:12,198 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:16:12,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498429893] [2021-01-06 21:16:12,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:12,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:12,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264263814] [2021-01-06 21:16:12,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:12,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:12,207 INFO L87 Difference]: Start difference. First operand 8002 states and 12289 transitions. Second operand 5 states. [2021-01-06 21:16:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:12,984 INFO L93 Difference]: Finished difference Result 15940 states and 24514 transitions. [2021-01-06 21:16:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:12,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 21:16:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:13,004 INFO L225 Difference]: With dead ends: 15940 [2021-01-06 21:16:13,004 INFO L226 Difference]: Without dead ends: 8002 [2021-01-06 21:16:13,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2021-01-06 21:16:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 8002. [2021-01-06 21:16:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8002 states. [2021-01-06 21:16:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12225 transitions. [2021-01-06 21:16:13,616 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12225 transitions. Word has length 109 [2021-01-06 21:16:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:13,617 INFO L481 AbstractCegarLoop]: Abstraction has 8002 states and 12225 transitions. [2021-01-06 21:16:13,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12225 transitions. [2021-01-06 21:16:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:13,618 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:13,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:13,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:16:13,619 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1679873296, now seen corresponding path program 1 times [2021-01-06 21:16:13,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:13,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259869995] [2021-01-06 21:16:13,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:13,786 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:16:13,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259869995] [2021-01-06 21:16:13,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:13,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:13,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751574723] [2021-01-06 21:16:13,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:13,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:13,793 INFO L87 Difference]: Start difference. First operand 8002 states and 12225 transitions. Second operand 6 states. [2021-01-06 21:16:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:15,261 INFO L93 Difference]: Finished difference Result 23750 states and 36291 transitions. [2021-01-06 21:16:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:15,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2021-01-06 21:16:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:15,301 INFO L225 Difference]: With dead ends: 23750 [2021-01-06 21:16:15,302 INFO L226 Difference]: Without dead ends: 15812 [2021-01-06 21:16:15,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:16:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15812 states. [2021-01-06 21:16:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15812 to 15810. [2021-01-06 21:16:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15810 states. [2021-01-06 21:16:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15810 states to 15810 states and 24001 transitions. [2021-01-06 21:16:16,562 INFO L78 Accepts]: Start accepts. Automaton has 15810 states and 24001 transitions. Word has length 109 [2021-01-06 21:16:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:16,563 INFO L481 AbstractCegarLoop]: Abstraction has 15810 states and 24001 transitions. [2021-01-06 21:16:16,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 15810 states and 24001 transitions. [2021-01-06 21:16:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:16,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:16,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:16,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:16:16,565 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:16,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1783617045, now seen corresponding path program 1 times [2021-01-06 21:16:16,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:16,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790878932] [2021-01-06 21:16:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:16,740 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:16:16,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790878932] [2021-01-06 21:16:16,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:16,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:16,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765525433] [2021-01-06 21:16:16,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:16,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:16,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:16,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:16,744 INFO L87 Difference]: Start difference. First operand 15810 states and 24001 transitions. Second operand 6 states. [2021-01-06 21:16:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:19,064 INFO L93 Difference]: Finished difference Result 47174 states and 71619 transitions. [2021-01-06 21:16:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:19,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2021-01-06 21:16:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:19,144 INFO L225 Difference]: With dead ends: 47174 [2021-01-06 21:16:19,144 INFO L226 Difference]: Without dead ends: 31428 [2021-01-06 21:16:19,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:16:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31428 states. [2021-01-06 21:16:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31428 to 31426. [2021-01-06 21:16:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31426 states. [2021-01-06 21:16:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31426 states to 31426 states and 47553 transitions. [2021-01-06 21:16:21,052 INFO L78 Accepts]: Start accepts. Automaton has 31426 states and 47553 transitions. Word has length 109 [2021-01-06 21:16:21,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:21,053 INFO L481 AbstractCegarLoop]: Abstraction has 31426 states and 47553 transitions. [2021-01-06 21:16:21,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 31426 states and 47553 transitions. [2021-01-06 21:16:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:21,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:21,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:21,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:16:21,058 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:21,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1047278694, now seen corresponding path program 1 times [2021-01-06 21:16:21,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:21,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247737474] [2021-01-06 21:16:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:21,190 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:16:21,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247737474] [2021-01-06 21:16:21,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:21,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:16:21,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004045385] [2021-01-06 21:16:21,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:16:21,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:16:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:16:21,193 INFO L87 Difference]: Start difference. First operand 31426 states and 47553 transitions. Second operand 6 states. [2021-01-06 21:16:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:25,564 INFO L93 Difference]: Finished difference Result 93894 states and 142019 transitions. [2021-01-06 21:16:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:25,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2021-01-06 21:16:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:25,727 INFO L225 Difference]: With dead ends: 93894 [2021-01-06 21:16:25,727 INFO L226 Difference]: Without dead ends: 62532 [2021-01-06 21:16:25,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:16:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62532 states. [2021-01-06 21:16:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62532 to 62530. [2021-01-06 21:16:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62530 states. [2021-01-06 21:16:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62530 states to 62530 states and 94273 transitions. [2021-01-06 21:16:29,861 INFO L78 Accepts]: Start accepts. Automaton has 62530 states and 94273 transitions. Word has length 109 [2021-01-06 21:16:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:29,861 INFO L481 AbstractCegarLoop]: Abstraction has 62530 states and 94273 transitions. [2021-01-06 21:16:29,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:16:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62530 states and 94273 transitions. [2021-01-06 21:16:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:29,862 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:29,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:29,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:16:29,862 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash -794751839, now seen corresponding path program 1 times [2021-01-06 21:16:29,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:29,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744876511] [2021-01-06 21:16:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:29,959 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:16:29,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744876511] [2021-01-06 21:16:29,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:29,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:16:29,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137189834] [2021-01-06 21:16:29,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:16:29,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:29,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:16:29,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:16:29,961 INFO L87 Difference]: Start difference. First operand 62530 states and 94273 transitions. Second operand 5 states. [2021-01-06 21:16:30,142 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2021-01-06 21:16:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:34,170 INFO L93 Difference]: Finished difference Result 124996 states and 188482 transitions. [2021-01-06 21:16:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:16:34,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 21:16:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:34,312 INFO L225 Difference]: With dead ends: 124996 [2021-01-06 21:16:34,312 INFO L226 Difference]: Without dead ends: 62530 [2021-01-06 21:16:34,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 21:16:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62530 states. [2021-01-06 21:16:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62530 to 62530. [2021-01-06 21:16:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62530 states. [2021-01-06 21:16:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62530 states to 62530 states and 93761 transitions. [2021-01-06 21:16:38,743 INFO L78 Accepts]: Start accepts. Automaton has 62530 states and 93761 transitions. Word has length 109 [2021-01-06 21:16:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:38,743 INFO L481 AbstractCegarLoop]: Abstraction has 62530 states and 93761 transitions. [2021-01-06 21:16:38,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:16:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 62530 states and 93761 transitions. [2021-01-06 21:16:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:16:38,755 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:38,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:38,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:16:38,757 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash 926579036, now seen corresponding path program 1 times [2021-01-06 21:16:38,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:38,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356723697] [2021-01-06 21:16:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:39,044 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:16:39,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356723697] [2021-01-06 21:16:39,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:39,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 21:16:39,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587517225] [2021-01-06 21:16:39,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:16:39,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:16:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:16:39,047 INFO L87 Difference]: Start difference. First operand 62530 states and 93761 transitions. Second operand 10 states. [2021-01-06 21:17:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:17:49,505 INFO L93 Difference]: Finished difference Result 999520 states and 1499216 transitions. [2021-01-06 21:17:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 21:17:49,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2021-01-06 21:17:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:17:51,798 INFO L225 Difference]: With dead ends: 999520 [2021-01-06 21:17:51,798 INFO L226 Difference]: Without dead ends: 937054 [2021-01-06 21:17:52,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:17:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937054 states. [2021-01-06 21:18:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937054 to 124994. [2021-01-06 21:18:15,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124994 states. [2021-01-06 21:18:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124994 states to 124994 states and 185409 transitions. [2021-01-06 21:18:15,742 INFO L78 Accepts]: Start accepts. Automaton has 124994 states and 185409 transitions. Word has length 109 [2021-01-06 21:18:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:18:15,743 INFO L481 AbstractCegarLoop]: Abstraction has 124994 states and 185409 transitions. [2021-01-06 21:18:15,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:18:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 124994 states and 185409 transitions. [2021-01-06 21:18:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 21:18:15,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:18:15,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:18:15,745 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:18:15,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:18:15,745 INFO L82 PathProgramCache]: Analyzing trace with hash 462406616, now seen corresponding path program 1 times [2021-01-06 21:18:15,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:18:15,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180073579] [2021-01-06 21:18:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:18:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:18:15,845 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:18:15,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180073579] [2021-01-06 21:18:15,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:18:15,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:18:15,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621764532] [2021-01-06 21:18:15,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:18:15,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:18:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:18:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:18:15,848 INFO L87 Difference]: Start difference. First operand 124994 states and 185409 transitions. Second operand 3 states. [2021-01-06 21:18:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:18:37,867 INFO L93 Difference]: Finished difference Result 307270 states and 454211 transitions. [2021-01-06 21:18:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:18:37,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2021-01-06 21:18:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:18:38,178 INFO L225 Difference]: With dead ends: 307270 [2021-01-06 21:18:38,178 INFO L226 Difference]: Without dead ends: 182340 [2021-01-06 21:18:38,286 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:18:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182340 states.