/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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:46:44,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:46:44,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:46:44,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:46:44,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:46:44,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:46:44,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:46:44,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:46:44,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:46:44,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:46:44,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:46:44,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:46:44,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:46:44,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:46:44,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:46:44,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:46:44,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:46:44,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:46:44,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:46:44,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:46:44,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:46:44,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:46:44,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:46:44,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:46:44,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:46:44,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:46:44,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:46:44,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:46:44,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:46:44,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:46:44,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:46:44,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:46:44,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:46:44,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:46:44,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:46:44,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:46:44,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:46:44,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:46:44,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:46:44,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:46:44,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:46:44,413 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 19:46:44,465 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:46:44,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:46:44,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:46:44,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:46:44,471 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:46:44,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:46:44,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:46:44,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:46:44,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:46:44,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:46:44,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:46:44,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:46:44,474 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:46:44,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:46:44,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:46:44,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:46:44,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:46:44,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:46:44,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:46:44,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:46:44,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:46:44,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:46:44,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:46:44,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:46:44,477 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:46:44,477 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 19:46:44,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:46:44,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:46:44,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:46:44,994 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:46:44,994 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:46:44,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:45,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b4d058a08/3e1992e4c40948faa5de248b252b02f2/FLAG68663cc32 [2021-01-06 19:46:45,722 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:46:45,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:45,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b4d058a08/3e1992e4c40948faa5de248b252b02f2/FLAG68663cc32 [2021-01-06 19:46:46,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b4d058a08/3e1992e4c40948faa5de248b252b02f2 [2021-01-06 19:46:46,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:46:46,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:46:46,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:46,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:46:46,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:46:46,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e836a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46, skipping insertion in model container [2021-01-06 19:46:46,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:46:46,099 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p2_new~0,GLOBAL] 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[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p3_new~0,GLOBAL] 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[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p4_new~0,GLOBAL] 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[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p5_new~0,GLOBAL] 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[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p6_new~0,GLOBAL] 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[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~c1~0,] [2021-01-06 19:46:46,377 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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2021-01-06 19:46:46,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:46,392 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~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[~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[~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[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p2_new~0,GLOBAL] 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[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p3_new~0,GLOBAL] 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[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p4_new~0,GLOBAL] 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[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p5_new~0,GLOBAL] 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[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~p6_new~0,GLOBAL] 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[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~c1~0,] [2021-01-06 19:46:46,471 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/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c[16852,16865] [2021-01-06 19:46:46,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:46:46,495 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:46:46,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46 WrapperNode [2021-01-06 19:46:46,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:46:46,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:46,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:46:46,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:46:46,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:46:46,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:46:46,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:46:46,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:46:46,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (1/1) ... [2021-01-06 19:46:46,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:46:46,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:46:46,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:46:46,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:46:46,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46: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 19:46:46,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:46:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:46:46,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:46:46,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:46:47,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:46:47,552 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2021-01-06 19:46:47,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:47 BoogieIcfgContainer [2021-01-06 19:46:47,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:46:47,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:46:47,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:46:47,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:46:47,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:46:46" (1/3) ... [2021-01-06 19:46:47,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0c1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:47, skipping insertion in model container [2021-01-06 19:46:47,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:46:46" (2/3) ... [2021-01-06 19:46:47,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0c1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:46:47, skipping insertion in model container [2021-01-06 19:46:47,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:46:47" (3/3) ... [2021-01-06 19:46:47,573 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c [2021-01-06 19:46:47,581 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:46:47,587 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:46:47,614 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:46:47,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:46:47,664 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:46:47,664 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:46:47,664 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:46:47,664 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:46:47,665 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:46:47,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:46:47,665 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:46:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2021-01-06 19:46:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:46:47,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:47,705 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] [2021-01-06 19:46:47,705 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1333844149, now seen corresponding path program 1 times [2021-01-06 19:46:47,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:47,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916480106] [2021-01-06 19:46:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:48,099 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 19:46:48,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916480106] [2021-01-06 19:46:48,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:48,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:46:48,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038762065] [2021-01-06 19:46:48,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:46:48,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:46:48,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:46:48,126 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2021-01-06 19:46:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:48,274 INFO L93 Difference]: Finished difference Result 239 states and 399 transitions. [2021-01-06 19:46:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:46:48,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:46:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:48,290 INFO L225 Difference]: With dead ends: 239 [2021-01-06 19:46:48,290 INFO L226 Difference]: Without dead ends: 139 [2021-01-06 19:46:48,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:46:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-06 19:46:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-01-06 19:46:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-06 19:46:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2021-01-06 19:46:48,352 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 37 [2021-01-06 19:46:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:48,353 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2021-01-06 19:46:48,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:46:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2021-01-06 19:46:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:46:48,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:48,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:48,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:46:48,358 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash -976812523, now seen corresponding path program 1 times [2021-01-06 19:46:48,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:48,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425935114] [2021-01-06 19:46:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:48,625 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 19:46:48,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425935114] [2021-01-06 19:46:48,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:48,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:48,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132699087] [2021-01-06 19:46:48,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:48,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:48,630 INFO L87 Difference]: Start difference. First operand 139 states and 195 transitions. Second operand 3 states. [2021-01-06 19:46:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:48,692 INFO L93 Difference]: Finished difference Result 311 states and 471 transitions. [2021-01-06 19:46:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:48,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:46:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:48,699 INFO L225 Difference]: With dead ends: 311 [2021-01-06 19:46:48,701 INFO L226 Difference]: Without dead ends: 219 [2021-01-06 19:46:48,703 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 19:46:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-01-06 19:46:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2021-01-06 19:46:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-06 19:46:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2021-01-06 19:46:48,751 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 77 [2021-01-06 19:46:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:48,751 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2021-01-06 19:46:48,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2021-01-06 19:46:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:46:48,757 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:48,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, 1] [2021-01-06 19:46:48,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:46:48,758 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1251497554, now seen corresponding path program 1 times [2021-01-06 19:46:48,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:48,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127808099] [2021-01-06 19:46:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:48,985 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 19:46:48,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127808099] [2021-01-06 19:46:48,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:48,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:48,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037701867] [2021-01-06 19:46:48,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:48,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:48,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:48,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:48,989 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand 3 states. [2021-01-06 19:46:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,019 INFO L93 Difference]: Finished difference Result 533 states and 829 transitions. [2021-01-06 19:46:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:46:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,024 INFO L225 Difference]: With dead ends: 533 [2021-01-06 19:46:49,024 INFO L226 Difference]: Without dead ends: 363 [2021-01-06 19:46:49,026 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 19:46:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-01-06 19:46:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2021-01-06 19:46:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2021-01-06 19:46:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2021-01-06 19:46:49,050 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 78 [2021-01-06 19:46:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:49,051 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2021-01-06 19:46:49,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2021-01-06 19:46:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:46:49,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:49,053 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] [2021-01-06 19:46:49,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:46:49,054 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2103523781, now seen corresponding path program 1 times [2021-01-06 19:46:49,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:49,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047803744] [2021-01-06 19:46:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:49,182 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 19:46:49,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047803744] [2021-01-06 19:46:49,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:49,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:49,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728834902] [2021-01-06 19:46:49,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:49,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:49,185 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2021-01-06 19:46:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,221 INFO L93 Difference]: Finished difference Result 941 states and 1482 transitions. [2021-01-06 19:46:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:46:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,226 INFO L225 Difference]: With dead ends: 941 [2021-01-06 19:46:49,226 INFO L226 Difference]: Without dead ends: 627 [2021-01-06 19:46:49,229 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 19:46:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-01-06 19:46:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2021-01-06 19:46:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2021-01-06 19:46:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 972 transitions. [2021-01-06 19:46:49,260 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 972 transitions. Word has length 79 [2021-01-06 19:46:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:49,261 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 972 transitions. [2021-01-06 19:46:49,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 972 transitions. [2021-01-06 19:46:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:46:49,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:49,263 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 19:46:49,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:46:49,264 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -508152546, now seen corresponding path program 1 times [2021-01-06 19:46:49,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:49,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002239795] [2021-01-06 19:46:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:49,401 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 19:46:49,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002239795] [2021-01-06 19:46:49,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:49,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:49,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454318264] [2021-01-06 19:46:49,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:49,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:49,404 INFO L87 Difference]: Start difference. First operand 625 states and 972 transitions. Second operand 3 states. [2021-01-06 19:46:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,457 INFO L93 Difference]: Finished difference Result 1685 states and 2662 transitions. [2021-01-06 19:46:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:46:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,465 INFO L225 Difference]: With dead ends: 1685 [2021-01-06 19:46:49,465 INFO L226 Difference]: Without dead ends: 1107 [2021-01-06 19:46:49,467 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 19:46:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-01-06 19:46:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1105. [2021-01-06 19:46:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2021-01-06 19:46:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1728 transitions. [2021-01-06 19:46:49,514 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1728 transitions. Word has length 80 [2021-01-06 19:46:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:49,514 INFO L481 AbstractCegarLoop]: Abstraction has 1105 states and 1728 transitions. [2021-01-06 19:46:49,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1728 transitions. [2021-01-06 19:46:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:46:49,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:49,516 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 19:46:49,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:46:49,516 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1230501237, now seen corresponding path program 1 times [2021-01-06 19:46:49,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:49,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084438405] [2021-01-06 19:46:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:49,646 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 19:46:49,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084438405] [2021-01-06 19:46:49,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:49,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:49,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423610006] [2021-01-06 19:46:49,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:49,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:49,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:49,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:49,652 INFO L87 Difference]: Start difference. First operand 1105 states and 1728 transitions. Second operand 3 states. [2021-01-06 19:46:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:49,720 INFO L93 Difference]: Finished difference Result 3029 states and 4770 transitions. [2021-01-06 19:46:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:46:49,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 19:46:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:49,732 INFO L225 Difference]: With dead ends: 3029 [2021-01-06 19:46:49,732 INFO L226 Difference]: Without dead ends: 1971 [2021-01-06 19:46:49,734 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 19:46:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2021-01-06 19:46:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1969. [2021-01-06 19:46:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 19:46:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 3072 transitions. [2021-01-06 19:46:49,807 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 3072 transitions. Word has length 81 [2021-01-06 19:46:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:49,808 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 3072 transitions. [2021-01-06 19:46:49,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:46:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 3072 transitions. [2021-01-06 19:46:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:46:49,814 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:49,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:49,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:46:49,815 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash -937142130, now seen corresponding path program 1 times [2021-01-06 19:46:49,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:49,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887528781] [2021-01-06 19:46:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:50,163 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 19:46:50,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887528781] [2021-01-06 19:46:50,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:50,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:50,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452088144] [2021-01-06 19:46:50,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:50,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:50,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:50,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:50,170 INFO L87 Difference]: Start difference. First operand 1969 states and 3072 transitions. Second operand 8 states. [2021-01-06 19:46:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:50,826 INFO L93 Difference]: Finished difference Result 12301 states and 19142 transitions. [2021-01-06 19:46:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:50,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2021-01-06 19:46:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:50,882 INFO L225 Difference]: With dead ends: 12301 [2021-01-06 19:46:50,883 INFO L226 Difference]: Without dead ends: 10379 [2021-01-06 19:46:50,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2021-01-06 19:46:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10369. [2021-01-06 19:46:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10369 states. [2021-01-06 19:46:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10369 states to 10369 states and 16080 transitions. [2021-01-06 19:46:51,498 INFO L78 Accepts]: Start accepts. Automaton has 10369 states and 16080 transitions. Word has length 82 [2021-01-06 19:46:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:51,499 INFO L481 AbstractCegarLoop]: Abstraction has 10369 states and 16080 transitions. [2021-01-06 19:46:51,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 10369 states and 16080 transitions. [2021-01-06 19:46:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:46:51,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:51,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:51,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:46:51,501 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1325136096, now seen corresponding path program 1 times [2021-01-06 19:46:51,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:51,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94414970] [2021-01-06 19:46:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:51,716 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 19:46:51,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94414970] [2021-01-06 19:46:51,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:51,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:51,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267808811] [2021-01-06 19:46:51,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:51,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:51,719 INFO L87 Difference]: Start difference. First operand 10369 states and 16080 transitions. Second operand 8 states. [2021-01-06 19:46:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:53,780 INFO L93 Difference]: Finished difference Result 57823 states and 89911 transitions. [2021-01-06 19:46:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:46:53,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2021-01-06 19:46:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:53,980 INFO L225 Difference]: With dead ends: 57823 [2021-01-06 19:46:53,980 INFO L226 Difference]: Without dead ends: 47501 [2021-01-06 19:46:54,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:46:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47501 states. [2021-01-06 19:46:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47501 to 20689. [2021-01-06 19:46:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20689 states. [2021-01-06 19:46:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20689 states to 20689 states and 31728 transitions. [2021-01-06 19:46:55,569 INFO L78 Accepts]: Start accepts. Automaton has 20689 states and 31728 transitions. Word has length 83 [2021-01-06 19:46:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:55,569 INFO L481 AbstractCegarLoop]: Abstraction has 20689 states and 31728 transitions. [2021-01-06 19:46:55,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20689 states and 31728 transitions. [2021-01-06 19:46:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 19:46:55,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:55,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:55,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:46:55,572 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1487130877, now seen corresponding path program 1 times [2021-01-06 19:46:55,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:55,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651128846] [2021-01-06 19:46:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:55,704 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 19:46:55,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651128846] [2021-01-06 19:46:55,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:55,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:46:55,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906878812] [2021-01-06 19:46:55,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:46:55,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:46:55,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:46:55,713 INFO L87 Difference]: Start difference. First operand 20689 states and 31728 transitions. Second operand 8 states. [2021-01-06 19:46:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:46:57,855 INFO L93 Difference]: Finished difference Result 42867 states and 64945 transitions. [2021-01-06 19:46:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:46:57,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2021-01-06 19:46:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:46:57,965 INFO L225 Difference]: With dead ends: 42867 [2021-01-06 19:46:57,966 INFO L226 Difference]: Without dead ends: 42865 [2021-01-06 19:46:57,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:46:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42865 states. [2021-01-06 19:46:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42865 to 21841. [2021-01-06 19:46:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21841 states. [2021-01-06 19:46:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21841 states to 21841 states and 32880 transitions. [2021-01-06 19:46:59,468 INFO L78 Accepts]: Start accepts. Automaton has 21841 states and 32880 transitions. Word has length 84 [2021-01-06 19:46:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:46:59,469 INFO L481 AbstractCegarLoop]: Abstraction has 21841 states and 32880 transitions. [2021-01-06 19:46:59,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:46:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21841 states and 32880 transitions. [2021-01-06 19:46:59,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:46:59,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:46:59,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:46:59,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:46:59,472 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:46:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:46:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1091004264, now seen corresponding path program 1 times [2021-01-06 19:46:59,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:46:59,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141598946] [2021-01-06 19:46:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:46:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:46:59,548 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 19:46:59,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141598946] [2021-01-06 19:46:59,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:46:59,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:46:59,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674604584] [2021-01-06 19:46:59,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:46:59,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:46:59,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:46:59,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:46:59,552 INFO L87 Difference]: Start difference. First operand 21841 states and 32880 transitions. Second operand 3 states. [2021-01-06 19:47:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:01,738 INFO L93 Difference]: Finished difference Result 61045 states and 91538 transitions. [2021-01-06 19:47:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:01,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:47:01,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:01,907 INFO L225 Difference]: With dead ends: 61045 [2021-01-06 19:47:01,907 INFO L226 Difference]: Without dead ends: 39251 [2021-01-06 19:47:01,934 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 19:47:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39251 states. [2021-01-06 19:47:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39251 to 38897. [2021-01-06 19:47:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38897 states. [2021-01-06 19:47:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38897 states to 38897 states and 57648 transitions. [2021-01-06 19:47:03,793 INFO L78 Accepts]: Start accepts. Automaton has 38897 states and 57648 transitions. Word has length 85 [2021-01-06 19:47:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:03,793 INFO L481 AbstractCegarLoop]: Abstraction has 38897 states and 57648 transitions. [2021-01-06 19:47:03,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 38897 states and 57648 transitions. [2021-01-06 19:47:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:47:03,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:03,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:47:03,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:47:03,796 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1624392677, now seen corresponding path program 1 times [2021-01-06 19:47:03,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:03,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194423702] [2021-01-06 19:47:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:03,853 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 19:47:03,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194423702] [2021-01-06 19:47:03,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:03,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:03,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907308584] [2021-01-06 19:47:03,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:03,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:03,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:03,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:03,856 INFO L87 Difference]: Start difference. First operand 38897 states and 57648 transitions. Second operand 3 states. [2021-01-06 19:47:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:06,548 INFO L93 Difference]: Finished difference Result 78264 states and 116406 transitions. [2021-01-06 19:47:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:06,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 19:47:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:06,615 INFO L225 Difference]: With dead ends: 78264 [2021-01-06 19:47:06,615 INFO L226 Difference]: Without dead ends: 56469 [2021-01-06 19:47:06,646 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 19:47:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56469 states. [2021-01-06 19:47:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56469 to 56467. [2021-01-06 19:47:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56467 states. [2021-01-06 19:47:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56467 states to 56467 states and 83186 transitions. [2021-01-06 19:47:09,430 INFO L78 Accepts]: Start accepts. Automaton has 56467 states and 83186 transitions. Word has length 86 [2021-01-06 19:47:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:09,431 INFO L481 AbstractCegarLoop]: Abstraction has 56467 states and 83186 transitions. [2021-01-06 19:47:09,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56467 states and 83186 transitions. [2021-01-06 19:47:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:47:09,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:09,464 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, 1, 1, 1, 1] [2021-01-06 19:47:09,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:47:09,465 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:09,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1174390705, now seen corresponding path program 1 times [2021-01-06 19:47:09,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:09,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639897301] [2021-01-06 19:47:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:47:09,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639897301] [2021-01-06 19:47:09,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:09,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:47:09,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232674039] [2021-01-06 19:47:09,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:47:09,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:47:09,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:47:09,852 INFO L87 Difference]: Start difference. First operand 56467 states and 83186 transitions. Second operand 8 states. [2021-01-06 19:47:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:14,955 INFO L93 Difference]: Finished difference Result 148721 states and 221369 transitions. [2021-01-06 19:47:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:47:14,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2021-01-06 19:47:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:15,134 INFO L225 Difference]: With dead ends: 148721 [2021-01-06 19:47:15,134 INFO L226 Difference]: Without dead ends: 123999 [2021-01-06 19:47:15,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-06 19:47:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123999 states. [2021-01-06 19:47:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123999 to 79219. [2021-01-06 19:47:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79219 states. [2021-01-06 19:47:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79219 states to 79219 states and 116786 transitions. [2021-01-06 19:47:19,464 INFO L78 Accepts]: Start accepts. Automaton has 79219 states and 116786 transitions. Word has length 116 [2021-01-06 19:47:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:19,464 INFO L481 AbstractCegarLoop]: Abstraction has 79219 states and 116786 transitions. [2021-01-06 19:47:19,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:47:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 79219 states and 116786 transitions. [2021-01-06 19:47:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:47:19,671 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:19,671 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, 1, 1, 1, 1] [2021-01-06 19:47:19,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:47:19,672 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1916811329, now seen corresponding path program 1 times [2021-01-06 19:47:19,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:19,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316436989] [2021-01-06 19:47:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:19,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316436989] [2021-01-06 19:47:19,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:19,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:19,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739118042] [2021-01-06 19:47:19,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:19,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:19,749 INFO L87 Difference]: Start difference. First operand 79219 states and 116786 transitions. Second operand 3 states. [2021-01-06 19:47:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:25,175 INFO L93 Difference]: Finished difference Result 188351 states and 277653 transitions. [2021-01-06 19:47:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:25,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:47:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:25,395 INFO L225 Difference]: With dead ends: 188351 [2021-01-06 19:47:25,395 INFO L226 Difference]: Without dead ends: 128637 [2021-01-06 19:47:25,450 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 19:47:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128637 states. [2021-01-06 19:47:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128637 to 123339. [2021-01-06 19:47:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123339 states. [2021-01-06 19:47:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123339 states to 123339 states and 180323 transitions. [2021-01-06 19:47:31,887 INFO L78 Accepts]: Start accepts. Automaton has 123339 states and 180323 transitions. Word has length 116 [2021-01-06 19:47:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:31,888 INFO L481 AbstractCegarLoop]: Abstraction has 123339 states and 180323 transitions. [2021-01-06 19:47:31,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 123339 states and 180323 transitions. [2021-01-06 19:47:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:47:31,929 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:31,929 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, 1, 1, 1, 1] [2021-01-06 19:47:31,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:47:31,929 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1894740177, now seen corresponding path program 1 times [2021-01-06 19:47:31,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:31,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565424701] [2021-01-06 19:47:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:31,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565424701] [2021-01-06 19:47:31,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:31,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:31,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411098651] [2021-01-06 19:47:31,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:31,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:31,999 INFO L87 Difference]: Start difference. First operand 123339 states and 180323 transitions. Second operand 3 states. [2021-01-06 19:47:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:47:39,904 INFO L93 Difference]: Finished difference Result 277866 states and 405635 transitions. [2021-01-06 19:47:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:47:39,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:47:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:47:40,228 INFO L225 Difference]: With dead ends: 277866 [2021-01-06 19:47:40,228 INFO L226 Difference]: Without dead ends: 189592 [2021-01-06 19:47:40,311 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 19:47:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189592 states. [2021-01-06 19:47:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189592 to 183638. [2021-01-06 19:47:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183638 states. [2021-01-06 19:47:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183638 states to 183638 states and 265785 transitions. [2021-01-06 19:47:49,997 INFO L78 Accepts]: Start accepts. Automaton has 183638 states and 265785 transitions. Word has length 116 [2021-01-06 19:47:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:47:49,998 INFO L481 AbstractCegarLoop]: Abstraction has 183638 states and 265785 transitions. [2021-01-06 19:47:49,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:47:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 183638 states and 265785 transitions. [2021-01-06 19:47:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:47:50,066 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:47:50,066 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, 1, 1, 1, 1] [2021-01-06 19:47:50,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:47:50,066 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:47:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:47:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 414282081, now seen corresponding path program 1 times [2021-01-06 19:47:50,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:47:50,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770468519] [2021-01-06 19:47:50,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:47:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:47:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:47:50,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770468519] [2021-01-06 19:47:50,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:47:50,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:47:50,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273152752] [2021-01-06 19:47:50,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:47:50,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:47:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:47:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:47:50,162 INFO L87 Difference]: Start difference. First operand 183638 states and 265785 transitions. Second operand 3 states. [2021-01-06 19:48:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:01,361 INFO L93 Difference]: Finished difference Result 373018 states and 538599 transitions. [2021-01-06 19:48:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:48:01,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:48:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:01,827 INFO L225 Difference]: With dead ends: 373018 [2021-01-06 19:48:01,827 INFO L226 Difference]: Without dead ends: 257048 [2021-01-06 19:48:01,930 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 19:48:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257048 states. [2021-01-06 19:48:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257048 to 245070. [2021-01-06 19:48:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245070 states. [2021-01-06 19:48:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245070 states to 245070 states and 350917 transitions. [2021-01-06 19:48:15,238 INFO L78 Accepts]: Start accepts. Automaton has 245070 states and 350917 transitions. Word has length 116 [2021-01-06 19:48:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:15,239 INFO L481 AbstractCegarLoop]: Abstraction has 245070 states and 350917 transitions. [2021-01-06 19:48:15,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 245070 states and 350917 transitions. [2021-01-06 19:48:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:48:15,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:15,284 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, 1, 1, 1, 1] [2021-01-06 19:48:15,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:48:15,284 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 841628145, now seen corresponding path program 1 times [2021-01-06 19:48:15,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:15,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291680115] [2021-01-06 19:48:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:48:15,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291680115] [2021-01-06 19:48:15,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:15,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:48:15,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161633929] [2021-01-06 19:48:15,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:48:15,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:48:15,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:48:15,356 INFO L87 Difference]: Start difference. First operand 245070 states and 350917 transitions. Second operand 3 states. [2021-01-06 19:48:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:48:27,843 INFO L93 Difference]: Finished difference Result 396088 states and 564875 transitions. [2021-01-06 19:48:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:48:27,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:48:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:48:28,281 INFO L225 Difference]: With dead ends: 396088 [2021-01-06 19:48:28,281 INFO L226 Difference]: Without dead ends: 256222 [2021-01-06 19:48:28,388 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 19:48:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256222 states. [2021-01-06 19:48:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256222 to 246538. [2021-01-06 19:48:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246538 states. [2021-01-06 19:48:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246538 states to 246538 states and 348687 transitions. [2021-01-06 19:48:41,388 INFO L78 Accepts]: Start accepts. Automaton has 246538 states and 348687 transitions. Word has length 116 [2021-01-06 19:48:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:48:41,388 INFO L481 AbstractCegarLoop]: Abstraction has 246538 states and 348687 transitions. [2021-01-06 19:48:41,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:48:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 246538 states and 348687 transitions. [2021-01-06 19:48:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:48:41,434 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:48:41,435 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, 1, 1, 1, 1] [2021-01-06 19:48:41,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:48:41,435 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:48:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:48:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1074667247, now seen corresponding path program 1 times [2021-01-06 19:48:41,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:48:41,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681316363] [2021-01-06 19:48:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:48:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:48:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:48:41,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681316363] [2021-01-06 19:48:41,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:48:41,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:48:41,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270435808] [2021-01-06 19:48:41,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:48:41,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:48:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:48:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:48:41,706 INFO L87 Difference]: Start difference. First operand 246538 states and 348687 transitions. Second operand 8 states. [2021-01-06 19:49:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:49:07,781 INFO L93 Difference]: Finished difference Result 608984 states and 870939 transitions. [2021-01-06 19:49:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:49:07,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2021-01-06 19:49:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:49:08,771 INFO L225 Difference]: With dead ends: 608984 [2021-01-06 19:49:08,771 INFO L226 Difference]: Without dead ends: 539208 [2021-01-06 19:49:08,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:49:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539208 states. [2021-01-06 19:49:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539208 to 313478. [2021-01-06 19:49:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313478 states. [2021-01-06 19:49:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313478 states to 313478 states and 443741 transitions. [2021-01-06 19:49:27,878 INFO L78 Accepts]: Start accepts. Automaton has 313478 states and 443741 transitions. Word has length 116 [2021-01-06 19:49:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:49:27,879 INFO L481 AbstractCegarLoop]: Abstraction has 313478 states and 443741 transitions. [2021-01-06 19:49:27,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:49:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 313478 states and 443741 transitions. [2021-01-06 19:49:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:49:27,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:49:27,929 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, 1, 1, 1, 1] [2021-01-06 19:49:27,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:49:27,929 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:49:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:49:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 322071153, now seen corresponding path program 1 times [2021-01-06 19:49:27,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:49:27,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429381887] [2021-01-06 19:49:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:49:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:49:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:49:28,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429381887] [2021-01-06 19:49:28,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:49:28,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:49:28,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302350334] [2021-01-06 19:49:28,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:49:28,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:49:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:49:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:49:28,113 INFO L87 Difference]: Start difference. First operand 313478 states and 443741 transitions. Second operand 8 states. [2021-01-06 19:49:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:49:56,499 INFO L93 Difference]: Finished difference Result 634712 states and 906863 transitions. [2021-01-06 19:49:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 19:49:56,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2021-01-06 19:49:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:49:57,665 INFO L225 Difference]: With dead ends: 634712 [2021-01-06 19:49:57,665 INFO L226 Difference]: Without dead ends: 596118 [2021-01-06 19:49:57,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:49:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596118 states. [2021-01-06 19:50:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596118 to 351302. [2021-01-06 19:50:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351302 states. [2021-01-06 19:50:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351302 states to 351302 states and 497629 transitions. [2021-01-06 19:50:19,745 INFO L78 Accepts]: Start accepts. Automaton has 351302 states and 497629 transitions. Word has length 116 [2021-01-06 19:50:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:50:19,745 INFO L481 AbstractCegarLoop]: Abstraction has 351302 states and 497629 transitions. [2021-01-06 19:50:19,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:50:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 351302 states and 497629 transitions. [2021-01-06 19:50:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:50:19,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:50:19,813 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, 1, 1, 1, 1] [2021-01-06 19:50:19,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:50:19,813 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:50:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:50:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1614642119, now seen corresponding path program 1 times [2021-01-06 19:50:19,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:50:19,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378249759] [2021-01-06 19:50:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:50:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:50:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:50:19,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378249759] [2021-01-06 19:50:19,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:50:19,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:50:19,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293420782] [2021-01-06 19:50:19,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:50:19,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:50:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:50:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:50:19,975 INFO L87 Difference]: Start difference. First operand 351302 states and 497629 transitions. Second operand 8 states.