/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.6.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:58:34,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:58:34,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:58:34,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:58:34,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:58:34,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:58:34,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:58:34,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:58:34,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:58:34,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:58:34,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:58:34,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:58:34,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:58:34,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:58:34,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:58:34,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:58:34,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:58:34,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:58:34,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:58:34,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:58:34,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:58:34,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:58:34,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:58:34,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:58:34,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:58:34,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:58:34,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:58:34,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:58:34,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:58:34,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:58:34,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:58:34,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:58:34,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:58:34,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:58:34,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:58:34,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:58:34,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:58:34,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:58:34,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:58:34,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:58:34,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:58:34,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:58:34,274 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:58:34,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:58:34,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:58:34,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:58:34,276 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:58:34,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:58:34,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:58:34,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:58:34,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:58:34,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:58:34,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:58:34,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:58:34,278 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:58:34,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:58:34,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:58:34,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:58:34,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:58:34,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:58:34,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:58:34,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:58:34,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:58:34,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:58:34,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:58:34,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:58:34,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:58:34,280 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 [2020-12-23 09:58:34,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:58:34,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:58:34,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:58:34,667 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:58:34,668 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:58:34,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2020-12-23 09:58:34,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4701346a/e852ddd2aeac41be8173c94379f349f1/FLAG5692ec895 [2020-12-23 09:58:35,506 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:58:35,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2020-12-23 09:58:35,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4701346a/e852ddd2aeac41be8173c94379f349f1/FLAG5692ec895 [2020-12-23 09:58:35,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4701346a/e852ddd2aeac41be8173c94379f349f1 [2020-12-23 09:58:35,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:58:35,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:58:35,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:58:35,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:58:35,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:58:35,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:58:35" (1/1) ... [2020-12-23 09:58:35,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15742fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:35, skipping insertion in model container [2020-12-23 09:58:35,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:58:35" (1/1) ... [2020-12-23 09:58:35,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:58:35,881 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[~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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~mode6~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~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[~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[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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,] [2020-12-23 09:58:36,253 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.6.ufo.BOUNDED-12.pals.c[15075,15088] [2020-12-23 09:58:36,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:58:36,268 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[~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[~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[~mode2~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[~mode3~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[~mode4~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[~mode5~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[~mode6~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~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[~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[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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,] [2020-12-23 09:58:36,327 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.6.ufo.BOUNDED-12.pals.c[15075,15088] [2020-12-23 09:58:36,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:58:36,348 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:58:36,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36 WrapperNode [2020-12-23 09:58:36,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:58:36,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:58:36,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:58:36,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:58:36,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:58:36,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:58:36,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:58:36,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:58:36,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (1/1) ... [2020-12-23 09:58:36,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:58:36,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:58:36,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:58:36,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:58:36,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (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 [2020-12-23 09:58:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:58:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:58:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:58:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:58:37,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:58:37,414 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-23 09:58:37,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:58:37 BoogieIcfgContainer [2020-12-23 09:58:37,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:58:37,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:58:37,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:58:37,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:58:37,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:58:35" (1/3) ... [2020-12-23 09:58:37,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f909e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:58:37, skipping insertion in model container [2020-12-23 09:58:37,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:58:36" (2/3) ... [2020-12-23 09:58:37,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f909e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:58:37, skipping insertion in model container [2020-12-23 09:58:37,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:58:37" (3/3) ... [2020-12-23 09:58:37,431 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2020-12-23 09:58:37,438 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:58:37,443 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:58:37,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:58:37,509 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:58:37,509 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:58:37,509 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:58:37,509 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:58:37,509 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:58:37,509 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:58:37,510 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:58:37,510 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:58:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-12-23 09:58:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:58:37,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:37,544 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] [2020-12-23 09:58:37,545 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1259035486, now seen corresponding path program 1 times [2020-12-23 09:58:37,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:37,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046151186] [2020-12-23 09:58:37,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:37,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046151186] [2020-12-23 09:58:37,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:37,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:58:37,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334418947] [2020-12-23 09:58:37,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 09:58:37,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 09:58:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:58:37,822 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2020-12-23 09:58:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:37,852 INFO L93 Difference]: Finished difference Result 175 states and 290 transitions. [2020-12-23 09:58:37,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 09:58:37,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 09:58:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:37,866 INFO L225 Difference]: With dead ends: 175 [2020-12-23 09:58:37,867 INFO L226 Difference]: Without dead ends: 106 [2020-12-23 09:58:37,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:58:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-23 09:58:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-23 09:58:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-23 09:58:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 181 transitions. [2020-12-23 09:58:37,918 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 181 transitions. Word has length 37 [2020-12-23 09:58:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:37,919 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 181 transitions. [2020-12-23 09:58:37,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 09:58:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2020-12-23 09:58:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:58:37,921 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:37,922 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] [2020-12-23 09:58:37,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:58:37,922 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1533795100, now seen corresponding path program 1 times [2020-12-23 09:58:37,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:37,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494139171] [2020-12-23 09:58:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:38,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494139171] [2020-12-23 09:58:38,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:38,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:58:38,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240277807] [2020-12-23 09:58:38,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:58:38,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:58:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:58:38,039 INFO L87 Difference]: Start difference. First operand 106 states and 181 transitions. Second operand 5 states. [2020-12-23 09:58:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:38,151 INFO L93 Difference]: Finished difference Result 170 states and 280 transitions. [2020-12-23 09:58:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:58:38,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 09:58:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:38,154 INFO L225 Difference]: With dead ends: 170 [2020-12-23 09:58:38,154 INFO L226 Difference]: Without dead ends: 106 [2020-12-23 09:58:38,156 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 [2020-12-23 09:58:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-12-23 09:58:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-12-23 09:58:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-23 09:58:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2020-12-23 09:58:38,167 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 37 [2020-12-23 09:58:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:38,167 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 141 transitions. [2020-12-23 09:58:38,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:58:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2020-12-23 09:58:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:38,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:38,171 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] [2020-12-23 09:58:38,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:58:38,171 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1950823117, now seen corresponding path program 1 times [2020-12-23 09:58:38,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:38,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035937345] [2020-12-23 09:58:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:38,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035937345] [2020-12-23 09:58:38,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:38,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:38,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367701442] [2020-12-23 09:58:38,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:38,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:38,361 INFO L87 Difference]: Start difference. First operand 106 states and 141 transitions. Second operand 3 states. [2020-12-23 09:58:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:38,393 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2020-12-23 09:58:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:38,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 09:58:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:38,396 INFO L225 Difference]: With dead ends: 220 [2020-12-23 09:58:38,396 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 09:58:38,397 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 [2020-12-23 09:58:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 09:58:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2020-12-23 09:58:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-23 09:58:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 224 transitions. [2020-12-23 09:58:38,416 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 224 transitions. Word has length 76 [2020-12-23 09:58:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:38,417 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 224 transitions. [2020-12-23 09:58:38,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 224 transitions. [2020-12-23 09:58:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:38,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:38,419 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] [2020-12-23 09:58:38,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:58:38,419 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 699917825, now seen corresponding path program 1 times [2020-12-23 09:58:38,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:38,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738012626] [2020-12-23 09:58:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:38,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738012626] [2020-12-23 09:58:38,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:38,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:38,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672067877] [2020-12-23 09:58:38,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:38,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:38,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:38,583 INFO L87 Difference]: Start difference. First operand 158 states and 224 transitions. Second operand 3 states. [2020-12-23 09:58:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:38,633 INFO L93 Difference]: Finished difference Result 370 states and 560 transitions. [2020-12-23 09:58:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:38,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 09:58:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:38,644 INFO L225 Difference]: With dead ends: 370 [2020-12-23 09:58:38,644 INFO L226 Difference]: Without dead ends: 258 [2020-12-23 09:58:38,647 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 [2020-12-23 09:58:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-12-23 09:58:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2020-12-23 09:58:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-12-23 09:58:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2020-12-23 09:58:38,704 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 76 [2020-12-23 09:58:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:38,705 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2020-12-23 09:58:38,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2020-12-23 09:58:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:38,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:38,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:58:38,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:58:38,710 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash -45664905, now seen corresponding path program 1 times [2020-12-23 09:58:38,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:38,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728714146] [2020-12-23 09:58:38,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:38,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728714146] [2020-12-23 09:58:38,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:38,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:38,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124682547] [2020-12-23 09:58:38,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:38,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:38,884 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 3 states. [2020-12-23 09:58:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:38,924 INFO L93 Difference]: Finished difference Result 652 states and 1005 transitions. [2020-12-23 09:58:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:38,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 09:58:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:38,928 INFO L225 Difference]: With dead ends: 652 [2020-12-23 09:58:38,928 INFO L226 Difference]: Without dead ends: 442 [2020-12-23 09:58:38,929 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 [2020-12-23 09:58:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-12-23 09:58:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2020-12-23 09:58:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 09:58:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 667 transitions. [2020-12-23 09:58:38,958 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 667 transitions. Word has length 76 [2020-12-23 09:58:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:38,959 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 667 transitions. [2020-12-23 09:58:38,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 667 transitions. [2020-12-23 09:58:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:38,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:38,960 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] [2020-12-23 09:58:38,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:58:38,961 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1985695763, now seen corresponding path program 1 times [2020-12-23 09:58:38,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:38,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255674313] [2020-12-23 09:58:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:39,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255674313] [2020-12-23 09:58:39,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:39,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:39,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306864590] [2020-12-23 09:58:39,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:39,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:39,108 INFO L87 Difference]: Start difference. First operand 440 states and 667 transitions. Second operand 3 states. [2020-12-23 09:58:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:39,196 INFO L93 Difference]: Finished difference Result 1180 states and 1829 transitions. [2020-12-23 09:58:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:39,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 09:58:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:39,207 INFO L225 Difference]: With dead ends: 1180 [2020-12-23 09:58:39,207 INFO L226 Difference]: Without dead ends: 786 [2020-12-23 09:58:39,209 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 [2020-12-23 09:58:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-12-23 09:58:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2020-12-23 09:58:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-12-23 09:58:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1199 transitions. [2020-12-23 09:58:39,266 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1199 transitions. Word has length 76 [2020-12-23 09:58:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:39,268 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 1199 transitions. [2020-12-23 09:58:39,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1199 transitions. [2020-12-23 09:58:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:39,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:39,273 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] [2020-12-23 09:58:39,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:58:39,274 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 714986851, now seen corresponding path program 1 times [2020-12-23 09:58:39,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:39,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763721963] [2020-12-23 09:58:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:39,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763721963] [2020-12-23 09:58:39,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:39,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:58:39,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92162592] [2020-12-23 09:58:39,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:58:39,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:58:39,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:58:39,460 INFO L87 Difference]: Start difference. First operand 784 states and 1199 transitions. Second operand 7 states. [2020-12-23 09:58:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:39,715 INFO L93 Difference]: Finished difference Result 2260 states and 3505 transitions. [2020-12-23 09:58:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:58:39,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2020-12-23 09:58:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:39,736 INFO L225 Difference]: With dead ends: 2260 [2020-12-23 09:58:39,736 INFO L226 Difference]: Without dead ends: 1522 [2020-12-23 09:58:39,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-12-23 09:58:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-12-23 09:58:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1520. [2020-12-23 09:58:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-12-23 09:58:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2343 transitions. [2020-12-23 09:58:39,859 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2343 transitions. Word has length 76 [2020-12-23 09:58:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:39,859 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 2343 transitions. [2020-12-23 09:58:39,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:58:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2343 transitions. [2020-12-23 09:58:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 09:58:39,860 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:39,860 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] [2020-12-23 09:58:39,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:58:39,861 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1224459941, now seen corresponding path program 1 times [2020-12-23 09:58:39,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:39,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522890021] [2020-12-23 09:58:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:40,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522890021] [2020-12-23 09:58:40,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:40,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:58:40,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806045598] [2020-12-23 09:58:40,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:58:40,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:40,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:58:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:58:40,018 INFO L87 Difference]: Start difference. First operand 1520 states and 2343 transitions. Second operand 8 states. [2020-12-23 09:58:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:41,264 INFO L93 Difference]: Finished difference Result 19208 states and 29907 transitions. [2020-12-23 09:58:41,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 09:58:41,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-12-23 09:58:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:41,355 INFO L225 Difference]: With dead ends: 19208 [2020-12-23 09:58:41,355 INFO L226 Difference]: Without dead ends: 17734 [2020-12-23 09:58:41,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-12-23 09:58:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17734 states. [2020-12-23 09:58:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17734 to 2992. [2020-12-23 09:58:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2020-12-23 09:58:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 4575 transitions. [2020-12-23 09:58:41,757 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 4575 transitions. Word has length 76 [2020-12-23 09:58:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:41,758 INFO L481 AbstractCegarLoop]: Abstraction has 2992 states and 4575 transitions. [2020-12-23 09:58:41,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:58:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 4575 transitions. [2020-12-23 09:58:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:58:41,759 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:41,759 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] [2020-12-23 09:58:41,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:58:41,760 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1530728779, now seen corresponding path program 1 times [2020-12-23 09:58:41,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:41,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429560574] [2020-12-23 09:58:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:41,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429560574] [2020-12-23 09:58:41,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:41,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:41,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996944117] [2020-12-23 09:58:41,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:41,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:41,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:41,849 INFO L87 Difference]: Start difference. First operand 2992 states and 4575 transitions. Second operand 3 states. [2020-12-23 09:58:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:42,149 INFO L93 Difference]: Finished difference Result 7508 states and 11425 transitions. [2020-12-23 09:58:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:42,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:58:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:42,172 INFO L225 Difference]: With dead ends: 7508 [2020-12-23 09:58:42,172 INFO L226 Difference]: Without dead ends: 4562 [2020-12-23 09:58:42,178 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 [2020-12-23 09:58:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2020-12-23 09:58:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 4560. [2020-12-23 09:58:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4560 states. [2020-12-23 09:58:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 6799 transitions. [2020-12-23 09:58:42,500 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 6799 transitions. Word has length 78 [2020-12-23 09:58:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:42,502 INFO L481 AbstractCegarLoop]: Abstraction has 4560 states and 6799 transitions. [2020-12-23 09:58:42,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 6799 transitions. [2020-12-23 09:58:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:58:42,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:42,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:58:42,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:58:42,504 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:42,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1464235267, now seen corresponding path program 1 times [2020-12-23 09:58:42,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:42,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864947837] [2020-12-23 09:58:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:42,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864947837] [2020-12-23 09:58:42,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:42,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:58:42,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912050479] [2020-12-23 09:58:42,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:58:42,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:58:42,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:58:42,932 INFO L87 Difference]: Start difference. First operand 4560 states and 6799 transitions. Second operand 8 states. [2020-12-23 09:58:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:43,752 INFO L93 Difference]: Finished difference Result 11318 states and 16938 transitions. [2020-12-23 09:58:43,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:58:43,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2020-12-23 09:58:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:43,787 INFO L225 Difference]: With dead ends: 11318 [2020-12-23 09:58:43,787 INFO L226 Difference]: Without dead ends: 6804 [2020-12-23 09:58:43,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:58:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6804 states. [2020-12-23 09:58:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6804 to 4560. [2020-12-23 09:58:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4560 states. [2020-12-23 09:58:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 6767 transitions. [2020-12-23 09:58:44,210 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 6767 transitions. Word has length 78 [2020-12-23 09:58:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:44,211 INFO L481 AbstractCegarLoop]: Abstraction has 4560 states and 6767 transitions. [2020-12-23 09:58:44,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:58:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 6767 transitions. [2020-12-23 09:58:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:58:44,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:44,212 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] [2020-12-23 09:58:44,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:58:44,212 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 324678809, now seen corresponding path program 1 times [2020-12-23 09:58:44,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:44,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681515449] [2020-12-23 09:58:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:44,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681515449] [2020-12-23 09:58:44,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:44,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:44,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762045357] [2020-12-23 09:58:44,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:44,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:44,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:44,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:44,298 INFO L87 Difference]: Start difference. First operand 4560 states and 6767 transitions. Second operand 3 states. [2020-12-23 09:58:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:44,954 INFO L93 Difference]: Finished difference Result 13012 states and 19249 transitions. [2020-12-23 09:58:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:44,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:58:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:44,973 INFO L225 Difference]: With dead ends: 13012 [2020-12-23 09:58:44,973 INFO L226 Difference]: Without dead ends: 8498 [2020-12-23 09:58:44,980 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 [2020-12-23 09:58:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8498 states. [2020-12-23 09:58:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8498 to 8496. [2020-12-23 09:58:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8496 states. [2020-12-23 09:58:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8496 states to 8496 states and 12431 transitions. [2020-12-23 09:58:45,700 INFO L78 Accepts]: Start accepts. Automaton has 8496 states and 12431 transitions. Word has length 78 [2020-12-23 09:58:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:45,701 INFO L481 AbstractCegarLoop]: Abstraction has 8496 states and 12431 transitions. [2020-12-23 09:58:45,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8496 states and 12431 transitions. [2020-12-23 09:58:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:58:45,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:45,702 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] [2020-12-23 09:58:45,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:58:45,703 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1572186425, now seen corresponding path program 1 times [2020-12-23 09:58:45,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:45,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967321266] [2020-12-23 09:58:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:45,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967321266] [2020-12-23 09:58:45,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:45,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:45,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887196780] [2020-12-23 09:58:45,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:45,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:45,763 INFO L87 Difference]: Start difference. First operand 8496 states and 12431 transitions. Second operand 3 states. [2020-12-23 09:58:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:46,862 INFO L93 Difference]: Finished difference Result 24244 states and 35281 transitions. [2020-12-23 09:58:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:46,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:58:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:46,898 INFO L225 Difference]: With dead ends: 24244 [2020-12-23 09:58:46,898 INFO L226 Difference]: Without dead ends: 15794 [2020-12-23 09:58:46,911 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 [2020-12-23 09:58:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15794 states. [2020-12-23 09:58:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15794 to 15792. [2020-12-23 09:58:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2020-12-23 09:58:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 22703 transitions. [2020-12-23 09:58:48,231 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 22703 transitions. Word has length 78 [2020-12-23 09:58:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:48,231 INFO L481 AbstractCegarLoop]: Abstraction has 15792 states and 22703 transitions. [2020-12-23 09:58:48,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 22703 transitions. [2020-12-23 09:58:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:58:48,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:48,236 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] [2020-12-23 09:58:48,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:58:48,237 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -158143790, now seen corresponding path program 1 times [2020-12-23 09:58:48,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:48,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131990001] [2020-12-23 09:58:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:48,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:48,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131990001] [2020-12-23 09:58:48,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:48,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:58:48,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448924497] [2020-12-23 09:58:48,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:58:48,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:58:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:48,311 INFO L87 Difference]: Start difference. First operand 15792 states and 22703 transitions. Second operand 3 states. [2020-12-23 09:58:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:49,228 INFO L93 Difference]: Finished difference Result 33942 states and 48851 transitions. [2020-12-23 09:58:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:58:49,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-23 09:58:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:49,270 INFO L225 Difference]: With dead ends: 33942 [2020-12-23 09:58:49,270 INFO L226 Difference]: Without dead ends: 18196 [2020-12-23 09:58:49,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:58:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18196 states. [2020-12-23 09:58:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18196 to 18194. [2020-12-23 09:58:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18194 states. [2020-12-23 09:58:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 26097 transitions. [2020-12-23 09:58:50,546 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 26097 transitions. Word has length 79 [2020-12-23 09:58:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:50,547 INFO L481 AbstractCegarLoop]: Abstraction has 18194 states and 26097 transitions. [2020-12-23 09:58:50,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:58:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 26097 transitions. [2020-12-23 09:58:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:58:50,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:50,548 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] [2020-12-23 09:58:50,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:58:50,549 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1438624019, now seen corresponding path program 1 times [2020-12-23 09:58:50,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:50,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804910500] [2020-12-23 09:58:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:58:50,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804910500] [2020-12-23 09:58:50,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:50,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:58:50,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965419381] [2020-12-23 09:58:50,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:58:50,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:50,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:58:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:58:50,665 INFO L87 Difference]: Start difference. First operand 18194 states and 26097 transitions. Second operand 8 states. [2020-12-23 09:58:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:58:52,893 INFO L93 Difference]: Finished difference Result 29143 states and 41617 transitions. [2020-12-23 09:58:52,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:58:52,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2020-12-23 09:58:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:58:52,938 INFO L225 Difference]: With dead ends: 29143 [2020-12-23 09:58:52,938 INFO L226 Difference]: Without dead ends: 29141 [2020-12-23 09:58:52,945 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 [2020-12-23 09:58:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29141 states. [2020-12-23 09:58:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29141 to 18578. [2020-12-23 09:58:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18578 states. [2020-12-23 09:58:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18578 states to 18578 states and 26321 transitions. [2020-12-23 09:58:54,347 INFO L78 Accepts]: Start accepts. Automaton has 18578 states and 26321 transitions. Word has length 79 [2020-12-23 09:58:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:58:54,347 INFO L481 AbstractCegarLoop]: Abstraction has 18578 states and 26321 transitions. [2020-12-23 09:58:54,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:58:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18578 states and 26321 transitions. [2020-12-23 09:58:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:58:54,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:58:54,356 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] [2020-12-23 09:58:54,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:58:54,357 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:58:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:58:54,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1530216785, now seen corresponding path program 1 times [2020-12-23 09:58:54,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:58:54,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446348285] [2020-12-23 09:58:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:58:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:58:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 09:58:54,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446348285] [2020-12-23 09:58:54,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:58:54,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:58:54,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693792242] [2020-12-23 09:58:54,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:58:54,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:58:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:58:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:58:54,567 INFO L87 Difference]: Start difference. First operand 18578 states and 26321 transitions. Second operand 8 states. [2020-12-23 09:59:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:01,773 INFO L93 Difference]: Finished difference Result 136512 states and 193352 transitions. [2020-12-23 09:59:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:59:01,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 09:59:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:01,936 INFO L225 Difference]: With dead ends: 136512 [2020-12-23 09:59:01,936 INFO L226 Difference]: Without dead ends: 117982 [2020-12-23 09:59:01,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:59:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117982 states. [2020-12-23 09:59:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117982 to 37106. [2020-12-23 09:59:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37106 states. [2020-12-23 09:59:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37106 states to 37106 states and 52369 transitions. [2020-12-23 09:59:05,623 INFO L78 Accepts]: Start accepts. Automaton has 37106 states and 52369 transitions. Word has length 111 [2020-12-23 09:59:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:05,623 INFO L481 AbstractCegarLoop]: Abstraction has 37106 states and 52369 transitions. [2020-12-23 09:59:05,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:59:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37106 states and 52369 transitions. [2020-12-23 09:59:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:59:05,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:05,635 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] [2020-12-23 09:59:05,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:59:05,635 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1517242895, now seen corresponding path program 1 times [2020-12-23 09:59:05,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:05,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777169343] [2020-12-23 09:59:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:59:05,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777169343] [2020-12-23 09:59:05,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:05,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:59:05,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057256594] [2020-12-23 09:59:05,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:59:05,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:59:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:59:05,780 INFO L87 Difference]: Start difference. First operand 37106 states and 52369 transitions. Second operand 8 states. [2020-12-23 09:59:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:15,146 INFO L93 Difference]: Finished difference Result 155040 states and 219400 transitions. [2020-12-23 09:59:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:59:15,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 09:59:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:15,335 INFO L225 Difference]: With dead ends: 155040 [2020-12-23 09:59:15,336 INFO L226 Difference]: Without dead ends: 136510 [2020-12-23 09:59:15,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:59:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136510 states. [2020-12-23 09:59:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136510 to 64786. [2020-12-23 09:59:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64786 states. [2020-12-23 09:59:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64786 states to 64786 states and 91169 transitions. [2020-12-23 09:59:21,155 INFO L78 Accepts]: Start accepts. Automaton has 64786 states and 91169 transitions. Word has length 111 [2020-12-23 09:59:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:21,156 INFO L481 AbstractCegarLoop]: Abstraction has 64786 states and 91169 transitions. [2020-12-23 09:59:21,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:59:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 64786 states and 91169 transitions. [2020-12-23 09:59:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:59:21,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:21,169 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:59:21,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:59:21,169 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash -47809913, now seen corresponding path program 1 times [2020-12-23 09:59:21,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:21,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462516075] [2020-12-23 09:59:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:59:21,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462516075] [2020-12-23 09:59:21,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:21,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:59:21,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125320376] [2020-12-23 09:59:21,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:59:21,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:59:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:59:21,331 INFO L87 Difference]: Start difference. First operand 64786 states and 91169 transitions. Second operand 8 states. [2020-12-23 09:59:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:32,771 INFO L93 Difference]: Finished difference Result 173568 states and 245448 transitions. [2020-12-23 09:59:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:59:32,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 09:59:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:33,097 INFO L225 Difference]: With dead ends: 173568 [2020-12-23 09:59:33,097 INFO L226 Difference]: Without dead ends: 155038 [2020-12-23 09:59:33,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:59:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155038 states. [2020-12-23 09:59:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155038 to 83314. [2020-12-23 09:59:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83314 states. [2020-12-23 09:59:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83314 states to 83314 states and 117217 transitions. [2020-12-23 09:59:40,062 INFO L78 Accepts]: Start accepts. Automaton has 83314 states and 117217 transitions. Word has length 111 [2020-12-23 09:59:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:40,062 INFO L481 AbstractCegarLoop]: Abstraction has 83314 states and 117217 transitions. [2020-12-23 09:59:40,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:59:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 83314 states and 117217 transitions. [2020-12-23 09:59:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 09:59:40,075 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:40,075 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:59:40,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:59:40,075 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1283268953, now seen corresponding path program 1 times [2020-12-23 09:59:40,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:40,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741865106] [2020-12-23 09:59:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:59:40,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741865106] [2020-12-23 09:59:40,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:40,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:59:40,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330907666] [2020-12-23 09:59:40,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:59:40,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:40,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:59:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:59:40,241 INFO L87 Difference]: Start difference. First operand 83314 states and 117217 transitions. Second operand 8 states. [2020-12-23 09:59:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:53,531 INFO L93 Difference]: Finished difference Result 192096 states and 271496 transitions. [2020-12-23 09:59:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:59:53,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 09:59:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:53,904 INFO L225 Difference]: With dead ends: 192096 [2020-12-23 09:59:53,904 INFO L226 Difference]: Without dead ends: 173566 [2020-12-23 09:59:53,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:59:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173566 states. [2020-12-23 10:00:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173566 to 101842. [2020-12-23 10:00:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101842 states. [2020-12-23 10:00:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101842 states to 101842 states and 143265 transitions. [2020-12-23 10:00:02,976 INFO L78 Accepts]: Start accepts. Automaton has 101842 states and 143265 transitions. Word has length 111 [2020-12-23 10:00:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:02,977 INFO L481 AbstractCegarLoop]: Abstraction has 101842 states and 143265 transitions. [2020-12-23 10:00:02,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:00:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 101842 states and 143265 transitions. [2020-12-23 10:00:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 10:00:02,988 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:02,988 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:02,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:00:02,989 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1590702791, now seen corresponding path program 1 times [2020-12-23 10:00:02,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:02,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816629726] [2020-12-23 10:00:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 10:00:03,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816629726] [2020-12-23 10:00:03,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:03,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 10:00:03,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780755615] [2020-12-23 10:00:03,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 10:00:03,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 10:00:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 10:00:03,354 INFO L87 Difference]: Start difference. First operand 101842 states and 143265 transitions. Second operand 8 states. [2020-12-23 10:00:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:19,199 INFO L93 Difference]: Finished difference Result 210624 states and 297544 transitions. [2020-12-23 10:00:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 10:00:19,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 10:00:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:19,587 INFO L225 Difference]: With dead ends: 210624 [2020-12-23 10:00:19,587 INFO L226 Difference]: Without dead ends: 192094 [2020-12-23 10:00:19,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 10:00:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192094 states. [2020-12-23 10:00:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192094 to 120370. [2020-12-23 10:00:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120370 states. [2020-12-23 10:00:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120370 states to 120370 states and 169313 transitions. [2020-12-23 10:00:30,660 INFO L78 Accepts]: Start accepts. Automaton has 120370 states and 169313 transitions. Word has length 111 [2020-12-23 10:00:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:30,660 INFO L481 AbstractCegarLoop]: Abstraction has 120370 states and 169313 transitions. [2020-12-23 10:00:30,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:00:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 120370 states and 169313 transitions. [2020-12-23 10:00:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 10:00:30,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:30,672 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:00:30,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:00:30,672 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:30,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1024882407, now seen corresponding path program 1 times [2020-12-23 10:00:30,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:30,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297889279] [2020-12-23 10:00:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 10:00:30,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297889279] [2020-12-23 10:00:30,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:30,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 10:00:30,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734090299] [2020-12-23 10:00:30,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 10:00:30,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 10:00:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 10:00:30,859 INFO L87 Difference]: Start difference. First operand 120370 states and 169313 transitions. Second operand 8 states. [2020-12-23 10:00:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:49,764 INFO L93 Difference]: Finished difference Result 224352 states and 316872 transitions. [2020-12-23 10:00:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 10:00:49,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-12-23 10:00:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:50,237 INFO L225 Difference]: With dead ends: 224352 [2020-12-23 10:00:50,238 INFO L226 Difference]: Without dead ends: 208222 [2020-12-23 10:00:50,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-12-23 10:00:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208222 states. [2020-12-23 10:01:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208222 to 136498. [2020-12-23 10:01:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136498 states. [2020-12-23 10:01:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136498 states to 136498 states and 192033 transitions. [2020-12-23 10:01:03,949 INFO L78 Accepts]: Start accepts. Automaton has 136498 states and 192033 transitions. Word has length 111 [2020-12-23 10:01:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:03,949 INFO L481 AbstractCegarLoop]: Abstraction has 136498 states and 192033 transitions. [2020-12-23 10:01:03,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 10:01:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 136498 states and 192033 transitions. [2020-12-23 10:01:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 10:01:03,962 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:03,962 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:03,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:01:03,963 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1441172198, now seen corresponding path program 1 times [2020-12-23 10:01:03,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:03,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46889807] [2020-12-23 10:01:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:04,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46889807] [2020-12-23 10:01:04,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:04,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:04,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866404958] [2020-12-23 10:01:04,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:04,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:04,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:04,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:04,315 INFO L87 Difference]: Start difference. First operand 136498 states and 192033 transitions. Second operand 3 states. [2020-12-23 10:01:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:17,287 INFO L93 Difference]: Finished difference Result 272950 states and 384019 transitions. [2020-12-23 10:01:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:01:17,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-12-23 10:01:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:17,599 INFO L225 Difference]: With dead ends: 272950 [2020-12-23 10:01:17,599 INFO L226 Difference]: Without dead ends: 136500 [2020-12-23 10:01:17,664 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 [2020-12-23 10:01:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136500 states. [2020-12-23 10:01:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136500 to 136498. [2020-12-23 10:01:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136498 states. [2020-12-23 10:01:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136498 states to 136498 states and 190385 transitions. [2020-12-23 10:01:30,997 INFO L78 Accepts]: Start accepts. Automaton has 136498 states and 190385 transitions. Word has length 112 [2020-12-23 10:01:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:30,997 INFO L481 AbstractCegarLoop]: Abstraction has 136498 states and 190385 transitions. [2020-12-23 10:01:30,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:01:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 136498 states and 190385 transitions. [2020-12-23 10:01:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 10:01:31,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:31,005 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:01:31,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:01:31,006 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1528290992, now seen corresponding path program 1 times [2020-12-23 10:01:31,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:31,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557922412] [2020-12-23 10:01:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:01:31,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557922412] [2020-12-23 10:01:31,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:31,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:01:31,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10439635] [2020-12-23 10:01:31,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:01:31,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:01:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:01:31,362 INFO L87 Difference]: Start difference. First operand 136498 states and 190385 transitions. Second operand 3 states.