/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:13:15,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:13:15,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:13:15,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:13:15,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:13:15,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:13:15,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:13:15,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:13:15,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:13:15,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:13:15,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:13:15,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:13:15,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:13:15,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:13:15,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:13:15,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:13:15,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:13:15,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:13:15,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:13:15,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:13:15,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:13:15,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:13:15,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:13:15,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:13:15,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:13:15,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:13:15,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:13:15,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:13:15,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:13:15,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:13:15,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:13:15,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:13:15,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:13:15,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:13:15,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:13:15,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:13:15,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:13:15,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:13:15,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:13:15,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:13:15,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:13:15,332 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:13:15,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:13:15,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:13:15,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:13:15,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:13:15,360 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:13:15,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:13:15,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:13:15,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:13:15,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:13:15,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:13:15,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:13:15,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:13:15,362 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:13:15,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:13:15,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:13:15,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:13:15,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:13:15,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:13:15,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:13:15,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:13:15,364 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:13:15,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:13:15,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:13:15,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:13:15,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:13:15,365 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:13:15,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:13:15,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:13:15,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:13:15,815 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:13:15,815 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:13:15,816 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+nlh-reducer.c [2021-01-06 21:13:15,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a20f24a02/2b950366404d4c64a45db3f15b2e2faa/FLAGf9f51dd39 [2021-01-06 21:13:16,732 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:13:16,733 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+nlh-reducer.c [2021-01-06 21:13:16,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a20f24a02/2b950366404d4c64a45db3f15b2e2faa/FLAGf9f51dd39 [2021-01-06 21:13:16,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a20f24a02/2b950366404d4c64a45db3f15b2e2faa [2021-01-06 21:13:16,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:13:16,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:13:16,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:13:16,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:13:16,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:13:16,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:13:16" (1/1) ... [2021-01-06 21:13:16,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2071dedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:16, skipping insertion in model container [2021-01-06 21:13:16,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:13:16" (1/1) ... [2021-01-06 21:13:17,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:13:17,072 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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] 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[~node5__m5~0,] 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[~node6__m6~0,] 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[~node7__m7~0,] 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[~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_28506~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28758~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 21:13:17,388 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+nlh-reducer.c[9974,9987] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] 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~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] 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[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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~1,] 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~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:13:17,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:13:17,517 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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] 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[~node5__m5~0,] 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[~node6__m6~0,] 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[~node7__m7~0,] 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[~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_28506~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node7__m7~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_28758~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 21:13:17,681 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+nlh-reducer.c[9974,9987] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] 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~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~2,] 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[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~1,] 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~1,] 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~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node7____CPAchecker_TMP_0~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~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[~node7____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:13:17,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:13:17,744 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:13:17,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17 WrapperNode [2021-01-06 21:13:17,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:13:17,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:13:17,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:13:17,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:13:17,790 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:13:17" (1/1) ... [2021-01-06 21:13:17,815 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:13:17" (1/1) ... [2021-01-06 21:13:17,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:13:17,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:13:17,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:13:17,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:13:17,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (1/1) ... [2021-01-06 21:13:17,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:13:17,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:13:17,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:13:17,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:13:17,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (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:13:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:13:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:13:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:13:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:13:19,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:13:19,204 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:13:19,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:13:19 BoogieIcfgContainer [2021-01-06 21:13:19,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:13:19,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:13:19,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:13:19,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:13:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:13:16" (1/3) ... [2021-01-06 21:13:19,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed20223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:13:19, skipping insertion in model container [2021-01-06 21:13:19,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:13:17" (2/3) ... [2021-01-06 21:13:19,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed20223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:13:19, skipping insertion in model container [2021-01-06 21:13:19,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:13:19" (3/3) ... [2021-01-06 21:13:19,222 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 21:13:19,229 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:13:19,234 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:13:19,253 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:13:19,301 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:13:19,301 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:13:19,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:13:19,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:13:19,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:13:19,302 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:13:19,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:13:19,303 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:13:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2021-01-06 21:13:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 21:13:19,346 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:19,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:19,347 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1361095482, now seen corresponding path program 1 times [2021-01-06 21:13:19,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:19,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310463752] [2021-01-06 21:13:19,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:19,862 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:19,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310463752] [2021-01-06 21:13:19,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:19,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:13:19,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631391618] [2021-01-06 21:13:19,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:13:19,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:19,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:13:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:13:19,893 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 3 states. [2021-01-06 21:13:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:20,044 INFO L93 Difference]: Finished difference Result 391 states and 653 transitions. [2021-01-06 21:13:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:13:20,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2021-01-06 21:13:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:20,063 INFO L225 Difference]: With dead ends: 391 [2021-01-06 21:13:20,063 INFO L226 Difference]: Without dead ends: 301 [2021-01-06 21:13:20,067 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:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-01-06 21:13:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-01-06 21:13:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 21:13:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 431 transitions. [2021-01-06 21:13:20,180 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 431 transitions. Word has length 107 [2021-01-06 21:13:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:20,181 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 431 transitions. [2021-01-06 21:13:20,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:13:20,182 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 431 transitions. [2021-01-06 21:13:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 21:13:20,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:20,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:20,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:13:20,186 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1847794712, now seen corresponding path program 1 times [2021-01-06 21:13:20,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:20,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816555991] [2021-01-06 21:13:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:20,280 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 [816555991] [2021-01-06 21:13:20,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:20,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:13:20,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60517074] [2021-01-06 21:13:20,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:13:20,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:13:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:13:20,554 INFO L87 Difference]: Start difference. First operand 299 states and 431 transitions. Second operand 5 states. [2021-01-06 21:13:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:20,869 INFO L93 Difference]: Finished difference Result 522 states and 780 transitions. [2021-01-06 21:13:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:20,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 21:13:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:20,875 INFO L225 Difference]: With dead ends: 522 [2021-01-06 21:13:20,875 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 21:13:20,877 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:13:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 21:13:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-01-06 21:13:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 21:13:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 428 transitions. [2021-01-06 21:13:20,924 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 428 transitions. Word has length 109 [2021-01-06 21:13:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:20,924 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 428 transitions. [2021-01-06 21:13:20,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:13:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2021-01-06 21:13:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 21:13:20,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:20,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:20,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:13:20,928 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 512568948, now seen corresponding path program 1 times [2021-01-06 21:13:20,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:20,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052348432] [2021-01-06 21:13:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:21,266 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:21,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052348432] [2021-01-06 21:13:21,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:21,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:13:21,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635791767] [2021-01-06 21:13:21,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:13:21,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:13:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:13:21,273 INFO L87 Difference]: Start difference. First operand 299 states and 428 transitions. Second operand 6 states. [2021-01-06 21:13:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:21,627 INFO L93 Difference]: Finished difference Result 743 states and 1115 transitions. [2021-01-06 21:13:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:21,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2021-01-06 21:13:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:21,634 INFO L225 Difference]: With dead ends: 743 [2021-01-06 21:13:21,635 INFO L226 Difference]: Without dead ends: 500 [2021-01-06 21:13:21,641 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:13:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-01-06 21:13:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 498. [2021-01-06 21:13:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2021-01-06 21:13:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 740 transitions. [2021-01-06 21:13:21,702 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 740 transitions. Word has length 110 [2021-01-06 21:13:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:21,710 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 740 transitions. [2021-01-06 21:13:21,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:13:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 740 transitions. [2021-01-06 21:13:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 21:13:21,723 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:21,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:21,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:13:21,724 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1977473420, now seen corresponding path program 1 times [2021-01-06 21:13:21,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:21,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569682776] [2021-01-06 21:13:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:21,998 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:22,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569682776] [2021-01-06 21:13:22,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:22,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:13:22,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026189254] [2021-01-06 21:13:22,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:13:22,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:22,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:13:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:13:22,007 INFO L87 Difference]: Start difference. First operand 498 states and 740 transitions. Second operand 6 states. [2021-01-06 21:13:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:22,517 INFO L93 Difference]: Finished difference Result 1252 states and 1917 transitions. [2021-01-06 21:13:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:22,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2021-01-06 21:13:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:22,524 INFO L225 Difference]: With dead ends: 1252 [2021-01-06 21:13:22,525 INFO L226 Difference]: Without dead ends: 826 [2021-01-06 21:13:22,526 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:13:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-01-06 21:13:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 824. [2021-01-06 21:13:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2021-01-06 21:13:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1247 transitions. [2021-01-06 21:13:22,610 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1247 transitions. Word has length 111 [2021-01-06 21:13:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:22,612 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 1247 transitions. [2021-01-06 21:13:22,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:13:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1247 transitions. [2021-01-06 21:13:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:13:22,615 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:22,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:22,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:13:22,616 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:22,617 INFO L82 PathProgramCache]: Analyzing trace with hash -18016652, now seen corresponding path program 1 times [2021-01-06 21:13:22,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:22,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795629455] [2021-01-06 21:13:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:22,834 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:22,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795629455] [2021-01-06 21:13:22,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:22,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:13:22,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603957448] [2021-01-06 21:13:22,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:13:22,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:13:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:13:22,839 INFO L87 Difference]: Start difference. First operand 824 states and 1247 transitions. Second operand 6 states. [2021-01-06 21:13:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:23,242 INFO L93 Difference]: Finished difference Result 2250 states and 3468 transitions. [2021-01-06 21:13:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:23,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2021-01-06 21:13:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:23,252 INFO L225 Difference]: With dead ends: 2250 [2021-01-06 21:13:23,252 INFO L226 Difference]: Without dead ends: 1494 [2021-01-06 21:13:23,254 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:13:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-01-06 21:13:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1492. [2021-01-06 21:13:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2021-01-06 21:13:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2282 transitions. [2021-01-06 21:13:23,372 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2282 transitions. Word has length 112 [2021-01-06 21:13:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:23,373 INFO L481 AbstractCegarLoop]: Abstraction has 1492 states and 2282 transitions. [2021-01-06 21:13:23,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:13:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2282 transitions. [2021-01-06 21:13:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 21:13:23,375 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:23,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:23,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:13:23,376 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash -728020480, now seen corresponding path program 1 times [2021-01-06 21:13:23,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:23,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719914605] [2021-01-06 21:13:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:23,555 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:23,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719914605] [2021-01-06 21:13:23,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:23,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:13:23,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629164454] [2021-01-06 21:13:23,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:13:23,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:13:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:13:23,560 INFO L87 Difference]: Start difference. First operand 1492 states and 2282 transitions. Second operand 6 states. [2021-01-06 21:13:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:24,021 INFO L93 Difference]: Finished difference Result 4098 states and 6338 transitions. [2021-01-06 21:13:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:24,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2021-01-06 21:13:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:24,039 INFO L225 Difference]: With dead ends: 4098 [2021-01-06 21:13:24,039 INFO L226 Difference]: Without dead ends: 2686 [2021-01-06 21:13:24,043 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:13:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2021-01-06 21:13:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2684. [2021-01-06 21:13:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2021-01-06 21:13:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4121 transitions. [2021-01-06 21:13:24,272 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4121 transitions. Word has length 113 [2021-01-06 21:13:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:24,273 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4121 transitions. [2021-01-06 21:13:24,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:13:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4121 transitions. [2021-01-06 21:13:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 21:13:24,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:24,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:24,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:13:24,276 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1444052176, now seen corresponding path program 1 times [2021-01-06 21:13:24,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:24,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161739222] [2021-01-06 21:13:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:24,421 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:24,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161739222] [2021-01-06 21:13:24,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:24,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:13:24,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535088263] [2021-01-06 21:13:24,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:13:24,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:13:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:13:24,423 INFO L87 Difference]: Start difference. First operand 2684 states and 4121 transitions. Second operand 5 states. [2021-01-06 21:13:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:24,838 INFO L93 Difference]: Finished difference Result 5304 states and 8176 transitions. [2021-01-06 21:13:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:24,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2021-01-06 21:13:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:24,853 INFO L225 Difference]: With dead ends: 5304 [2021-01-06 21:13:24,853 INFO L226 Difference]: Without dead ends: 2684 [2021-01-06 21:13:24,858 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:13:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2021-01-06 21:13:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2021-01-06 21:13:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2021-01-06 21:13:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4088 transitions. [2021-01-06 21:13:25,083 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4088 transitions. Word has length 114 [2021-01-06 21:13:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:25,083 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4088 transitions. [2021-01-06 21:13:25,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:13:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4088 transitions. [2021-01-06 21:13:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-01-06 21:13:25,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:25,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:25,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:13:25,086 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 968610000, now seen corresponding path program 1 times [2021-01-06 21:13:25,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:25,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699528905] [2021-01-06 21:13:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:25,179 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:25,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699528905] [2021-01-06 21:13:25,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:25,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:13:25,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68311925] [2021-01-06 21:13:25,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:13:25,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:13:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:13:25,182 INFO L87 Difference]: Start difference. First operand 2684 states and 4088 transitions. Second operand 5 states. [2021-01-06 21:13:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:25,590 INFO L93 Difference]: Finished difference Result 5308 states and 8115 transitions. [2021-01-06 21:13:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:13:25,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2021-01-06 21:13:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:25,605 INFO L225 Difference]: With dead ends: 5308 [2021-01-06 21:13:25,605 INFO L226 Difference]: Without dead ends: 2684 [2021-01-06 21:13:25,610 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:13:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2021-01-06 21:13:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2021-01-06 21:13:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2021-01-06 21:13:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4055 transitions. [2021-01-06 21:13:25,825 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4055 transitions. Word has length 115 [2021-01-06 21:13:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:25,825 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 4055 transitions. [2021-01-06 21:13:25,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:13:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4055 transitions. [2021-01-06 21:13:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:25,828 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:25,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:25,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:13:25,829 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1957898812, now seen corresponding path program 1 times [2021-01-06 21:13:25,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:25,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923549181] [2021-01-06 21:13:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:26,061 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:26,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923549181] [2021-01-06 21:13:26,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:26,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:26,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191279071] [2021-01-06 21:13:26,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:26,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:26,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:26,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:26,064 INFO L87 Difference]: Start difference. First operand 2684 states and 4055 transitions. Second operand 9 states. [2021-01-06 21:13:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:27,905 INFO L93 Difference]: Finished difference Result 20736 states and 31587 transitions. [2021-01-06 21:13:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:27,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:13:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:27,987 INFO L225 Difference]: With dead ends: 20736 [2021-01-06 21:13:27,987 INFO L226 Difference]: Without dead ends: 18334 [2021-01-06 21:13:27,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:13:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18334 states. [2021-01-06 21:13:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18334 to 3911. [2021-01-06 21:13:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3911 states. [2021-01-06 21:13:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 5935 transitions. [2021-01-06 21:13:28,648 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 5935 transitions. Word has length 116 [2021-01-06 21:13:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:28,648 INFO L481 AbstractCegarLoop]: Abstraction has 3911 states and 5935 transitions. [2021-01-06 21:13:28,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 5935 transitions. [2021-01-06 21:13:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:28,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:28,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:28,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:13:28,652 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1903030168, now seen corresponding path program 1 times [2021-01-06 21:13:28,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:28,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145768948] [2021-01-06 21:13:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:28,860 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:28,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145768948] [2021-01-06 21:13:28,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:28,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:28,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362149659] [2021-01-06 21:13:28,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:28,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:28,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:28,863 INFO L87 Difference]: Start difference. First operand 3911 states and 5935 transitions. Second operand 9 states. [2021-01-06 21:13:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:31,382 INFO L93 Difference]: Finished difference Result 21692 states and 33063 transitions. [2021-01-06 21:13:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:31,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:13:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:31,426 INFO L225 Difference]: With dead ends: 21692 [2021-01-06 21:13:31,430 INFO L226 Difference]: Without dead ends: 19290 [2021-01-06 21:13:31,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:13:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19290 states. [2021-01-06 21:13:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19290 to 6502. [2021-01-06 21:13:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6502 states. [2021-01-06 21:13:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 9907 transitions. [2021-01-06 21:13:32,297 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 9907 transitions. Word has length 116 [2021-01-06 21:13:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:32,298 INFO L481 AbstractCegarLoop]: Abstraction has 6502 states and 9907 transitions. [2021-01-06 21:13:32,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 9907 transitions. [2021-01-06 21:13:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:32,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:32,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:32,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:13:32,302 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:32,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1390282604, now seen corresponding path program 1 times [2021-01-06 21:13:32,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:32,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874490426] [2021-01-06 21:13:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:32,532 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:32,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874490426] [2021-01-06 21:13:32,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:32,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:32,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667298760] [2021-01-06 21:13:32,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:32,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:32,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:32,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:32,536 INFO L87 Difference]: Start difference. First operand 6502 states and 9907 transitions. Second operand 9 states. [2021-01-06 21:13:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:35,646 INFO L93 Difference]: Finished difference Result 22666 states and 34557 transitions. [2021-01-06 21:13:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:35,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:13:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:35,684 INFO L225 Difference]: With dead ends: 22666 [2021-01-06 21:13:35,684 INFO L226 Difference]: Without dead ends: 20264 [2021-01-06 21:13:35,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:13:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20264 states. [2021-01-06 21:13:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20264 to 7758. [2021-01-06 21:13:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7758 states. [2021-01-06 21:13:36,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7758 states to 7758 states and 11831 transitions. [2021-01-06 21:13:36,705 INFO L78 Accepts]: Start accepts. Automaton has 7758 states and 11831 transitions. Word has length 116 [2021-01-06 21:13:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:36,705 INFO L481 AbstractCegarLoop]: Abstraction has 7758 states and 11831 transitions. [2021-01-06 21:13:36,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7758 states and 11831 transitions. [2021-01-06 21:13:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:36,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:36,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:36,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:13:36,710 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:36,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2053503990, now seen corresponding path program 1 times [2021-01-06 21:13:36,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:36,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493450855] [2021-01-06 21:13:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:36,945 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:36,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493450855] [2021-01-06 21:13:36,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:36,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:36,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553957871] [2021-01-06 21:13:36,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:36,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:36,948 INFO L87 Difference]: Start difference. First operand 7758 states and 11831 transitions. Second operand 9 states. [2021-01-06 21:13:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:39,786 INFO L93 Difference]: Finished difference Result 23744 states and 36211 transitions. [2021-01-06 21:13:39,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:13:39,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:13:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:39,823 INFO L225 Difference]: With dead ends: 23744 [2021-01-06 21:13:39,823 INFO L226 Difference]: Without dead ends: 21342 [2021-01-06 21:13:39,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:13:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21342 states. [2021-01-06 21:13:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21342 to 8998. [2021-01-06 21:13:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8998 states. [2021-01-06 21:13:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 13727 transitions. [2021-01-06 21:13:41,319 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 13727 transitions. Word has length 116 [2021-01-06 21:13:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:41,320 INFO L481 AbstractCegarLoop]: Abstraction has 8998 states and 13727 transitions. [2021-01-06 21:13:41,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:13:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 13727 transitions. [2021-01-06 21:13:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:41,323 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:41,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:41,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:13:41,327 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1093472964, now seen corresponding path program 1 times [2021-01-06 21:13:41,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:41,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063156415] [2021-01-06 21:13:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:41,413 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:41,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063156415] [2021-01-06 21:13:41,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:41,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:13:41,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740769864] [2021-01-06 21:13:41,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:13:41,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:13:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:13:41,416 INFO L87 Difference]: Start difference. First operand 8998 states and 13727 transitions. Second operand 3 states. [2021-01-06 21:13:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:43,875 INFO L93 Difference]: Finished difference Result 25482 states and 38769 transitions. [2021-01-06 21:13:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:13:43,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 21:13:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:43,894 INFO L225 Difference]: With dead ends: 25482 [2021-01-06 21:13:43,894 INFO L226 Difference]: Without dead ends: 16920 [2021-01-06 21:13:43,908 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:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16920 states. [2021-01-06 21:13:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16920 to 16694. [2021-01-06 21:13:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16694 states. [2021-01-06 21:13:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16694 states to 16694 states and 25135 transitions. [2021-01-06 21:13:46,474 INFO L78 Accepts]: Start accepts. Automaton has 16694 states and 25135 transitions. Word has length 116 [2021-01-06 21:13:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:46,474 INFO L481 AbstractCegarLoop]: Abstraction has 16694 states and 25135 transitions. [2021-01-06 21:13:46,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:13:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 16694 states and 25135 transitions. [2021-01-06 21:13:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:46,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:46,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:46,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:13:46,486 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash -849395301, now seen corresponding path program 1 times [2021-01-06 21:13:46,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:46,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054046258] [2021-01-06 21:13:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:46,567 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:46,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054046258] [2021-01-06 21:13:46,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:46,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:13:46,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051960481] [2021-01-06 21:13:46,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:13:46,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:13:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:13:46,570 INFO L87 Difference]: Start difference. First operand 16694 states and 25135 transitions. Second operand 3 states. [2021-01-06 21:13:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:50,271 INFO L93 Difference]: Finished difference Result 44554 states and 67089 transitions. [2021-01-06 21:13:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:13:50,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 21:13:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:50,314 INFO L225 Difference]: With dead ends: 44554 [2021-01-06 21:13:50,314 INFO L226 Difference]: Without dead ends: 28296 [2021-01-06 21:13:50,333 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:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28296 states. [2021-01-06 21:13:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28296 to 28294. [2021-01-06 21:13:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28294 states. [2021-01-06 21:13:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 42383 transitions. [2021-01-06 21:13:55,169 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 42383 transitions. Word has length 116 [2021-01-06 21:13:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:55,169 INFO L481 AbstractCegarLoop]: Abstraction has 28294 states and 42383 transitions. [2021-01-06 21:13:55,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:13:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 42383 transitions. [2021-01-06 21:13:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:13:55,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:55,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:55,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:13:55,173 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 197694076, now seen corresponding path program 1 times [2021-01-06 21:13:55,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:55,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179329336] [2021-01-06 21:13:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:55,411 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:55,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179329336] [2021-01-06 21:13:55,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:55,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:13:55,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708443308] [2021-01-06 21:13:55,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:13:55,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:13:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:13:55,415 INFO L87 Difference]: Start difference. First operand 28294 states and 42383 transitions. Second operand 9 states. [2021-01-06 21:14:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:05,571 INFO L93 Difference]: Finished difference Result 74570 states and 111901 transitions. [2021-01-06 21:14:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:14:05,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:14:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:05,644 INFO L225 Difference]: With dead ends: 74570 [2021-01-06 21:14:05,644 INFO L226 Difference]: Without dead ends: 67672 [2021-01-06 21:14:05,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:14:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67672 states. [2021-01-06 21:14:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67672 to 32950. [2021-01-06 21:14:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32950 states. [2021-01-06 21:14:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32950 states to 32950 states and 49359 transitions. [2021-01-06 21:14:11,256 INFO L78 Accepts]: Start accepts. Automaton has 32950 states and 49359 transitions. Word has length 116 [2021-01-06 21:14:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:11,257 INFO L481 AbstractCegarLoop]: Abstraction has 32950 states and 49359 transitions. [2021-01-06 21:14:11,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:14:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32950 states and 49359 transitions. [2021-01-06 21:14:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:14:11,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:11,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:14:11,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:14:11,261 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2050931402, now seen corresponding path program 1 times [2021-01-06 21:14:11,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:11,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038658969] [2021-01-06 21:14:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:11,459 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:11,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038658969] [2021-01-06 21:14:11,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:11,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:14:11,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175664299] [2021-01-06 21:14:11,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:14:11,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:11,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:14:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:14:11,462 INFO L87 Difference]: Start difference. First operand 32950 states and 49359 transitions. Second operand 9 states. [2021-01-06 21:14:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:23,531 INFO L93 Difference]: Finished difference Result 80166 states and 120303 transitions. [2021-01-06 21:14:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:14:23,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:14:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:23,611 INFO L225 Difference]: With dead ends: 80166 [2021-01-06 21:14:23,611 INFO L226 Difference]: Without dead ends: 73268 [2021-01-06 21:14:23,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:14:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73268 states. [2021-01-06 21:14:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73268 to 37640. [2021-01-06 21:14:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37640 states. [2021-01-06 21:14:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37640 states to 37640 states and 56387 transitions. [2021-01-06 21:14:29,970 INFO L78 Accepts]: Start accepts. Automaton has 37640 states and 56387 transitions. Word has length 116 [2021-01-06 21:14:29,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:29,970 INFO L481 AbstractCegarLoop]: Abstraction has 37640 states and 56387 transitions. [2021-01-06 21:14:29,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:14:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 37640 states and 56387 transitions. [2021-01-06 21:14:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 21:14:29,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:29,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:14:29,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:14:29,976 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:29,976 INFO L82 PathProgramCache]: Analyzing trace with hash 653892510, now seen corresponding path program 1 times [2021-01-06 21:14:29,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:29,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302297200] [2021-01-06 21:14:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:14:30,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302297200] [2021-01-06 21:14:30,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:30,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:14:30,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195227993] [2021-01-06 21:14:30,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:14:30,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:14:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:14:30,179 INFO L87 Difference]: Start difference. First operand 37640 states and 56387 transitions. Second operand 9 states. [2021-01-06 21:14:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:44,140 INFO L93 Difference]: Finished difference Result 85524 states and 128343 transitions. [2021-01-06 21:14:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 21:14:44,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2021-01-06 21:14:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:44,229 INFO L225 Difference]: With dead ends: 85524 [2021-01-06 21:14:44,229 INFO L226 Difference]: Without dead ends: 78626 [2021-01-06 21:14:44,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-06 21:14:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78626 states. [2021-01-06 21:14:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78626 to 42379. [2021-01-06 21:14:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2021-01-06 21:14:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63491 transitions. [2021-01-06 21:14:51,944 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63491 transitions. Word has length 116 [2021-01-06 21:14:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:14:51,945 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63491 transitions. [2021-01-06 21:14:51,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:14:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63491 transitions. [2021-01-06 21:14:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-01-06 21:14:51,950 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:14:51,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:14:51,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:14:51,951 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:14:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:14:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash 695724750, now seen corresponding path program 1 times [2021-01-06 21:14:51,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:14:51,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142581769] [2021-01-06 21:14:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:14:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:14:52,238 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:52,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142581769] [2021-01-06 21:14:52,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:14:52,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:14:52,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624123522] [2021-01-06 21:14:52,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:14:52,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:14:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:14:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:14:52,240 INFO L87 Difference]: Start difference. First operand 42379 states and 63491 transitions. Second operand 10 states. [2021-01-06 21:15:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:15:09,943 INFO L93 Difference]: Finished difference Result 127846 states and 191029 transitions. [2021-01-06 21:15:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:15:09,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2021-01-06 21:15:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:15:10,069 INFO L225 Difference]: With dead ends: 127846 [2021-01-06 21:15:10,070 INFO L226 Difference]: Without dead ends: 85696 [2021-01-06 21:15:10,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:15:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85696 states. [2021-01-06 21:15:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85696 to 42379. [2021-01-06 21:15:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2021-01-06 21:15:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63485 transitions. [2021-01-06 21:15:19,021 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63485 transitions. Word has length 117 [2021-01-06 21:15:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:15:19,021 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63485 transitions. [2021-01-06 21:15:19,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:15:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63485 transitions. [2021-01-06 21:15:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:15:19,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:15:19,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:15:19,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 21:15:19,027 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:15:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:15:19,027 INFO L82 PathProgramCache]: Analyzing trace with hash -674648634, now seen corresponding path program 1 times [2021-01-06 21:15:19,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:15:19,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566351996] [2021-01-06 21:15:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:15:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:15:19,303 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:15:19,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566351996] [2021-01-06 21:15:19,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:15:19,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:15:19,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050308056] [2021-01-06 21:15:19,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:15:19,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:15:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:15:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:15:19,305 INFO L87 Difference]: Start difference. First operand 42379 states and 63485 transitions. Second operand 10 states. [2021-01-06 21:15:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:15:34,155 INFO L93 Difference]: Finished difference Result 106178 states and 158752 transitions. [2021-01-06 21:15:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 21:15:34,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2021-01-06 21:15:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:15:34,236 INFO L225 Difference]: With dead ends: 106178 [2021-01-06 21:15:34,236 INFO L226 Difference]: Without dead ends: 64013 [2021-01-06 21:15:34,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-01-06 21:15:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64013 states. [2021-01-06 21:15:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64013 to 42379. [2021-01-06 21:15:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42379 states. [2021-01-06 21:15:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42379 states to 42379 states and 63482 transitions. [2021-01-06 21:15:43,648 INFO L78 Accepts]: Start accepts. Automaton has 42379 states and 63482 transitions. Word has length 118 [2021-01-06 21:15:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:15:43,649 INFO L481 AbstractCegarLoop]: Abstraction has 42379 states and 63482 transitions. [2021-01-06 21:15:43,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:15:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 42379 states and 63482 transitions. [2021-01-06 21:15:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-06 21:15:43,653 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:15:43,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 21:15:43,653 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:15:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:15:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash 995910944, now seen corresponding path program 1 times [2021-01-06 21:15:43,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:15:43,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756841152] [2021-01-06 21:15:43,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:15:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:15:43,901 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:15:43,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756841152] [2021-01-06 21:15:43,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:15:43,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:15:43,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960346943] [2021-01-06 21:15:43,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:15:43,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:15:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:15:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:15:43,904 INFO L87 Difference]: Start difference. First operand 42379 states and 63482 transitions. Second operand 10 states. [2021-01-06 21:16:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:22,537 INFO L93 Difference]: Finished difference Result 204159 states and 303242 transitions. [2021-01-06 21:16:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 21:16:22,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 118 [2021-01-06 21:16:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:22,777 INFO L225 Difference]: With dead ends: 204159 [2021-01-06 21:16:22,777 INFO L226 Difference]: Without dead ends: 162333 [2021-01-06 21:16:23,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2021-01-06 21:16:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162333 states. [2021-01-06 21:16:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162333 to 42535. [2021-01-06 21:16:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42535 states. [2021-01-06 21:16:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42535 states to 42535 states and 63690 transitions. [2021-01-06 21:16:34,347 INFO L78 Accepts]: Start accepts. Automaton has 42535 states and 63690 transitions. Word has length 118 [2021-01-06 21:16:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:16:34,347 INFO L481 AbstractCegarLoop]: Abstraction has 42535 states and 63690 transitions. [2021-01-06 21:16:34,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 21:16:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 42535 states and 63690 transitions. [2021-01-06 21:16:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 21:16:34,352 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:16:34,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:16:34,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 21:16:34,353 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:16:34,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:16:34,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1974472565, now seen corresponding path program 1 times [2021-01-06 21:16:34,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:16:34,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037274448] [2021-01-06 21:16:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:16:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:16:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:16:34,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037274448] [2021-01-06 21:16:34,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:16:34,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:16:34,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386810051] [2021-01-06 21:16:34,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 21:16:34,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:16:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 21:16:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 21:16:34,643 INFO L87 Difference]: Start difference. First operand 42535 states and 63690 transitions. Second operand 9 states. [2021-01-06 21:16:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:16:51,333 INFO L93 Difference]: Finished difference Result 105470 states and 157944 transitions. [2021-01-06 21:16:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 21:16:51,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2021-01-06 21:16:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:16:51,409 INFO L225 Difference]: With dead ends: 105470 [2021-01-06 21:16:51,409 INFO L226 Difference]: Without dead ends: 63368 [2021-01-06 21:16:51,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-06 21:16:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63368 states. [2021-01-06 21:17:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63368 to 42310. [2021-01-06 21:17:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42310 states. [2021-01-06 21:17:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42310 states to 42310 states and 63360 transitions. [2021-01-06 21:17:02,591 INFO L78 Accepts]: Start accepts. Automaton has 42310 states and 63360 transitions. Word has length 119 [2021-01-06 21:17:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:17:02,591 INFO L481 AbstractCegarLoop]: Abstraction has 42310 states and 63360 transitions. [2021-01-06 21:17:02,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 21:17:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 42310 states and 63360 transitions. [2021-01-06 21:17:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 21:17:02,594 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:17:02,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:17:02,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 21:17:02,594 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:17:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:17:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash -581165707, now seen corresponding path program 1 times [2021-01-06 21:17:02,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:17:02,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350236978] [2021-01-06 21:17:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:17:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:17:02,895 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:17:02,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350236978] [2021-01-06 21:17:02,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:17:02,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 21:17:02,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564858317] [2021-01-06 21:17:02,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 21:17:02,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:17:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 21:17:02,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 21:17:02,898 INFO L87 Difference]: Start difference. First operand 42310 states and 63360 transitions. Second operand 10 states.