/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.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:12:24,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:12:24,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:12:24,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:12:24,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:12:24,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:12:24,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:12:24,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:12:24,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:12:24,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:12:24,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:12:24,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:12:24,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:12:24,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:12:24,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:12:24,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:12:24,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:12:24,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:12:24,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:12:24,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:12:24,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:12:24,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:12:24,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:12:24,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:12:24,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:12:24,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:12:24,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:12:24,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:12:24,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:12:24,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:12:24,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:12:24,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:12:24,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:12:24,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:12:24,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:12:24,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:12:24,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:12:24,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:12:24,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:12:24,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:12:24,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:12:24,821 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:12:24,869 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:12:24,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:12:24,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:12:24,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:12:24,875 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:12:24,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:12:24,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:12:24,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:12:24,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:12:24,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:12:24,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:12:24,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:12:24,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:12:24,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:12:24,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:12:24,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:12:24,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:12:24,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:12:24,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:12:24,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:12:24,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:12:24,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:12:24,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:12:24,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:12:24,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:12:24,880 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:12:25,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:12:25,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:12:25,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:12:25,306 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:12:25,307 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:12:25,308 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.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:12:25,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4c4573dd/f1cf5cd5130f4ee1a8a2d6b37a0e3151/FLAGf7779fbe0 [2021-01-06 21:12:26,152 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:12:26,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:12:26,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4c4573dd/f1cf5cd5130f4ee1a8a2d6b37a0e3151/FLAGf7779fbe0 [2021-01-06 21:12:26,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4c4573dd/f1cf5cd5130f4ee1a8a2d6b37a0e3151 [2021-01-06 21:12:26,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:12:26,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:12:26,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:12:26,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:12:26,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:12:26,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:12:26" (1/1) ... [2021-01-06 21:12:26,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e70e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:26, skipping insertion in model container [2021-01-06 21:12:26,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:12:26" (1/1) ... [2021-01-06 21:12:26,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:12:26,518 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28361~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[~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[~p7_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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28513~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:12:26,776 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.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7265,7278] 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[~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:12:26,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:12:26,853 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28361~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[~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[~p7_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[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_28513~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:12:26,941 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.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7265,7278] 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[~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:12:26,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:12:27,000 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:12:27,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27 WrapperNode [2021-01-06 21:12:27,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:12:27,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:12:27,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:12:27,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:12:27,013 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:12:27" (1/1) ... [2021-01-06 21:12:27,055 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:12:27" (1/1) ... [2021-01-06 21:12:27,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:12:27,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:12:27,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:12:27,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:12:27,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (1/1) ... [2021-01-06 21:12:27,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:12:27,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:12:27,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:12:27,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:12:27,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (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:12:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:12:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:12:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:12:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:12:28,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:12:28,416 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:12:28,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:12:28 BoogieIcfgContainer [2021-01-06 21:12:28,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:12:28,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:12:28,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:12:28,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:12:28,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:12:26" (1/3) ... [2021-01-06 21:12:28,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ff4751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:12:28, skipping insertion in model container [2021-01-06 21:12:28,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:12:27" (2/3) ... [2021-01-06 21:12:28,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ff4751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:12:28, skipping insertion in model container [2021-01-06 21:12:28,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:12:28" (3/3) ... [2021-01-06 21:12:28,429 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:12:28,436 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:12:28,442 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:12:28,463 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:12:28,493 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:12:28,494 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:12:28,494 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:12:28,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:12:28,494 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:12:28,494 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:12:28,494 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:12:28,495 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:12:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2021-01-06 21:12:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 21:12:28,526 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:28,527 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] [2021-01-06 21:12:28,527 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:28,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2006546999, now seen corresponding path program 1 times [2021-01-06 21:12:28,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:28,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560114613] [2021-01-06 21:12:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:29,085 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:12:29,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560114613] [2021-01-06 21:12:29,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:29,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:29,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813748332] [2021-01-06 21:12:29,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:29,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:29,111 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2021-01-06 21:12:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:29,191 INFO L93 Difference]: Finished difference Result 300 states and 490 transitions. [2021-01-06 21:12:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:29,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 21:12:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:29,225 INFO L225 Difference]: With dead ends: 300 [2021-01-06 21:12:29,225 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 21:12:29,230 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:12:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 21:12:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2021-01-06 21:12:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-06 21:12:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2021-01-06 21:12:29,314 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 87 [2021-01-06 21:12:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:29,315 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2021-01-06 21:12:29,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2021-01-06 21:12:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 21:12:29,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:29,319 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] [2021-01-06 21:12:29,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:12:29,320 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:29,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1559740613, now seen corresponding path program 1 times [2021-01-06 21:12:29,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:29,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923296447] [2021-01-06 21:12:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:29,550 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:12:29,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923296447] [2021-01-06 21:12:29,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:29,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:29,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923202862] [2021-01-06 21:12:29,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:29,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:29,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:29,555 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand 3 states. [2021-01-06 21:12:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:29,612 INFO L93 Difference]: Finished difference Result 499 states and 762 transitions. [2021-01-06 21:12:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:29,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 21:12:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:29,618 INFO L225 Difference]: With dead ends: 499 [2021-01-06 21:12:29,618 INFO L226 Difference]: Without dead ends: 345 [2021-01-06 21:12:29,623 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:12:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-01-06 21:12:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2021-01-06 21:12:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2021-01-06 21:12:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 514 transitions. [2021-01-06 21:12:29,702 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 514 transitions. Word has length 88 [2021-01-06 21:12:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:29,703 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 514 transitions. [2021-01-06 21:12:29,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 514 transitions. [2021-01-06 21:12:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 21:12:29,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:29,713 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] [2021-01-06 21:12:29,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:12:29,713 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1480148747, now seen corresponding path program 1 times [2021-01-06 21:12:29,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:29,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31292550] [2021-01-06 21:12:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:29,918 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:12:29,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31292550] [2021-01-06 21:12:29,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:29,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:29,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54169320] [2021-01-06 21:12:29,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:29,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:29,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:29,922 INFO L87 Difference]: Start difference. First operand 343 states and 514 transitions. Second operand 3 states. [2021-01-06 21:12:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:29,993 INFO L93 Difference]: Finished difference Result 891 states and 1384 transitions. [2021-01-06 21:12:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:29,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 21:12:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:30,007 INFO L225 Difference]: With dead ends: 891 [2021-01-06 21:12:30,007 INFO L226 Difference]: Without dead ends: 601 [2021-01-06 21:12:30,010 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:12:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-01-06 21:12:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2021-01-06 21:12:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2021-01-06 21:12:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2021-01-06 21:12:30,082 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 89 [2021-01-06 21:12:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:30,083 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2021-01-06 21:12:30,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2021-01-06 21:12:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 21:12:30,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:30,085 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] [2021-01-06 21:12:30,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:12:30,086 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1142089047, now seen corresponding path program 1 times [2021-01-06 21:12:30,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:30,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936608767] [2021-01-06 21:12:30,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:30,211 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:12:30,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936608767] [2021-01-06 21:12:30,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:30,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:30,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789176307] [2021-01-06 21:12:30,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:30,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:30,219 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand 3 states. [2021-01-06 21:12:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:30,359 INFO L93 Difference]: Finished difference Result 1627 states and 2544 transitions. [2021-01-06 21:12:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:30,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 21:12:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:30,371 INFO L225 Difference]: With dead ends: 1627 [2021-01-06 21:12:30,371 INFO L226 Difference]: Without dead ends: 1081 [2021-01-06 21:12:30,373 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:12:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2021-01-06 21:12:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2021-01-06 21:12:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2021-01-06 21:12:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1670 transitions. [2021-01-06 21:12:30,449 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1670 transitions. Word has length 90 [2021-01-06 21:12:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:30,450 INFO L481 AbstractCegarLoop]: Abstraction has 1079 states and 1670 transitions. [2021-01-06 21:12:30,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1670 transitions. [2021-01-06 21:12:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 21:12:30,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:30,458 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] [2021-01-06 21:12:30,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:12:30,458 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:30,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1309607801, now seen corresponding path program 1 times [2021-01-06 21:12:30,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:30,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757603854] [2021-01-06 21:12:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:30,613 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:12:30,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757603854] [2021-01-06 21:12:30,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:30,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:30,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101879440] [2021-01-06 21:12:30,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:30,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:30,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:30,618 INFO L87 Difference]: Start difference. First operand 1079 states and 1670 transitions. Second operand 3 states. [2021-01-06 21:12:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:30,765 INFO L93 Difference]: Finished difference Result 3003 states and 4696 transitions. [2021-01-06 21:12:30,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:30,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 21:12:30,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:30,777 INFO L225 Difference]: With dead ends: 3003 [2021-01-06 21:12:30,777 INFO L226 Difference]: Without dead ends: 1977 [2021-01-06 21:12:30,780 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:12:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2021-01-06 21:12:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2021-01-06 21:12:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2021-01-06 21:12:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3062 transitions. [2021-01-06 21:12:30,933 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3062 transitions. Word has length 91 [2021-01-06 21:12:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:30,933 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 3062 transitions. [2021-01-06 21:12:30,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3062 transitions. [2021-01-06 21:12:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 21:12:30,936 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:30,936 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] [2021-01-06 21:12:30,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:12:30,936 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:30,937 INFO L82 PathProgramCache]: Analyzing trace with hash 582949359, now seen corresponding path program 1 times [2021-01-06 21:12:30,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:30,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395503771] [2021-01-06 21:12:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:31,027 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:12:31,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395503771] [2021-01-06 21:12:31,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:31,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:12:31,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320293868] [2021-01-06 21:12:31,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:12:31,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:12:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:12:31,030 INFO L87 Difference]: Start difference. First operand 1975 states and 3062 transitions. Second operand 3 states. [2021-01-06 21:12:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:31,252 INFO L93 Difference]: Finished difference Result 5563 states and 8664 transitions. [2021-01-06 21:12:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:12:31,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 21:12:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:31,275 INFO L225 Difference]: With dead ends: 5563 [2021-01-06 21:12:31,275 INFO L226 Difference]: Without dead ends: 3641 [2021-01-06 21:12:31,281 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:12:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2021-01-06 21:12:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3639. [2021-01-06 21:12:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2021-01-06 21:12:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5622 transitions. [2021-01-06 21:12:31,574 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5622 transitions. Word has length 92 [2021-01-06 21:12:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:31,575 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 5622 transitions. [2021-01-06 21:12:31,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:12:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5622 transitions. [2021-01-06 21:12:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:31,577 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:31,577 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] [2021-01-06 21:12:31,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:12:31,577 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -496500112, now seen corresponding path program 1 times [2021-01-06 21:12:31,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:31,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830638808] [2021-01-06 21:12:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:31,762 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:12:31,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830638808] [2021-01-06 21:12:31,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:31,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:12:31,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108515008] [2021-01-06 21:12:31,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:12:31,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:12:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:12:31,768 INFO L87 Difference]: Start difference. First operand 3639 states and 5622 transitions. Second operand 5 states. [2021-01-06 21:12:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:32,471 INFO L93 Difference]: Finished difference Result 7225 states and 11191 transitions. [2021-01-06 21:12:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:32,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2021-01-06 21:12:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:32,499 INFO L225 Difference]: With dead ends: 7225 [2021-01-06 21:12:32,500 INFO L226 Difference]: Without dead ends: 3639 [2021-01-06 21:12:32,510 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:12:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2021-01-06 21:12:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2021-01-06 21:12:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2021-01-06 21:12:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5590 transitions. [2021-01-06 21:12:32,910 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5590 transitions. Word has length 93 [2021-01-06 21:12:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:32,910 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 5590 transitions. [2021-01-06 21:12:32,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:12:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5590 transitions. [2021-01-06 21:12:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:32,912 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:32,912 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] [2021-01-06 21:12:32,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:12:32,913 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1956436651, now seen corresponding path program 1 times [2021-01-06 21:12:32,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:32,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340607805] [2021-01-06 21:12:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:33,056 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:12:33,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340607805] [2021-01-06 21:12:33,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:33,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:33,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763241864] [2021-01-06 21:12:33,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:33,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:33,059 INFO L87 Difference]: Start difference. First operand 3639 states and 5590 transitions. Second operand 6 states. [2021-01-06 21:12:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:33,780 INFO L93 Difference]: Finished difference Result 10747 states and 16536 transitions. [2021-01-06 21:12:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:33,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:12:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:33,822 INFO L225 Difference]: With dead ends: 10747 [2021-01-06 21:12:33,822 INFO L226 Difference]: Without dead ends: 7161 [2021-01-06 21:12:33,831 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:12:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2021-01-06 21:12:34,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 7159. [2021-01-06 21:12:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7159 states. [2021-01-06 21:12:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7159 states to 7159 states and 10934 transitions. [2021-01-06 21:12:34,482 INFO L78 Accepts]: Start accepts. Automaton has 7159 states and 10934 transitions. Word has length 93 [2021-01-06 21:12:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:34,483 INFO L481 AbstractCegarLoop]: Abstraction has 7159 states and 10934 transitions. [2021-01-06 21:12:34,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7159 states and 10934 transitions. [2021-01-06 21:12:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:34,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:34,484 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] [2021-01-06 21:12:34,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:12:34,485 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash -803132720, now seen corresponding path program 1 times [2021-01-06 21:12:34,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:34,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757191938] [2021-01-06 21:12:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:34,611 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:12:34,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757191938] [2021-01-06 21:12:34,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:34,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:34,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259485646] [2021-01-06 21:12:34,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:34,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:34,624 INFO L87 Difference]: Start difference. First operand 7159 states and 10934 transitions. Second operand 6 states. [2021-01-06 21:12:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:35,757 INFO L93 Difference]: Finished difference Result 21307 states and 32568 transitions. [2021-01-06 21:12:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:35,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:12:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:35,948 INFO L225 Difference]: With dead ends: 21307 [2021-01-06 21:12:35,948 INFO L226 Difference]: Without dead ends: 14201 [2021-01-06 21:12:35,965 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:12:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14201 states. [2021-01-06 21:12:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14201 to 14199. [2021-01-06 21:12:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14199 states. [2021-01-06 21:12:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 21622 transitions. [2021-01-06 21:12:37,040 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 21622 transitions. Word has length 93 [2021-01-06 21:12:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:37,041 INFO L481 AbstractCegarLoop]: Abstraction has 14199 states and 21622 transitions. [2021-01-06 21:12:37,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 21622 transitions. [2021-01-06 21:12:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:37,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:37,042 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] [2021-01-06 21:12:37,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:12:37,042 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2027763019, now seen corresponding path program 1 times [2021-01-06 21:12:37,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:37,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135628034] [2021-01-06 21:12:37,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:37,251 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:12:37,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135628034] [2021-01-06 21:12:37,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:37,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:12:37,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010237180] [2021-01-06 21:12:37,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:12:37,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:12:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:12:37,257 INFO L87 Difference]: Start difference. First operand 14199 states and 21622 transitions. Second operand 6 states. [2021-01-06 21:12:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:39,155 INFO L93 Difference]: Finished difference Result 42363 states and 64504 transitions. [2021-01-06 21:12:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:39,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2021-01-06 21:12:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:39,222 INFO L225 Difference]: With dead ends: 42363 [2021-01-06 21:12:39,222 INFO L226 Difference]: Without dead ends: 28217 [2021-01-06 21:12:39,248 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:12:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28217 states. [2021-01-06 21:12:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28217 to 28215. [2021-01-06 21:12:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28215 states. [2021-01-06 21:12:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28215 states to 28215 states and 42806 transitions. [2021-01-06 21:12:41,138 INFO L78 Accepts]: Start accepts. Automaton has 28215 states and 42806 transitions. Word has length 93 [2021-01-06 21:12:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:41,139 INFO L481 AbstractCegarLoop]: Abstraction has 28215 states and 42806 transitions. [2021-01-06 21:12:41,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:12:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 28215 states and 42806 transitions. [2021-01-06 21:12:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:41,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:41,140 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] [2021-01-06 21:12:41,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:12:41,140 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:41,141 INFO L82 PathProgramCache]: Analyzing trace with hash -993336272, now seen corresponding path program 1 times [2021-01-06 21:12:41,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:41,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812090556] [2021-01-06 21:12:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:41,229 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:12:41,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812090556] [2021-01-06 21:12:41,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:41,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:12:41,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636778252] [2021-01-06 21:12:41,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:12:41,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:41,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:12:41,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:12:41,231 INFO L87 Difference]: Start difference. First operand 28215 states and 42806 transitions. Second operand 5 states. [2021-01-06 21:12:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:42,890 INFO L93 Difference]: Finished difference Result 56377 states and 85559 transitions. [2021-01-06 21:12:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:12:42,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2021-01-06 21:12:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:42,960 INFO L225 Difference]: With dead ends: 56377 [2021-01-06 21:12:42,960 INFO L226 Difference]: Without dead ends: 28215 [2021-01-06 21:12:42,998 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:12:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2021-01-06 21:12:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 28215. [2021-01-06 21:12:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28215 states. [2021-01-06 21:12:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28215 states to 28215 states and 42550 transitions. [2021-01-06 21:12:44,876 INFO L78 Accepts]: Start accepts. Automaton has 28215 states and 42550 transitions. Word has length 93 [2021-01-06 21:12:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:44,876 INFO L481 AbstractCegarLoop]: Abstraction has 28215 states and 42550 transitions. [2021-01-06 21:12:44,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:12:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28215 states and 42550 transitions. [2021-01-06 21:12:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 21:12:44,877 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:44,878 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] [2021-01-06 21:12:44,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:12:44,878 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash 727994603, now seen corresponding path program 1 times [2021-01-06 21:12:44,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:44,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171200649] [2021-01-06 21:12:44,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:45,065 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:12:45,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171200649] [2021-01-06 21:12:45,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:45,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:12:45,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303585664] [2021-01-06 21:12:45,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:12:45,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:45,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:12:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:12:45,068 INFO L87 Difference]: Start difference. First operand 28215 states and 42550 transitions. Second operand 9 states. [2021-01-06 21:13:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:10,209 INFO L93 Difference]: Finished difference Result 422483 states and 637508 transitions. [2021-01-06 21:13:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 21:13:10,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2021-01-06 21:13:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:11,103 INFO L225 Difference]: With dead ends: 422483 [2021-01-06 21:13:11,103 INFO L226 Difference]: Without dead ends: 394321 [2021-01-06 21:13:11,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-01-06 21:13:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394321 states. [2021-01-06 21:13:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394321 to 56375. [2021-01-06 21:13:20,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56375 states. [2021-01-06 21:13:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56375 states to 56375 states and 84022 transitions. [2021-01-06 21:13:20,454 INFO L78 Accepts]: Start accepts. Automaton has 56375 states and 84022 transitions. Word has length 93 [2021-01-06 21:13:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:20,454 INFO L481 AbstractCegarLoop]: Abstraction has 56375 states and 84022 transitions. [2021-01-06 21:13:20,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 56375 states and 84022 transitions. [2021-01-06 21:13:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:13:20,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:20,455 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] [2021-01-06 21:13:20,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:13:20,455 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1398673945, now seen corresponding path program 1 times [2021-01-06 21:13:20,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:20,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945564] [2021-01-06 21:13:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:20,545 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:13:20,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945564] [2021-01-06 21:13:20,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:20,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:13:20,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526696344] [2021-01-06 21:13:20,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:13:20,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:13:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:13:20,547 INFO L87 Difference]: Start difference. First operand 56375 states and 84022 transitions. Second operand 3 states. [2021-01-06 21:13:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:28,906 INFO L93 Difference]: Finished difference Result 138299 states and 205368 transitions. [2021-01-06 21:13:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:13:28,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 21:13:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:29,039 INFO L225 Difference]: With dead ends: 138299 [2021-01-06 21:13:29,039 INFO L226 Difference]: Without dead ends: 81977 [2021-01-06 21:13:29,114 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:13:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81977 states. [2021-01-06 21:13:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81977 to 81463. [2021-01-06 21:13:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81463 states. [2021-01-06 21:13:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81463 states to 81463 states and 119606 transitions. [2021-01-06 21:13:37,502 INFO L78 Accepts]: Start accepts. Automaton has 81463 states and 119606 transitions. Word has length 95 [2021-01-06 21:13:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:37,502 INFO L481 AbstractCegarLoop]: Abstraction has 81463 states and 119606 transitions. [2021-01-06 21:13:37,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:13:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 81463 states and 119606 transitions. [2021-01-06 21:13:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 21:13:37,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:37,503 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] [2021-01-06 21:13:37,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:13:37,504 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1377671290, now seen corresponding path program 1 times [2021-01-06 21:13:37,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:37,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864524512] [2021-01-06 21:13:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:37,882 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:13:37,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864524512] [2021-01-06 21:13:37,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:37,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:37,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943432633] [2021-01-06 21:13:37,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:37,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:37,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:37,885 INFO L87 Difference]: Start difference. First operand 81463 states and 119606 transitions. Second operand 9 states. [2021-01-06 21:13:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:51,789 INFO L93 Difference]: Finished difference Result 203453 states and 299449 transitions. [2021-01-06 21:13:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:51,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2021-01-06 21:13:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:51,959 INFO L225 Difference]: With dead ends: 203453 [2021-01-06 21:13:51,959 INFO L226 Difference]: Without dead ends: 122043 [2021-01-06 21:13:52,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-01-06 21:13:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122043 states. [2021-01-06 21:14:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122043 to 81463. [2021-01-06 21:14:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81463 states. [2021-01-06 21:14:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81463 states to 81463 states and 118838 transitions. [2021-01-06 21:14:02,285 INFO L78 Accepts]: Start accepts. Automaton has 81463 states and 118838 transitions. Word has length 95 [2021-01-06 21:14:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:02,286 INFO L481 AbstractCegarLoop]: Abstraction has 81463 states and 118838 transitions. [2021-01-06 21:14:02,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:14:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 81463 states and 118838 transitions. [2021-01-06 21:14:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 21:14:02,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:02,287 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] [2021-01-06 21:14:02,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:14:02,288 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash -78315606, now seen corresponding path program 1 times [2021-01-06 21:14:02,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:02,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876231235] [2021-01-06 21:14:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:02,350 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:14:02,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876231235] [2021-01-06 21:14:02,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:02,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:14:02,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687961198] [2021-01-06 21:14:02,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:14:02,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:14:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:14:02,352 INFO L87 Difference]: Start difference. First operand 81463 states and 118838 transitions. Second operand 3 states. [2021-01-06 21:14:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:17,380 INFO L93 Difference]: Finished difference Result 184382 states and 270908 transitions. [2021-01-06 21:14:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:14:17,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 21:14:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:17,541 INFO L225 Difference]: With dead ends: 184382 [2021-01-06 21:14:17,541 INFO L226 Difference]: Without dead ends: 128059 [2021-01-06 21:14:17,585 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:14:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128059 states. [2021-01-06 21:14:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128059 to 128057. [2021-01-06 21:14:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128057 states. [2021-01-06 21:14:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128057 states to 128057 states and 186424 transitions. [2021-01-06 21:14:33,727 INFO L78 Accepts]: Start accepts. Automaton has 128057 states and 186424 transitions. Word has length 96 [2021-01-06 21:14:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:33,737 INFO L481 AbstractCegarLoop]: Abstraction has 128057 states and 186424 transitions. [2021-01-06 21:14:33,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:14:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 128057 states and 186424 transitions. [2021-01-06 21:14:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 21:14:33,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:33,739 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] [2021-01-06 21:14:33,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:14:33,739 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash 239953701, now seen corresponding path program 1 times [2021-01-06 21:14:33,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:33,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369145966] [2021-01-06 21:14:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:34,129 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:14:34,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369145966] [2021-01-06 21:14:34,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:34,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:14:34,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95789501] [2021-01-06 21:14:34,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:14:34,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:14:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:14:34,132 INFO L87 Difference]: Start difference. First operand 128057 states and 186424 transitions. Second operand 5 states. [2021-01-06 21:15:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:15:04,575 INFO L93 Difference]: Finished difference Result 243217 states and 352980 transitions. [2021-01-06 21:15:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:15:04,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2021-01-06 21:15:04,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:15:04,962 INFO L225 Difference]: With dead ends: 243217 [2021-01-06 21:15:04,962 INFO L226 Difference]: Without dead ends: 243215 [2021-01-06 21:15:05,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:15:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243215 states. [2021-01-06 21:15:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243215 to 132153. [2021-01-06 21:15:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132153 states. [2021-01-06 21:15:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132153 states to 132153 states and 190264 transitions. [2021-01-06 21:15:24,372 INFO L78 Accepts]: Start accepts. Automaton has 132153 states and 190264 transitions. Word has length 96 [2021-01-06 21:15:24,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:15:24,372 INFO L481 AbstractCegarLoop]: Abstraction has 132153 states and 190264 transitions. [2021-01-06 21:15:24,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:15:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 132153 states and 190264 transitions. [2021-01-06 21:15:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 21:15:24,396 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:15:24,396 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:15:24,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:15:24,397 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:15:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:15:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -714656545, now seen corresponding path program 1 times [2021-01-06 21:15:24,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:15:24,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597535613] [2021-01-06 21:15:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:15:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:15:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 21:15:24,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597535613] [2021-01-06 21:15:24,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:15:24,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:15:24,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656247384] [2021-01-06 21:15:24,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:15:24,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:15:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:15:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:15:24,622 INFO L87 Difference]: Start difference. First operand 132153 states and 190264 transitions. Second operand 9 states.