/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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 21:10:44,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 21:10:44,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 21:10:44,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 21:10:44,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 21:10:44,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 21:10:44,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 21:10:44,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 21:10:44,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 21:10:44,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 21:10:44,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 21:10:44,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 21:10:44,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 21:10:44,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 21:10:44,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 21:10:44,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 21:10:44,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 21:10:44,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 21:10:44,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 21:10:44,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 21:10:44,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 21:10:44,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 21:10:44,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 21:10:44,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 21:10:44,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 21:10:44,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 21:10:44,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 21:10:44,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 21:10:44,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 21:10:44,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 21:10:44,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 21:10:44,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 21:10:44,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 21:10:44,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 21:10:44,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 21:10:44,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 21:10:44,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 21:10:44,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 21:10:44,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 21:10:44,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 21:10:44,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 21:10:44,379 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:10:44,425 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 21:10:44,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 21:10:44,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 21:10:44,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 21:10:44,431 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 21:10:44,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 21:10:44,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 21:10:44,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 21:10:44,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 21:10:44,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 21:10:44,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 21:10:44,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 21:10:44,434 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 21:10:44,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 21:10:44,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 21:10:44,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 21:10:44,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 21:10:44,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 21:10:44,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 21:10:44,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 21:10:44,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 21:10:44,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 21:10:44,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 21:10:44,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 21:10:44,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 21:10:44,437 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:10:44,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 21:10:44,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 21:10:44,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 21:10:44,896 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 21:10:44,897 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 21:10:44,898 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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:10:44,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d501e1f70/7499f28eda4c4399a283c35383832428/FLAG7377b8fbf [2021-01-06 21:10:45,777 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 21:10:45,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:10:45,804 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d501e1f70/7499f28eda4c4399a283c35383832428/FLAG7377b8fbf [2021-01-06 21:10:46,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d501e1f70/7499f28eda4c4399a283c35383832428 [2021-01-06 21:10:46,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 21:10:46,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 21:10:46,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 21:10:46,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 21:10:46,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 21:10:46,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32de7693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46, skipping insertion in model container [2021-01-06 21:10:46,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 21:10:46,193 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_13172~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_13305~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:10:46,450 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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6326,6339] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:10:46,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:10:46,548 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[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_13172~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[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~node5__m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~node6__m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_13305~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 21:10:46,614 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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[6326,6339] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node6____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node5____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] [2021-01-06 21:10:46,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 21:10:46,712 INFO L208 MainTranslator]: Completed translation [2021-01-06 21:10:46,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46 WrapperNode [2021-01-06 21:10:46,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 21:10:46,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 21:10:46,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 21:10:46,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 21:10:46,726 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:10:46" (1/1) ... [2021-01-06 21:10:46,760 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:10:46" (1/1) ... [2021-01-06 21:10:46,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 21:10:46,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 21:10:46,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 21:10:46,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 21:10:46,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (1/1) ... [2021-01-06 21:10:46,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 21:10:46,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 21:10:46,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 21:10:46,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 21:10:46,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (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:10:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 21:10:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 21:10:47,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 21:10:47,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 21:10:47,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 21:10:47,890 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 21:10:47,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:10:47 BoogieIcfgContainer [2021-01-06 21:10:47,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 21:10:47,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 21:10:47,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 21:10:47,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 21:10:47,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 09:10:46" (1/3) ... [2021-01-06 21:10:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8aa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:10:47, skipping insertion in model container [2021-01-06 21:10:47,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 09:10:46" (2/3) ... [2021-01-06 21:10:47,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8aa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 09:10:47, skipping insertion in model container [2021-01-06 21:10:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 09:10:47" (3/3) ... [2021-01-06 21:10:47,903 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 21:10:47,910 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 21:10:47,916 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 21:10:47,937 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 21:10:47,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 21:10:47,967 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 21:10:47,967 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 21:10:47,967 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 21:10:47,967 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 21:10:47,968 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 21:10:47,968 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 21:10:47,968 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 21:10:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2021-01-06 21:10:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 21:10:47,999 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:48,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:48,000 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1122612567, now seen corresponding path program 1 times [2021-01-06 21:10:48,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:48,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507231742] [2021-01-06 21:10:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:48,475 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:10:48,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507231742] [2021-01-06 21:10:48,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:48,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:10:48,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550254500] [2021-01-06 21:10:48,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:10:48,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:10:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:10:48,502 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2021-01-06 21:10:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:48,581 INFO L93 Difference]: Finished difference Result 260 states and 422 transitions. [2021-01-06 21:10:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:10:48,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 21:10:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:48,598 INFO L225 Difference]: With dead ends: 260 [2021-01-06 21:10:48,598 INFO L226 Difference]: Without dead ends: 179 [2021-01-06 21:10:48,602 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:10:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-01-06 21:10:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2021-01-06 21:10:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2021-01-06 21:10:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2021-01-06 21:10:48,684 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 73 [2021-01-06 21:10:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:48,685 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2021-01-06 21:10:48,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:10:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2021-01-06 21:10:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 21:10:48,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:48,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:48,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 21:10:48,689 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1622464055, now seen corresponding path program 1 times [2021-01-06 21:10:48,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:48,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926141853] [2021-01-06 21:10:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:48,899 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:10:48,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926141853] [2021-01-06 21:10:48,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:48,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:10:48,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166894825] [2021-01-06 21:10:48,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:10:48,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:48,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:10:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:10:48,903 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand 3 states. [2021-01-06 21:10:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:48,954 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2021-01-06 21:10:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:10:48,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 21:10:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:48,959 INFO L225 Difference]: With dead ends: 429 [2021-01-06 21:10:48,959 INFO L226 Difference]: Without dead ends: 295 [2021-01-06 21:10:48,961 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:10:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-01-06 21:10:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2021-01-06 21:10:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-06 21:10:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 440 transitions. [2021-01-06 21:10:49,019 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 440 transitions. Word has length 74 [2021-01-06 21:10:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:49,020 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 440 transitions. [2021-01-06 21:10:49,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:10:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 440 transitions. [2021-01-06 21:10:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 21:10:49,023 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:49,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:49,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 21:10:49,025 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:49,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:49,026 INFO L82 PathProgramCache]: Analyzing trace with hash 549627260, now seen corresponding path program 1 times [2021-01-06 21:10:49,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:49,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659077384] [2021-01-06 21:10:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:49,241 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:10:49,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659077384] [2021-01-06 21:10:49,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:49,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:10:49,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482437309] [2021-01-06 21:10:49,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:10:49,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:10:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:10:49,249 INFO L87 Difference]: Start difference. First operand 293 states and 440 transitions. Second operand 3 states. [2021-01-06 21:10:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:49,344 INFO L93 Difference]: Finished difference Result 761 states and 1182 transitions. [2021-01-06 21:10:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:10:49,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 21:10:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:49,353 INFO L225 Difference]: With dead ends: 761 [2021-01-06 21:10:49,354 INFO L226 Difference]: Without dead ends: 511 [2021-01-06 21:10:49,356 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:10:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-06 21:10:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 509. [2021-01-06 21:10:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2021-01-06 21:10:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 780 transitions. [2021-01-06 21:10:49,450 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 780 transitions. Word has length 75 [2021-01-06 21:10:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:49,451 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 780 transitions. [2021-01-06 21:10:49,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:10:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 780 transitions. [2021-01-06 21:10:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 21:10:49,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:49,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:49,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 21:10:49,457 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1347673334, now seen corresponding path program 1 times [2021-01-06 21:10:49,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:49,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600811393] [2021-01-06 21:10:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:49,580 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:10:49,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600811393] [2021-01-06 21:10:49,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:49,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:10:49,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081355128] [2021-01-06 21:10:49,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:10:49,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:10:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:10:49,585 INFO L87 Difference]: Start difference. First operand 509 states and 780 transitions. Second operand 3 states. [2021-01-06 21:10:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:49,662 INFO L93 Difference]: Finished difference Result 1377 states and 2150 transitions. [2021-01-06 21:10:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:10:49,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 21:10:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:49,671 INFO L225 Difference]: With dead ends: 1377 [2021-01-06 21:10:49,672 INFO L226 Difference]: Without dead ends: 911 [2021-01-06 21:10:49,676 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:10:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-01-06 21:10:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 909. [2021-01-06 21:10:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2021-01-06 21:10:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1404 transitions. [2021-01-06 21:10:49,748 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1404 transitions. Word has length 76 [2021-01-06 21:10:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:49,751 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1404 transitions. [2021-01-06 21:10:49,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:10:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1404 transitions. [2021-01-06 21:10:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 21:10:49,757 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:49,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:49,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 21:10:49,757 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1762980839, now seen corresponding path program 1 times [2021-01-06 21:10:49,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:49,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215375702] [2021-01-06 21:10:49,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:49,912 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:10:49,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215375702] [2021-01-06 21:10:49,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:49,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:10:49,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387864767] [2021-01-06 21:10:49,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:10:49,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:49,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:10:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:10:49,916 INFO L87 Difference]: Start difference. First operand 909 states and 1404 transitions. Second operand 3 states. [2021-01-06 21:10:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:50,030 INFO L93 Difference]: Finished difference Result 2513 states and 3918 transitions. [2021-01-06 21:10:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:10:50,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 21:10:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:50,041 INFO L225 Difference]: With dead ends: 2513 [2021-01-06 21:10:50,041 INFO L226 Difference]: Without dead ends: 1647 [2021-01-06 21:10:50,043 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:10:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-01-06 21:10:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1645. [2021-01-06 21:10:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2021-01-06 21:10:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2540 transitions. [2021-01-06 21:10:50,158 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2540 transitions. Word has length 77 [2021-01-06 21:10:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:50,159 INFO L481 AbstractCegarLoop]: Abstraction has 1645 states and 2540 transitions. [2021-01-06 21:10:50,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:10:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2540 transitions. [2021-01-06 21:10:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 21:10:50,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:50,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:50,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 21:10:50,162 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1296361934, now seen corresponding path program 1 times [2021-01-06 21:10:50,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:50,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196681517] [2021-01-06 21:10:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:50,365 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:10:50,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196681517] [2021-01-06 21:10:50,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:50,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:10:50,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192487691] [2021-01-06 21:10:50,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:10:50,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:10:50,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:10:50,370 INFO L87 Difference]: Start difference. First operand 1645 states and 2540 transitions. Second operand 6 states. [2021-01-06 21:10:50,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:50,808 INFO L93 Difference]: Finished difference Result 4833 states and 7502 transitions. [2021-01-06 21:10:50,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:10:50,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-01-06 21:10:50,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:50,827 INFO L225 Difference]: With dead ends: 4833 [2021-01-06 21:10:50,827 INFO L226 Difference]: Without dead ends: 3231 [2021-01-06 21:10:50,830 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:10:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2021-01-06 21:10:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3229. [2021-01-06 21:10:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2021-01-06 21:10:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4988 transitions. [2021-01-06 21:10:51,062 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4988 transitions. Word has length 78 [2021-01-06 21:10:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:51,063 INFO L481 AbstractCegarLoop]: Abstraction has 3229 states and 4988 transitions. [2021-01-06 21:10:51,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:10:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4988 transitions. [2021-01-06 21:10:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 21:10:51,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:51,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:51,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 21:10:51,068 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1156574829, now seen corresponding path program 1 times [2021-01-06 21:10:51,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:51,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139790230] [2021-01-06 21:10:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:51,237 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:10:51,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139790230] [2021-01-06 21:10:51,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:51,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:10:51,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087678717] [2021-01-06 21:10:51,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 21:10:51,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 21:10:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:10:51,242 INFO L87 Difference]: Start difference. First operand 3229 states and 4988 transitions. Second operand 6 states. [2021-01-06 21:10:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:51,793 INFO L93 Difference]: Finished difference Result 9569 states and 14814 transitions. [2021-01-06 21:10:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:10:51,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-01-06 21:10:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:51,828 INFO L225 Difference]: With dead ends: 9569 [2021-01-06 21:10:51,828 INFO L226 Difference]: Without dead ends: 6383 [2021-01-06 21:10:51,837 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:10:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6383 states. [2021-01-06 21:10:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6383 to 6381. [2021-01-06 21:10:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2021-01-06 21:10:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 9836 transitions. [2021-01-06 21:10:52,280 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 9836 transitions. Word has length 78 [2021-01-06 21:10:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:52,280 INFO L481 AbstractCegarLoop]: Abstraction has 6381 states and 9836 transitions. [2021-01-06 21:10:52,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 21:10:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 9836 transitions. [2021-01-06 21:10:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 21:10:52,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:52,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:52,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 21:10:52,283 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:52,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash -290454766, now seen corresponding path program 1 times [2021-01-06 21:10:52,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:52,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501656834] [2021-01-06 21:10:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 21:10:52,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501656834] [2021-01-06 21:10:52,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:52,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:10:52,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130781614] [2021-01-06 21:10:52,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:10:52,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:10:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:10:52,393 INFO L87 Difference]: Start difference. First operand 6381 states and 9836 transitions. Second operand 5 states. [2021-01-06 21:10:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:52,931 INFO L93 Difference]: Finished difference Result 12719 states and 19629 transitions. [2021-01-06 21:10:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:10:52,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2021-01-06 21:10:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:52,965 INFO L225 Difference]: With dead ends: 12719 [2021-01-06 21:10:52,965 INFO L226 Difference]: Without dead ends: 6381 [2021-01-06 21:10:52,975 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:10:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2021-01-06 21:10:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 6381. [2021-01-06 21:10:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2021-01-06 21:10:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 9772 transitions. [2021-01-06 21:10:53,466 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 9772 transitions. Word has length 78 [2021-01-06 21:10:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:53,466 INFO L481 AbstractCegarLoop]: Abstraction has 6381 states and 9772 transitions. [2021-01-06 21:10:53,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:10:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 9772 transitions. [2021-01-06 21:10:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 21:10:53,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:53,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:53,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 21:10:53,468 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1754526323, now seen corresponding path program 1 times [2021-01-06 21:10:53,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:53,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099146116] [2021-01-06 21:10:53,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:53,540 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:10:53,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099146116] [2021-01-06 21:10:53,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:53,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 21:10:53,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137983900] [2021-01-06 21:10:53,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:10:53,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:53,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:10:53,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:10:53,543 INFO L87 Difference]: Start difference. First operand 6381 states and 9772 transitions. Second operand 5 states. [2021-01-06 21:10:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:54,122 INFO L93 Difference]: Finished difference Result 12719 states and 19501 transitions. [2021-01-06 21:10:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 21:10:54,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2021-01-06 21:10:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:54,155 INFO L225 Difference]: With dead ends: 12719 [2021-01-06 21:10:54,155 INFO L226 Difference]: Without dead ends: 6381 [2021-01-06 21:10:54,164 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:10:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2021-01-06 21:10:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 6381. [2021-01-06 21:10:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2021-01-06 21:10:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 9708 transitions. [2021-01-06 21:10:54,639 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 9708 transitions. Word has length 78 [2021-01-06 21:10:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:10:54,639 INFO L481 AbstractCegarLoop]: Abstraction has 6381 states and 9708 transitions. [2021-01-06 21:10:54,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:10:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 9708 transitions. [2021-01-06 21:10:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 21:10:54,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:10:54,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:10:54,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 21:10:54,641 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:10:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:10:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash -427141134, now seen corresponding path program 1 times [2021-01-06 21:10:54,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:10:54,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924818127] [2021-01-06 21:10:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:10:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:10:54,775 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:10:54,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924818127] [2021-01-06 21:10:54,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:10:54,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:10:54,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660444739] [2021-01-06 21:10:54,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:10:54,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:10:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:10:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:10:54,778 INFO L87 Difference]: Start difference. First operand 6381 states and 9708 transitions. Second operand 8 states. [2021-01-06 21:10:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:10:59,508 INFO L93 Difference]: Finished difference Result 76099 states and 116023 transitions. [2021-01-06 21:10:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 21:10:59,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2021-01-06 21:10:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:10:59,686 INFO L225 Difference]: With dead ends: 76099 [2021-01-06 21:10:59,687 INFO L226 Difference]: Without dead ends: 69761 [2021-01-06 21:10:59,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-01-06 21:10:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69761 states. [2021-01-06 21:11:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69761 to 12717. [2021-01-06 21:11:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12717 states. [2021-01-06 21:11:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12717 states to 12717 states and 19116 transitions. [2021-01-06 21:11:01,445 INFO L78 Accepts]: Start accepts. Automaton has 12717 states and 19116 transitions. Word has length 78 [2021-01-06 21:11:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:01,445 INFO L481 AbstractCegarLoop]: Abstraction has 12717 states and 19116 transitions. [2021-01-06 21:11:01,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:11:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12717 states and 19116 transitions. [2021-01-06 21:11:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 21:11:01,447 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:01,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:11:01,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 21:11:01,448 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash 912411086, now seen corresponding path program 1 times [2021-01-06 21:11:01,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:01,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613064198] [2021-01-06 21:11:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:01,534 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:11:01,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613064198] [2021-01-06 21:11:01,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:01,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:01,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041185430] [2021-01-06 21:11:01,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:01,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:01,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:01,537 INFO L87 Difference]: Start difference. First operand 12717 states and 19116 transitions. Second operand 3 states. [2021-01-06 21:11:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:04,149 INFO L93 Difference]: Finished difference Result 36657 states and 54830 transitions. [2021-01-06 21:11:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:04,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 21:11:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:04,189 INFO L225 Difference]: With dead ends: 36657 [2021-01-06 21:11:04,190 INFO L226 Difference]: Without dead ends: 23983 [2021-01-06 21:11:04,208 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:11:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23983 states. [2021-01-06 21:11:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23983 to 23725. [2021-01-06 21:11:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23725 states. [2021-01-06 21:11:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23725 states to 23725 states and 34860 transitions. [2021-01-06 21:11:06,649 INFO L78 Accepts]: Start accepts. Automaton has 23725 states and 34860 transitions. Word has length 80 [2021-01-06 21:11:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:06,650 INFO L481 AbstractCegarLoop]: Abstraction has 23725 states and 34860 transitions. [2021-01-06 21:11:06,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23725 states and 34860 transitions. [2021-01-06 21:11:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 21:11:06,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:06,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] [2021-01-06 21:11:06,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 21:11:06,652 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash 933413741, now seen corresponding path program 1 times [2021-01-06 21:11:06,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:06,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017765064] [2021-01-06 21:11:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:06,991 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:11:06,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017765064] [2021-01-06 21:11:06,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:06,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:11:06,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842327069] [2021-01-06 21:11:06,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:11:06,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:11:06,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:11:06,994 INFO L87 Difference]: Start difference. First operand 23725 states and 34860 transitions. Second operand 8 states. [2021-01-06 21:11:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:10,503 INFO L93 Difference]: Finished difference Result 59187 states and 87215 transitions. [2021-01-06 21:11:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:11:10,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2021-01-06 21:11:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:10,563 INFO L225 Difference]: With dead ends: 59187 [2021-01-06 21:11:10,564 INFO L226 Difference]: Without dead ends: 35505 [2021-01-06 21:11:10,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2021-01-06 21:11:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35505 states. [2021-01-06 21:11:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35505 to 23725. [2021-01-06 21:11:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23725 states. [2021-01-06 21:11:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23725 states to 23725 states and 34604 transitions. [2021-01-06 21:11:13,196 INFO L78 Accepts]: Start accepts. Automaton has 23725 states and 34604 transitions. Word has length 80 [2021-01-06 21:11:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:13,196 INFO L481 AbstractCegarLoop]: Abstraction has 23725 states and 34604 transitions. [2021-01-06 21:11:13,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:11:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 23725 states and 34604 transitions. [2021-01-06 21:11:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 21:11:13,197 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:13,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:11:13,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 21:11:13,197 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1558777127, now seen corresponding path program 1 times [2021-01-06 21:11:13,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:13,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606727708] [2021-01-06 21:11:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:13,253 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:11:13,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606727708] [2021-01-06 21:11:13,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:13,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 21:11:13,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088625043] [2021-01-06 21:11:13,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 21:11:13,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 21:11:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 21:11:13,255 INFO L87 Difference]: Start difference. First operand 23725 states and 34604 transitions. Second operand 3 states. [2021-01-06 21:11:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:16,229 INFO L93 Difference]: Finished difference Result 46516 states and 68402 transitions. [2021-01-06 21:11:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 21:11:16,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 21:11:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:16,275 INFO L225 Difference]: With dead ends: 46516 [2021-01-06 21:11:16,275 INFO L226 Difference]: Without dead ends: 33841 [2021-01-06 21:11:16,301 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:11:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33841 states. [2021-01-06 21:11:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33841 to 33839. [2021-01-06 21:11:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33839 states. [2021-01-06 21:11:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33839 states to 33839 states and 49198 transitions. [2021-01-06 21:11:19,507 INFO L78 Accepts]: Start accepts. Automaton has 33839 states and 49198 transitions. Word has length 81 [2021-01-06 21:11:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:19,507 INFO L481 AbstractCegarLoop]: Abstraction has 33839 states and 49198 transitions. [2021-01-06 21:11:19,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 21:11:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33839 states and 49198 transitions. [2021-01-06 21:11:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 21:11:19,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:19,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:11:19,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 21:11:19,508 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1130854413, now seen corresponding path program 1 times [2021-01-06 21:11:19,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:19,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106214231] [2021-01-06 21:11:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:19,593 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:11:19,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106214231] [2021-01-06 21:11:19,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:19,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 21:11:19,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300854698] [2021-01-06 21:11:19,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 21:11:19,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 21:11:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 21:11:19,595 INFO L87 Difference]: Start difference. First operand 33839 states and 49198 transitions. Second operand 5 states. [2021-01-06 21:11:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:25,183 INFO L93 Difference]: Finished difference Result 60987 states and 88393 transitions. [2021-01-06 21:11:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 21:11:25,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2021-01-06 21:11:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:25,248 INFO L225 Difference]: With dead ends: 60987 [2021-01-06 21:11:25,249 INFO L226 Difference]: Without dead ends: 60985 [2021-01-06 21:11:25,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 21:11:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60985 states. [2021-01-06 21:11:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60985 to 34863. [2021-01-06 21:11:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34863 states. [2021-01-06 21:11:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34863 states to 34863 states and 50094 transitions. [2021-01-06 21:11:29,080 INFO L78 Accepts]: Start accepts. Automaton has 34863 states and 50094 transitions. Word has length 81 [2021-01-06 21:11:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:11:29,080 INFO L481 AbstractCegarLoop]: Abstraction has 34863 states and 50094 transitions. [2021-01-06 21:11:29,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 21:11:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34863 states and 50094 transitions. [2021-01-06 21:11:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:11:29,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:11:29,091 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:11:29,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 21:11:29,092 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:11:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:11:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 905576252, now seen corresponding path program 1 times [2021-01-06 21:11:29,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:11:29,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565022908] [2021-01-06 21:11:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:11:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:11:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 21:11:29,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565022908] [2021-01-06 21:11:29,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:11:29,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:11:29,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936293808] [2021-01-06 21:11:29,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:11:29,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:11:29,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:11:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:11:29,338 INFO L87 Difference]: Start difference. First operand 34863 states and 50094 transitions. Second operand 8 states. [2021-01-06 21:11:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:11:51,338 INFO L93 Difference]: Finished difference Result 250237 states and 359413 transitions. [2021-01-06 21:11:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:11:51,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2021-01-06 21:11:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:11:51,822 INFO L225 Difference]: With dead ends: 250237 [2021-01-06 21:11:51,823 INFO L226 Difference]: Without dead ends: 215419 [2021-01-06 21:11:51,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:11:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215419 states. [2021-01-06 21:12:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215419 to 69679. [2021-01-06 21:12:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69679 states. [2021-01-06 21:12:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69679 states to 69679 states and 99758 transitions. [2021-01-06 21:12:01,099 INFO L78 Accepts]: Start accepts. Automaton has 69679 states and 99758 transitions. Word has length 112 [2021-01-06 21:12:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:01,100 INFO L481 AbstractCegarLoop]: Abstraction has 69679 states and 99758 transitions. [2021-01-06 21:12:01,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:12:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 69679 states and 99758 transitions. [2021-01-06 21:12:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:12:01,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:01,112 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:01,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 21:12:01,112 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash -818965810, now seen corresponding path program 1 times [2021-01-06 21:12:01,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:01,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167266057] [2021-01-06 21:12:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-06 21:12:01,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167266057] [2021-01-06 21:12:01,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:01,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:12:01,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394458978] [2021-01-06 21:12:01,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:12:01,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:01,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:12:01,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:01,259 INFO L87 Difference]: Start difference. First operand 69679 states and 99758 transitions. Second operand 8 states. [2021-01-06 21:12:02,021 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-01-06 21:12:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:12:31,100 INFO L93 Difference]: Finished difference Result 285053 states and 409077 transitions. [2021-01-06 21:12:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:12:31,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2021-01-06 21:12:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:12:31,505 INFO L225 Difference]: With dead ends: 285053 [2021-01-06 21:12:31,506 INFO L226 Difference]: Without dead ends: 250235 [2021-01-06 21:12:31,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:12:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250235 states. [2021-01-06 21:12:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250235 to 121967. [2021-01-06 21:12:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121967 states. [2021-01-06 21:12:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121967 states to 121967 states and 173934 transitions. [2021-01-06 21:12:48,340 INFO L78 Accepts]: Start accepts. Automaton has 121967 states and 173934 transitions. Word has length 112 [2021-01-06 21:12:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:12:48,340 INFO L481 AbstractCegarLoop]: Abstraction has 121967 states and 173934 transitions. [2021-01-06 21:12:48,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:12:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 121967 states and 173934 transitions. [2021-01-06 21:12:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:12:48,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:12:48,353 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:12:48,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 21:12:48,354 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:12:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:12:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash 334980296, now seen corresponding path program 1 times [2021-01-06 21:12:48,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:12:48,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090050577] [2021-01-06 21:12:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:12:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:12:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 21:12:48,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090050577] [2021-01-06 21:12:48,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:12:48,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:12:48,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256929937] [2021-01-06 21:12:48,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:12:48,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:12:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:12:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:12:48,523 INFO L87 Difference]: Start difference. First operand 121967 states and 173934 transitions. Second operand 8 states. [2021-01-06 21:12:48,800 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2021-01-06 21:13:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:13:25,202 INFO L93 Difference]: Finished difference Result 319869 states and 458741 transitions. [2021-01-06 21:13:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:13:25,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2021-01-06 21:13:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:13:25,666 INFO L225 Difference]: With dead ends: 319869 [2021-01-06 21:13:25,667 INFO L226 Difference]: Without dead ends: 285051 [2021-01-06 21:13:25,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:13:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285051 states. [2021-01-06 21:13:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285051 to 156783. [2021-01-06 21:13:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156783 states. [2021-01-06 21:13:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156783 states to 156783 states and 223598 transitions. [2021-01-06 21:13:48,106 INFO L78 Accepts]: Start accepts. Automaton has 156783 states and 223598 transitions. Word has length 112 [2021-01-06 21:13:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 21:13:48,107 INFO L481 AbstractCegarLoop]: Abstraction has 156783 states and 223598 transitions. [2021-01-06 21:13:48,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 21:13:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 156783 states and 223598 transitions. [2021-01-06 21:13:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-06 21:13:48,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 21:13:48,119 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 21:13:48,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 21:13:48,119 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 21:13:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 21:13:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash -522920382, now seen corresponding path program 1 times [2021-01-06 21:13:48,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 21:13:48,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345448494] [2021-01-06 21:13:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 21:13:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 21:13:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 21:13:48,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345448494] [2021-01-06 21:13:48,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 21:13:48,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 21:13:48,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470450863] [2021-01-06 21:13:48,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 21:13:48,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 21:13:48,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 21:13:48,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 21:13:48,324 INFO L87 Difference]: Start difference. First operand 156783 states and 223598 transitions. Second operand 8 states. [2021-01-06 21:14:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 21:14:31,305 INFO L93 Difference]: Finished difference Result 354685 states and 508405 transitions. [2021-01-06 21:14:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 21:14:31,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2021-01-06 21:14:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 21:14:32,015 INFO L225 Difference]: With dead ends: 354685 [2021-01-06 21:14:32,016 INFO L226 Difference]: Without dead ends: 319867 [2021-01-06 21:14:32,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 21:14:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319867 states.